Online linear optimization via smoothing

Journal of Machine Learning Research

Volumn 35, Issue , 2014, Pages 807-823

  Abernethy, Jacob ^a   Lee, Chansoo ^a   Sinha, Abhinav ^a   Tewari, Ambuj ^a  

^a UNIVERSITY OF MICHIGAN   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ALGORITHMS; OPTIMIZATION; STOCHASTIC SYSTEMS;

FOLLOW THE LEADERS; FOLLOW THE PERTURBED LEADER; FOLLOW THE REGULARIZED LEADERS; GENERIC ANALYSIS; ONLINE LINEAR OPTIMIZATIONS; PENALTY FUNCTION; SMOOTHING OPERATION; STOCHASTIC PERTURBATIONS;

LINEAR PROGRAMMING;

EID: 84939616157     PISSN: 15324435     EISSN: 15337928     Source Type: Journal    
DOI: None     Document Type: Conference Paper

References (29)

1. Jacob Abernethy, Yiling Chen, and Jennifer Wortman Vaughan. Efficient market making via convex optimization, and a connection to online learning. ACM Transactions on Economics and Computation, 1(2):12, 2013.
2. Amir Beck and Marc Teboulle. Smoothing and first order methods: A unified framework. SIAM Journal on Optimization, 22(2):557-580, 2012.
3. Dimitri P. Bertsekas. Stochastic optimization problems with nondifferentiable cost functionals. Journal of Optimization Theory and Applications, 12(2):218-231, 1973. ISSN 0022-3239. doi: 10.1007/BF00934819.
4. Shalabh Bhatnagar. Adaptive newton-based multivariate smoothed functional algorithms for simulation optimization. ACM Transactions on Modeling and Computer Simulation, 2007.
5. Chris M. Bishop. Training with noise is equivalent to tikhonov regularization. Neural Computation, 7(1):108-116, January 1995. ISSN 0899-7667.
6. Nicolò Cesa-Bianchi and Gábor Lugosi. Prediction, learning, and games. Cambridge University Press, 2006. ISBN 978-0-521-84108-5.
7. Luc Devroye, Gábor Lugosi, and Gergely Neu. Prediction by random-walk perturbation. In Proceedings of Conference on Learning Theory (COLT), 2013.
8. John Duchi, Elad Hazan, and Yoram Singer. Adaptive subgradient methods for online learning and stochastic optimization. In Proceedings of Conference on Learning Theory (COLT), 2010.
9. John Duchi, Peter L. Bartlett, and Martin J. Wainwright. Randomized smoothing for stochastic optimization. SIAM Journal on Optimization, 22(2):674-701, 2012. doi: 10.1137/110831659.
10. Yoav Freund and Robert E. Schapire. A decision-theoretic generalization of on-line learning and an application to boosting. Journal of Computer and System Sciences, 55(1):119-139, 1997. ISSN 0022-0000. doi: http://dx.doi.org/10.1006/jcss.1997.1504.
11. Paul Glasserman. Gradient Estimation Via Perturbation Analysis. Kluwer international series in engineering and computer science: Discrete event dynamic systems. Springer, 1991. ISBN 9780792390954.
12. James Hannan. Approximation to bayes risk in repeated play. Contributions to the Theory of Games, 3:97-139, 1957.
13. John C. Harsanyi. Oddness of the number of equilibrium points: a new proof. International Journal of Game Theory, 2(1):235-250, 1973.
14. James R. Harvey. Fractional moments of a quadratic form in noncentral normal random variables, April 1965.
15. Geoffrey E. Hinton, Nitish Srivastava, Alex Krizhevsky, Ilya Sutskever, and Ruslan Salakhutdinov. Improving neural networks by preventing co-adaptation of feature detectors. ArXiv preprint, arXiv:1207.0580, 2012.
16. Josef Hofbauer and William H. Sandholm. On the global convergence of stochastic fictitious play. Econometrica, 70(6):2265-2294, 2002.
17. Adam T. Kalai and Santosh Vempala. Efficient algorithms for online decision problems. Journal of Computer and System Sciences, 71(3):291-307, 2005.
18. H. Brendan McMahan. Follow-the-regularized-leader and mirror descent: Equivalence theorems and l1 regularization. In AISTATS, pages 525-533, 2011.
19. Ilya S. Molchanov. Theory of random sets. Probability and its applications. Springer, New York, 2005. ISBN 1-85233-892-X.
20. Yurii Nesterov. Random gradient-free minimization of convex functions. ECORE Discussion Paper, 2011.
21. Alexander Rakhlin, Ohad Shamir, and Karthik Sridharan. Relax and randomize: From value to algorithms. In Proceedings of Neural Information Processing Systems (NIPS), 2012.
22. R. T. Rockafellar. Convex Analysis. Convex Analysis. Princeton University Press, 1997. ISBN 9780691015866.
23. Shai Shalev-Shwartz. Online learning and online convex optimization. Foundations and Trends in Machine Learning, 4(2):107-194, February 2012. ISSN 1935-8237.
24. Nati Srebro, Karthik Sridharan, and Ambuj Tewari. On the universality of online mirror descent. In Proceedings of Neural Information Processing Systems (NIPS), pages 2645-2653, 2011.
25. Tim Van Erven, Wojciech Kotlowski, and Manfred K. Warmuth. Follow the leader with dropout perturbations. In Proceedings of Conference on Learning Theory (COLT), 2014.
26. Stefan Wager, Sida Wang, and Percy Liang. Dropout training as adaptive regularization. In Proceedings of Neural Information Processing Systems (NIPS), 2013.
27. Manfred Warmuth. A perturbation that makes "Follow the leader" equivalent to "Randomized weighted majority". http://classes.soe.ucsc.edu/cmps290c/Spring09/lect/10/wmkalai-rewrite.pdf, 2009.
28. Farzad Yousean, Angelia Nedić, and Uday V. Shanbhag. Convex nondifferentiable stochastic optimization: A local randomized smoothing technique. In Proceedings of American Control Conference (ACC), 2010, pages 4875-4880, June 2010.
29. Martin Zinkevich. Online convex programming and generalized infinitesimal gradient ascent. In International Conference on Machine Learning (ICML), 2003.