Online Learning: Beyond Regret

  • Rakhlin A
  • Sridharan K
  • Tewari A
  • 57

    Readers

    Mendeley users who have this article in their library.
  • 12

    Citations

    Citations of this article.

Abstract

We study online learnability of a wide class of problems, extending the results of (Rakhlin, Sridharan, Tewari, 2010) to general notions of performance measure well beyond external regret. Our framework simultaneously captures such well-known notions as internal and general Phi-regret, learning with non-additive global cost functions, Blackwell's approachability, calibration of forecasters, adaptive regret, and more. We show that learnability in all these situations is due to control of the same three quantities: a martingale convergence term, a term describing the ability to perform well if future is known, and a generalization of sequential Rademacher complexity, studied in (Rakhlin, Sridharan, Tewari, 2010). Since we directly study complexity of the problem instead of focusing on efficient algorithms, we are able to improve and extend many known results which have been previously derived via an algorithmic construction.

Get free article suggestions today

Mendeley saves you time finding and organizing research

Sign up here
Already have an account ?Sign in

Find this document

  • PUI: 372812377
  • arXiv: 1011.3168
  • ISSN: 15337928
  • SCOPUS: 2-s2.0-84898407994
  • SGR: 84898407994

Authors

  • Alexander Rakhlin

  • Karthik Sridharan

  • Ambuj Tewari

Cite this document

Choose a citation style from the tabs below

Save time finding and organizing research with Mendeley

Sign up for free