A stochastic view of optimal regret through minimax duality

COLT 2009 - The 22nd Conference on Learning Theory

Volumn , Issue , 2009, Pages

  Abernethy, Jacob ^a   Agarwal, Alekh ^a   Bartlett, Peter L ^a   Rakhlin, Alexander ^b  

^a UNIVERSITY OF CALIFORNIA   (United States)

^b UNIVERSITY OF PENNSYLVANIA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ACTION SEQUENCES; EMPIRICAL MINIMIZATION; GEOMETRIC INTERPRETATION; JENSEN'S INEQUALITY; JOINT DISTRIBUTIONS; ONLINE CONVEX OPTIMIZATIONS; OPTIMAL STRATEGIES; UPPER AND LOWER BOUNDS;

CONVEX OPTIMIZATION; OPTIMAL SYSTEMS; PROBABILITY DISTRIBUTIONS; RANDOM PROCESSES;

OPTIMIZATION;

EID: 84898066957     PISSN: None     EISSN: None     Source Type: Conference Proceeding    
DOI: None     Document Type: Conference Paper

References (22)

1. J. Abernethy, A. Agarwal, P. L. Bartlett, and A. Rakhlin. A stochastic view of optimal regret through minimax duality. CoRR, abs/0903.5328, 2009. http://arXiv.org/abs/0903.5328.
2. J. Abernethy, P. L. Bartlett, A. Rakhlin, and A. Tewari. Optimal strategies and minimax lower bounds for online convex games. In COLT, 2008.
3. P. L. Bartlett, E. Hazan, and A. Rakhlin. Adaptive online gradient descent. In NIPS, 2007.
4. P. L. Bartlett, M. I. Jordan, and J. D. McAuliffe. Convexity, classification, and risk bounds. Journal of the American Statistical Association, 101(473): 138-156, 2006.
5. J. M. Borwein and A.S. Lewis. Convex Analysis and Nonlinear Optimization. Advanced Books in Mathematics. Canadian Mathematical Society, To appear.
6. N. Cesa-Bianchi and G. Lugosi. On prediction of individual sequences. Ann. Stat., 27(6): 1865-1895, 1999.
7. N. Cesa-Bianchi and G. Lugosi. Prediction, Learning, and Games. Cambr. Univ. Press, 2006.
8. V. de la Penã and E. Gine. Decoupling: From Dependence to Independence. Springer, 1998.
9. Y. Freund. Predicting a binary sequence almost as well as the optimal biased coin. Inf. Comput., 182(2): 73-94, 2003.
10. B. A. Frigyik, S. Srivastava, and M. R. Gupta. Functional bregman divergence and bayesian estimation of distributions. CoRR, abs/cs/0611123, 2006.
11. E. Hazan, A. Kalai, S. Kale, and A. Agarwal. Logarithmic regret algorithms for online convex optimization. In COLT, pages 499-513, 2006.
12. J.-B. Hiriart-Urruty and C. Lemaréchal. Fundamentals of Convex Analysis. Springer, 2001.
13. R. Latala and K. Oleszkiewicz. On the best constant in the Khinchin-Kahane inequality. Studia Math., 109(1): 101-104, 1994.
14. G. Lecué and S. Mendelson. Sharper lower bounds on the performance of the empirical risk minimization algorithm. Available at http://www.cmi.univ- mrs.fr/lecue/LM2.pdf.
15. W. S. Lee, P. L. Bartlett, and R. C. Williamson. The importance of convexity in learning with squared loss. IEEE Transactions on Information Theory, 44(5): 1974-1980, 1998.
16. S. Mendelson. A few notes on statistical learning theory. In S. Mendelson and A. J. Smola, editors, Advanced Lectures in Machine Learning, LNCS 2600, Machine Learning Summer School 2002, Canberra, Australia, February 11-22, pages 1-40. Springer, 2003.
17. S. Mendelson. Lower bounds for the empirical minimization algorithm. IEEE Transactions on Information Theory, 2008. To appear.
18. N. Merhav and M. Feder. Universal prediction. IEEE Transactions on Information Theory, 44: 2124-2147, 1998.
19. K. Sridharan and A. Tewari. Convex games in banach spaces (working title), 2009. Unpublished.
20. E. Takimoto and M. Warmuth. The minimax strategy for gaussian density estimation. In COLT, pages 100-106. Morgan Kaufmann, San Francisco, 2000.
21. V. Vovk. Competitive on-line linear regression. In NIPS'97: Proceedings of the 1997 conference on Advances in neural information processing systems 10, pages 364-370, Cambridge, MA, USA, 1998. MIT Press.
22. M. Zinkevich. Online convex programming and generalized infinitesimal gradient ascent. In ICML, pages 928-936, 2003.