Online Learning: Random Averages, Combinatorial Parameters, and Learnability

  title={Online Learning: Random Averages, Combinatorial Parameters, and Learnability},
  author={Alexander Rakhlin and Karthik Sridharan and Ambuj Tewari},
We develop a theory of online learning by defining several complexity measures. Among them are analogues of Rademacher complexity, covering numbers and fatshattering dimension from statistical learning theory. Relationship among these complexity measures, their connection to online learning, and tools for bounding them are provided. We apply these results… CONTINUE READING



Citations per Year

94 Citations

Semantic Scholar estimates that this publication has 94 citations based on the available data.

See our FAQ for additional information.