Fetching the paper…
Reading the bibliography…
How quickly can a given class of concepts be learned from examples? It is common to measure the performance of a supervised machine learning algorithm by plotting its "learning curve", that is, the decay of the error rate as a function of the number of training examples.
Infinite games with perfect information
D. Gale and F. M. Stewart · 1953
Earlier work this paper cites.
Cardinal and Ordinal Numbers
S. Sierpiński · 1965
Earlier work this paper cites.
On the uniform convergence of relative frequencies of events to their probabilities
V. Vapnik and A. Chervonenkis · 1971
Earlier work this paper cites.
Theory of Pattern Recognition
V. Vapnik and A. Chervonenkis · 1974
Earlier work this paper cites.
Les dérivations en théorie descriptive des ensembles et le théorème de la borne
C. Dellacherie · 1977
Earlier work this paper cites.
Consistent nonparametric regression
C. J. Stone · 1977
Earlier work this paper cites.
Measure Theory
D. L. Cohn · 1980
Earlier work this paper cites.
A theory of the learnable
L. G. Valiant · 1984
Earlier work this paper cites.
Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm
N. Littlestone · 1988
Earlier work this paper cites.
Learnability and the Vapnik-Chervonenkis dimension
A. Blumer, A. Ehrenfeucht, D. Haussler, and M. Warmuth · 1989
Earlier work this paper cites.
A general lower bound on the number of examples needed for learning
A. Ehrenfeucht, D. Haussler, M. Kearns, and L. Valiant · 1989
Earlier work this paper cites.
Can neural networks do better than the Vapnik-Chervonenkis bounds?
D. Cohn and G. Tesauro · 1990
Earlier work this paper cites.
How tight are the Vapnik-Chervonenkis bounds?
D. Cohn and G. Tesauro · 1992
Cited alongside, same era.
Model Theory , volume 42 of Encyclopedia of Mathematics and its Applications
W. Hodges · 1993
Cited alongside, same era.
Nonuniform learnability
G. M. Benedek and A. Itai · 1994
Cited alongside, same era.
Predicting { 0 , 1 } \{0,1\} -functions on randomly drawn points
D. Haussler, N. Littlestone, and M. Warmuth · 1994
Cited alongside, same era.
Classical Descriptive Set Theory , volume 156 of Graduate Texts in Mathematics
A. S. Kechris · 1995
Cited alongside, same era.
A Probabilistic Theory of Pattern Recognition
L. Devroye, L. Györfi, and G. Lugosi · 1996
Cited alongside, same era.
Theoretical Foundations of Active Learning
S. Hanneke · 2009
Later among the works it cites.
The true sample complexity of active learning
M.-F. Balcan, S. Hanneke, and J. Wortman Vaughan · 2010
Later among the works it cites.
PAC learnability versus VC dimension: A footnote to a basic result of statistical learning
V. Pestov · 2011
Later among the works it cites.
Activized learning: Transforming passive to active with improved label complexity
S. Hanneke · 2012
Later among the works it cites.
The universal Glivenko-Cantelli property
R. van Handel · 2013
Later among the works it cites.
Activized learning with uniform classification noise
L. Yang and S. Hanneke · 2013
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Characterizing rational versus exponential learning curves
D. Schuurmans · 1997
Cited alongside, same era.
Strong minimax lower bounds for learning
A. Antos and G. Lugosi · 1998
Cited alongside, same era.
Introduction to Set Theory , volume 220 of Monographs and Textbooks in Pure and Applied Mathematics
K. Hrbacek and T. Jech · 1999
Cited alongside, same era.
Set Theory
T. Jech · 2003
Cited alongside, same era.
Exponential convergence rates in classification
V. Koltchinskii and O. Beznosova · 2005
Cited alongside, same era.
Fast learning rates for plug-in classifiers
J.-Y. Audibert and A. B. Tsybakov · 2007
Cited alongside, same era.
Uniform central limit theorems , volume 142 of Cambridge Studies in Advanced Mathematics
R. M. Dudley · 2014
Later among the works it cites.
Transfinite game values in infinite chess
C. D. A. Evans and Joel David Hamkins · 2014
Later among the works it cites.
Learning whenever learning is possible: Universal learning under general stochastic processes
S. Hanneke · 2017
Later among the works it cites.
Exponential convergence of testing error for stochastic gradient methods
L. Pillaud-Vivien, A. Rudi, and F. Bach · 2018
Later among the works it cites.
Universal Bayes consistency in metric spaces
S. Hanneke, A. Kontorovich, S. Sabato, and R. Weiss · 2019
Later among the works it cites.
Stochastic gradient descent with exponential convergence rates of expected classification errors
A. Nitanda and T. Suzuki · 2019
Later among the works it cites.