Improved strongly adaptive online learning using coin betting

Proceedings of the 20th International Conference on Artificial Intelligence and Statistics, AISTATS 2017

Volumn , Issue , 2017, Pages

  Jun, Kwang Sung ^a   Orabona, Francesco ^b   Wright, Stephen ^a   Willett, Rebecca ^a  

^a UNIVERSITY OF WISCONSIN MADISON   (United States)

^b STONY BROOK UNIVERSITY   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

ARTIFICIAL INTELLIGENCE; E-LEARNING;

ADAPTIVE ONLINE LEARNING; ADAPTIVE REGRETS; CHANGING ENVIRONMENT; METRIC LEARNING; NEW PARAMETERS; ONLINE LEARNING ALGORITHMS; STATE-OF-THE-ART METHODS; TIME COMPLEXITY;

LEARNING ALGORITHMS;

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

References (14)

1. D. Adamskiy, W. M. Koolen, A. Chernov, and V. Vovk, “A Closer Look at Adaptive Regret,” in Proceedings of the International Conference on Algorithmic Learning Theory (ALT), 2012, pp. 290–304.
2. A. Blum and A. Blum, “Empirical Support for Winnow and Weighted-Majority Algorithms: Results on a Calendar Scheduling Domain,” Machine Learning, vol. 26, no. 1, pp. 5–23, 1997.
3. N. Cesa-Bianchi, P. Gaillard, G. Lugosi, and G. Stoltz, “Mirror descent meets fixed share (and feels no regret),” in Advances in Neural Information Processing Systems (NIPS), 2012, pp. 980–988.
4. N. Cesa-Bianchi and G. Lugosi, Prediction, Learning, and Games. Cambridge University Press, 2006.
5. A. Daniely, A. Gonen, and S. Shalev-Shwartz, “Strongly Adaptive Online Learning,” Proceedings of the International Conference on Machine Learning (ICML), pp. 1–18, 2015.
6. Y. Freund, R. E. Schapire, Y. Singer, and M. K. Warmuth, “Using and combining predictors that specialize,” Proceedings of the ACM symposium on Theory of computing (STOC), vol. 37, no. 3, pp. 334–343, 1997.
7. K. Greenewald, S. Kelley, and A. O. Hero, “Dynamic metric learning from pairwise comparisons,” 54th Annual Allerton Conference on Communication, Control, and Computing (Allerton), 2016.
8. A. György, T. Linder, and G. Lugosi, “Efficient tracking of large classes of experts,” IEEE Transactions on Information Theory, vol. 58, no. 11, pp. 6709–6725, 2012.
9. E. Hazan and C. Seshadhri, “Adaptive Algorithms for Online Decision Problems,” IBM Research Report, vol. 10418, pp. 1–19, 2007.
10. M. Herbster and M. K. Warmuth, “Tracking the Best Expert,” Mach. Learn., vol. 32, no. 2, pp. 151–178, 1998.
11. G. Kunapuli and J. Shavlik, “Mirror descent for metric learning: A unified approach,” in Proceedings of the European Conference on Machine Learning and Principles and Practice of Knowledge Discovery in Database (ECML/PKDD), 2012, pp. 859–874.
12. H. Luo and R. E. Schapire, “Achieving All with No Parameters: AdaNormalHedge,” in Proceedings of the Conference on Learning Theory (COLT), 2015, pp. 1286–1304.
13. F. Orabona and D. Pal, “Coin betting and parameter-free online learning,” in Advances in Neural Information Processing Systems (NIPS), 2016, pp. 577–585.
14. J. Veness, M. White, M. Bowling, and A. György, “Partition tree weighting,” in Proceedings of the 2013 Data Compression Conference. IEEE Computer Society, 2013, pp. 321–330.