We review recent advances on uniform martingale laws of large numbers and the associated sequential complexity measures. These results may be considered as forming a non-i.i.d. generalization of Vapnik-Chervonenkis theory. We discuss applications to online learning, provide a recipe for designing online learning algorithms, and illustrate the techniques on the problem of online node classification. We outline connections to statistical learning theory and discuss inductive principles of stochastic approximation and empirical risk minimization.
CITATION STYLE
Rakhlin, A., & Sridharan, K. (2015). On martingale extensions of Vapnik-Chervonenkis theory with applications to online learning. In Measures of Complexity: Festschrift for Alexey Chervonenkis (pp. 197–215). Springer International Publishing. https://doi.org/10.1007/978-3-319-21852-6_15
Mendeley helps you to discover research relevant for your work.