Work

Online Learning: Random Averages, Combinatorial Parameters, and Learnability

Year: 2010
Type: article
Abstract: We develop a theory of online learning by defining several complexity measures. Among them are analogues of Rademacher complexity, covering numbers and fat-shattering 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 to various learning problems. We provide a complete characterization of online learnability in the supervised setting. 1
Language: English
Open Access status: green
OpenAlex ID: W2121367301
FWCI: 7.734
Cites: 48
Cited by: 113
Related to: 10