Adaptive online learning

Advances in Neural Information Processing Systems

Volumn 2015-January, Issue , 2015, Pages 3375-3383

  Foster, Dylan J ^a,c   Rakhlin, Alexander ^b,d   Sridharan, Karthik ^a,c  

^a Department of Molecular Biology and Genetics   (United States)

^b UNIVERSITY OF PENNSYLVANIA   (United States)

^c Deptartment of Computer Science   (United States)

^d Deptartment of Statistics   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

INFORMATION SCIENCE; LINEAR PROGRAMMING; RANDOM PROCESSES;

ADAPTIVE ONLINE LEARNING; ADAPTIVE REGRETS; ANALYSIS TECHNIQUES; COMPLEXITY MEASURES; MODEL SELECTION; ONLINE LEARNING; ONLINE LINEAR OPTIMIZATIONS; SECOND-ORDER DATA;

E-LEARNING;

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

References (26)

1. Lucien Birgé, Pascal Massart, et al. Minimum contrast estimators on sieves: exponential bounds and rates of convergence. Bernoulli, 4(3):329-375, 1998.
2. Gábor Lugosi and Andrew B Nobel. Adaptive model selection using empirical complexities. Annals of Statistics, pages 1830-1864, 1999.
3. Peter L. Bartlett, Stéphane Boucheron, and Gábor Lugosi. Model selection and error estimation. Machine Learning, 48(1-3):85-113, 2002.
4. Pascal Massart. Concentration inequalities and model selection, volume 10. Springer, 2007.
5. Shahar Mendelson. Learning without Concentration. In Conference on Learning Theory, 2014.
6. Tengyuan Liang, Alexander Rakhlin, and Karthik Sridharan. Learning with square loss: Localization through offset rademacher complexity. Proceedings of The 28th Conference on Learning Theory, 2015.
7. Alexander Rakhlin and Karthik Sridharan. Online nonparametric regression. Proceedings of The 27th Conference on Learning Theory, 2014.
8. Alexander Rakhlin, Karthik Sridharan, and Ambuj Tewari. Online learning: Random averages, combinatorial parameters, and learnability. In Advances in Neural Information Processing Systems 23. 2010.
9. Elad Hazan and Satyen Kale. Extracting certainty from uncertainty: Regret bounded by variation in costs. Machine learning, 80(2):165-188, 2010.
10. Chao-Kai Chiang, Tianbao Yang, Chia-Jung Lee, Mehrdad Mahdavi, Chi-Jen Lu, Rong Jin, and Shenghuo Zhu. Online optimization with gradual variations. In COLT, 2012.
11. Alexander Rakhlin and Karthik Sridharan. Online learning with predictable sequences. In Proceedings of the 26th Annual Conference on Learning Theory (COLT), 2013.
12. John Duchi, Elad Hazan, and Yoram Singer. Adaptive subgradient methods for online learning and stochastic optimization. The Journal of Machine Learning Research, 12:2121-2159, 2011.
13. Nicolo Cesa-Bianchi, Yishay Mansour, and Gilles Stoltz. Improved second-order bounds for prediction with expert advice. Machine Learning, 66(2-3):321-352, 2007.
14. Kamalika Chaudhuri, Yoav Freund, and Daniel J Hsu. A parameter-free hedging algorithm. In Advances in neural information processing systems, pages 297-305, 2009.
15. H. Brendan McMahan and Francesco Orabona. Unconstrained online linear learning in hilbert spaces: Minimax algorithms and normal approximations. Proceedings of The 27th Conference on Learning Theory, 2014.
16. Nicolo Cesa-Bianchi and Gábor Lugosi. Prediction, Learning, and Games. Cambridge University Press, 2006.
17. Nathan Srebro, Karthik Sridharan, and Ambuj Tewari. Smoothness, low noise and fast rates. In Advances in neural information processing systems, pages 2199-2207, 2010.
18. Haipeng Luo and Robert E. Schapire. Achieving all with no parameters: Adaptive normalhedge. CoRR, abs/1502.05934, 2015.
19. Wouter M. Koolen and Tim van Erven. Second-order quantile methods for experts and combinatorial games. In Proceedings of the 28th Annual Conference on Learning Theory (COLT), pages 1155-1175, 2015.
20. Thomas M. Cover. Behavior of sequential predictors of binary sequences. In in Trans. 4th Prague Conference on Information Theory, Statistical Decision Functions, Random Processes, pages 263-272. Publishing House of the Czechoslovak Academy of Sciences, 1967.
21. Alexander Rakhlin and Karthik Sridharan. Statistical learning theory and sequential prediction, 2012. Available at http://stat.wharton. upenn.edu/~rakhlin/book-draft.pdf.
22. Iosif Pinelis. Optimum bounds for the distributions of martingales in banach spaces. The Annals of Probability, 22(4):1679-1706, 10 1994.
23. Alexander Rakhlin, Karthik Sridharan, and Ambuj Tewari. Online learning: Beyond regret. arXiv preprint arXiv:1011.3168, 2010.
24. Alexander Rakhlin, Karthik Sridharan, and Ambuj Tewari. Sequential complexities and uniform martingale laws of large numbers. Probability Theory and Related Fields, 2014.
25. Eyal Even-Dar, Michael Kearns, Yishay Mansour, and Jennifer Wortman. Regret to the best vs. regret to the average. Machine Learning, 72(1-2):21-37, 2008.
26. Alexander Rakhlin, Ohad Shamir, and Karthik Sridharan. Relax and randomize: From value to algorithms. Advances in Neural Information Processing Systems 25, pages 2150-2158, 2012.