Convex games in banach spaces

COLT 2010 - The 23rd Conference on Learning Theory

Volumn , Issue , 2010, Pages 1-13

  Sridharan, Karthik ^a   Tewari, Ambuj ^a  

^a TOYOTA TECHNOLOGICAL INSTITUTE AT CHICAGO   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ADAPTIVE MIRRORS; CONVEX FUNCTIONS; CONVEX GAME; LINEAR FUNCTIONS; LOSS FUNCTIONS; MINIMAX REGRET; UNIFORM CONVEXITY; UNIFORMLY CONVEXES;

ALGORITHMS; CONVEX OPTIMIZATION; FUNCTIONS; MIRRORS;

BANACH SPACES;

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

References (22)

1. M. Zinkevich. Online convex programming and generalized infinitesimal gradient ascent. In Proceedings of the Twentieth International Conference on Machine Learning, 2003.
2. E. Hazan, A. Agarwal, and S. Kale. Logarithmic regret algorithms for online convex optimization. Machine Learning, 69(2-3):169-192, 2007.
3. S. Shalev-Shwartz. Online Learning: Theory, Algorithms, and Applications. PhD thesis, The Hebrew University, 2007.
4. V. Vovk. Competing with wild prediction rules. Machine Learning, 69(2-3):193-212, 2007.
5. J. Abernethy, P. L. Bartlett, A. Rakhlin, and A. Tewari. Optimal strategies and minimax lower bounds for online convex games. In Proceedings of the Nineteenth Annual Conference on Computational Learning Theory, 2008.
6. A. Nemirovski and D. Yudin. Problem complexity and method efficiency in optimization. Nauka Publishers, Moscow, 1978.
7. P. L. Bartlett, E. Hazan, and A. Rakhlin. Adaptive online gradient descent. In Advances in Neural Information Processing Systems 21, 2007.
8. J. Abernethy, A. Agarwal, P. L. Bartlett, and A. Rakhlin. A stochastic view of optimal regret through minimax duality. In Proceedings of the Twentieth Annual Conference on Computational Learning Theory, 2009.
9. M. J. Donahue, L. Gurvits, C. Darken, and E. Sontag. Rates of convex approximation in non-Hilbert spaces. Constructive Approximation, 13:187-220, 1997.
10. L. Gurvits. A note on a scale-sensitive dimension of linear bounded functionals in Banach spaces. Theoretical Computer Science, 261(1):81-90, 2001.
11. S. Mendelson and G. Schechtman. The shattering dimension of sets of linear functionals. The Annals of Probability, 32(3):1746-1770, 2004.
12. R. Der and D. Lee. Large-margin classification in Banach spaces. In Processing of Eleventh International Conference on Artificial Intelligence and Statistics, 2007.
13. Haizhang Zhang, Yuesheng Xu, and Jun Zhang. Reproducing kernel Banach spaces for machine learning. Journal of Machine Learning Research, 10:2741-2775, 2009.
14. Fedor Zhdanov, Alexey Chernov, and Yuri Kalnishkan. Aggregating algorithm competing with Banach lattices, 2010. arXiv preprint arXiv:1002.0709 available at http://arxiv.org/abs/1002.0709.
15. N. Cesa-Bianchi and G. Lugosi. Prediction, learning, and games. Cambridge University Press, 2006.
16. G. Pisier. Probabilistic methods in the geometry of Banach spaces. In G. Letta and M. Pratelli, editors, Probability and Analysis, Volume 1206 of Lecture Notes in Mathematics, pages 167-241. Springer, 1986.
17. G. Pisier. Martingales with values in uniformly convex spaces. Israel Journal of Mathematics, 20(3-4):326-350, 1975.
18. C. Zalinescu. Convex analysis in general vector spaces. World Scientific Publishing Co. Inc., River Edge, NJ, 2002.
19. n. C. R. Acad. Sci. Paris Sér. A-B, 277:A991-A994, 1973.
20. J. Borwein, A. J. Guirao, P. Hàjek, and J. Vanderwerff. Uniformly convex functions on Banach spaces. Proceedings of the American Mathematical Society, 137(3):1081-1091, 2009.
21. J. Kivinen, A. J. Smola, and R. C. Williamson. Online learning with kernels. IEEE Transactions on Signal Processing, 52(8):2165-2176, 2002.
22. K. Sridharan and A. Tewari. Convex games in banach spaces. Technical Report no. TTIC-TR-2009-6, Toyota Technological Institute at Chicago, 2009.