Fetching the paper…
Reading the bibliography…
We consider the classical problem of learning rates for classes with finite VC dimension.
On the uniform convergence of relative frequencies of events to their probabilities
Vladimir Vapnik and Alexey Chervonenkis · 1968
Earlier work this paper cites.
On optimum recognition error and reject tradeoff
C Chow · 1970
Earlier work this paper cites.
Theory of Pattern Recognition
Vladimir Vapnik and Alexey Chervonenkis · 1974
Earlier work this paper cites.
Learnability and the Vapnik-Chervonenkis dimension
Anselm Blumer, Andrzej Ehrenfeucht, David Haussler, and Manfred K Warmuth · 1989
Earlier work this paper cites.
Sharper bounds for gaussian and empirical processes
Michel Talagrand · 1994
Earlier work this paper cites.
Sphere packing numbers for subsets of the boolean n-cube with bounded vapnik-chervonenkis dimension
David Haussler · 1995
Earlier work this paper cites.
Topics in Non-parametric Statistics
Arkadi Nemirovski · 2000
Earlier work this paper cites.
Optimal rates of aggregation
Alexandre B Tsybakov · 2003
Earlier work this paper cites.
Convex Optimization
Stephen Boyd and Lieven Vandenberghe · 2004
Earlier work this paper cites.
Generalization bounds for averaged classifiers
Yoav Freund, Yishay Mansour, and Robert E Schapire · 2004
Earlier work this paper cites.
Complexity regularization via localized random penalties
Gábor Lugosi and Marten Wegkamp · 2004
Earlier work this paper cites.
Optimal aggregation of classifiers in statistical learning
Alexander B Tsybakov · 2004
Earlier work this paper cites.
Statistical behavior and consistency of classification methods based on convex risk minimization
Tong Zhang · 2004
Earlier work this paper cites.
Theory of classification: A survey of some recent advances
Stéphane Boucheron, Olivier Bousquet, and Gábor Lugosi · 2005
Earlier work this paper cites.
Convexity, classification, and risk bounds
Peter L Bartlett, Michael I Jordan, and Jon D McAuliffe · 2006
Earlier work this paper cites.
Empirical minimization
Peter L Bartlett and Shahar Mendelson · 2006
Earlier work this paper cites.
Classification with reject option
Radu Herbei and Marten H Wegkamp · 2006
Earlier work this paper cites.
Active learning in the non-realizable case
Matti Kääriäinen · 2006
Cited alongside, same era.
Local rademacher complexities and oracle inequalities in risk minimization
Vladimir Koltchinskii · 2006
Cited alongside, same era.
Risk bounds for statistical learning
Pascal Massart and Élodie Nédélec · 2006
Cited alongside, same era.
Progressive mixture rules are deviation suboptimal
Jean-Yves Audibert · 2008
Cited alongside, same era.
Classification with a reject option using a hinge loss
Peter L Bartlett and Marten H Wegkamp · 2008
Cited alongside, same era.
A general agnostic active learning algorithm
Sanjoy Dasgupta, Daniel J Hsu, and Claire Monteleoni · 2008
Cited alongside, same era.
A Probabilistic Theory of Pattern Recognition
Luc Devroye, László Györfi, and Gábor Lugosi · 2013
Later among the works it cites.
Learning and Generalisation: with Applications to Neural Networks
Mathukumalli Vidyasagar · 2013
Later among the works it cites.
The sample complexity of agnostic learning under deterministic labels
Shai Ben-David and Ruth Urner · 2014
Later among the works it cites.
Optimal learning with q-aggregation
Guillaume Lecué and Philippe Rigollet · 2014
Later among the works it cites.
Upper and lower bounds for stochastic processes: modern methods and classical problems
Michel Talagrand · 2014
Later among the works it cites.
Learning with square loss: Localization through offset rademacher complexity
Tengyuan Liang, Alexander Rakhlin, and Karthik Sridharan · 2015
Later among the works it cites.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Anatoli Juditsky, Philippe Rigollet, and Alexandre B Tsybakov · 2008
Cited alongside, same era.
Neural Network Learning: Theoretical Foundations
Martin Anthony and Peter L Bartlett · 2009
Cited alongside, same era.
Fast learning rates in statistical inference through aggregation
Jean-Yves Audibert · 2009
Cited alongside, same era.
Using the doubling dimension to analyze the generalization of learning algorithms
Nader H Bshouty, Yi Li, and Philip M Long · 2009
Cited alongside, same era.
Aggregation via empirical risk minimization
Guillaume Lecué and Shahar Mendelson · 2009
Cited alongside, same era.
On the foundations of noise-free selective classification
Ran El-Yaniv and Yair Wiener · 2010
Cited alongside, same era.
Agnostic pointwise-competitive selective classification
Yair Wiener and Ran El-Yaniv · 2015
Later among the works it cites.
Refined error bounds for several learning algorithms
Steve Hanneke · 2016
Later among the works it cites.
On aggregation for heavy-tailed classes
Shahar Mendelson · 2017
Later among the works it cites.
Optimal learning via local entropies and sample compression
Nikita Zhivotovskiy · 2017
Later among the works it cites.
Localization of vc classes: Beyond local Rademacher complexities
Nikita Zhivotovskiy and Steve Hanneke · 2018
Later among the works it cites.
The relationship between agnostic selective classification, active learning and the disagreement coefficient
Roei Gelbhart and Ran El-Yaniv · 2019
Closest in time.
An unrestricted learning procedure
Shahar Mendelson · 2019
Closest in time.
Proper learning, Helly number, and an optimal SVM bound
Olivier Bousquet, Steve Hanneke, Shay Moran, and Nikita Zhivotovskiy · 2020
Closest in time.
When are epsilon-nets small?
Andrey Kupavskii and Nikita Zhivotovskiy · 2020
Closest in time.
Fast rates for online prediction with abstention
Gergely Neu and Nikita Zhivotovskiy · 2020
Closest in time.