Fetching the paper…
Reading the bibliography…
The aim of this paper is to provide several novel upper bounds on the excess risk with a primal focus on classification problems.
V. Vapnik, A. Chervonenkis . On the uniform convergence of relative frequencies of events to their probabilities. Proc. USSR Acad. Sci. 181(4), 781–783, 1968
1968
Earlier work this paper cites.
V. Vapnik, A. Chervonenkis . Theory of Pattern Recognition. Nauka, Moscow, 1974
1974
Earlier work this paper cites.
A. Ehrenfeucht, D. Haussler, M. Kearns, L. Valiant . A general lower bound on the number of examples needed for learning. Information and Computation , 82(3):247–261, 1989
1989
Earlier work this paper cites.
N. Littlestone. From On-line to batch learning. In COLT, 1989
1989
Earlier work this paper cites.
D. Haussler, N. Littlestone, M. Warmuth . Predicting { 0 , 1 } \{0,1\} -functions on randomly drawn points. Information and Computation, 115:248–292, 1994
1994
Earlier work this paper cites.
S. Floyd and M. Warmuth . Sample Compression, learnability, and the Vapnik Chervonenkis Dimension, Machine Learning, 21, 269–304 (1995)
1995
Earlier work this paper cites.
P. M. Long. On the sample complexity of PAC learning halfspaces against the uniform distribution. IEEE Transactions on Neural Networks, 6(6):1556–1559, 1995
1995
Earlier work this paper cites.
L. Devroye, L. Györfi, G. Lugosi . A Probabilistic Theory of Pattern Recognition, volume 31 of Applications of Mathematics. Springer–Verlag, New York, 1996
1996
Earlier work this paper cites.
A. W. van der Vaart, J. A. Wellner . Weak Convergence and Empirical Processes. Springer, 1996
1996
Earlier work this paper cites.
M. Anthony, P. L. Bartlett . Neural Network Learning: Theoretical Foundations. Cambridge University Press, 1999
1999
Earlier work this paper cites.
Y. Yang, A. Barron. Information-theoretic determination of minimax rates of convergence. Annals of Statistics, 27, 1564–1599, 1999
1999
Earlier work this paper cites.
O. Bousquet, A. Elisseeff . Stability and generalization. Journal of Machine Learning Research, 2002
2002
Earlier work this paper cites.
M. Wegkamp . Model selection in nonparametric regression. Annals of Statistics, Vol. 31, No. 1, 252–273, 2003
2003
Earlier work this paper cites.
A. B. Tsybakov . Optimal aggregation of classifiers in statistical learning. The Annals of Statistics. Vol. 32, No. 1, 135–166, 2004
2004
Earlier work this paper cites.
M. K. Warmuth. The optimal PAC algorithm. In Proceedings of the 17th Conference on Learning Theory, 2004
2004
Cited alongside, same era.
P. L. Bartlett, O. Bousquet, S. Mendelson . Local Rademacher Complexities. The Annals of Statistics, 33(4):1497–1537, 08, 2005
2005
Cited alongside, same era.
S. Boucheron, O. Bousquet, G. Lugosi . Theory of classification: a survey of recent advances. ESAIM: Probability and Statistics, 9:323–375, 2005
2005
Cited alongside, same era.
P. L. Bartlett, S. Mendelson . Empirical minimization. Probability Theory and Related Fields, 135(3):311–334, 2006
2006
Cited alongside, same era.
E. Giné, V. Koltchinskii . Concentration inequalities and asymptotic results for ratio type empirical processes. The Annals of Probability, 34(3):1143–1216, 2006
2006
Cited alongside, same era.
M.F. Balcan, P. M. Long . Active and passive learning of linear separators under log-concave distributions. In Proceedings of the 26th Conference on Learning Theory, 2013
2013
Later among the works it cites.
S. Boucheron, G. Lugosi, P. Massart . Concentration inequalities: A nonasymptotic theory of independence. Cambridge, 2013
2013
Later among the works it cites.
E. Gassiat, R. van Handel. The local geometry of finite mixtures, Trans. Amer. Math. Soc. 366, 1047–1072, 2014
2014
Later among the works it cites.
S. Hanneke, L. Yang . Minimax analysis of active learning. Journal of Machine Learning Research, 16 (12): 3487–3602, 2015
2015
Later among the works it cites.
T. Liang, A. Rakhlin, K. Sridharan . Learning with square loss: Localization through offset Rademacher complexity. Proceedings of The 28th Conference on Learning Theory, 2015
2015
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Annals of Statistics, 2006
P. Massart, E. Nédélec . Risk bounds for statistical learning · 2006
Cited alongside, same era.
P. Auer, R. Ortner . A new PAC bound for intersection-closed concept classes. Machine Learning, 66(2-3): 151–163, 2007
2007
Cited alongside, same era.
R. Adamczak. A tail inequality for suprema of unbounded empirical processes with applications to Markov chains. Electron. J. Probab., 1000–1034, 2008
2008
Cited alongside, same era.
S. Mendelson . Obtaining fast error rates in nonconvex situations. Journal of Complexity. Volume 24, Issue 3, 380–397, 2008
2008
Cited alongside, same era.
N. H. Bshouty, Y. Li, P. M. Long . Using the doubling dimension to analyze the generalization of learning algorithms. Journal of Computer and System Sciences, 2009
2009
Cited alongside, same era.
G. Lecué . Interplay between concentration, complexity and geometry in learning theory with applications to high dimensional data analysis. Habilitation thesis, Université Paris-Est, 2011
2011
Cited alongside, same era.
T. M. Adams, A. B. Nobel . Uniform approximation and bracketing properties of VC classes. Bernoulli, 18:1310–1319, 2012
2012
Cited alongside, same era.
Later among the works it cites.
S. Mendelson . Learning without concentration. Journal of the ACM, Volume 62, Issue 3, 2015
2015
Later among the works it cites.
H. Simon . An almost optimal PAC-algorithm. Proceedings of The 28th Conference on Learning Theory, pp. 1552–1563, 2015
2015
Later among the works it cites.
S. Hanneke . Refined error bounds for several learning algorithms. Journal of Machine Learning Research 17, 1–55, 2016
2016
Later among the works it cites.
S. Hanneke . The Optimal Sample Complexity of PAC Learning. Journal of Machine Learning Research, 17 (38): 1-15, 2016
2016
Later among the works it cites.
G. Lecué, S. Mendelson . Learning subgaussian classes: Upper and minimax bounds. ´ Topics in Learning Theory, (S. Boucheron and N. Vayatis Eds.), 2016
2016
Later among the works it cites.
S. Mendelson. ‘Local’ vs. ‘global’ parameters – breaking the Gaussian complexity barrier, Annals of Statisitcs, 2017
2017
Closest in time.
A. Rakhlin, K. Sridharan, A. B. Tsybakov . Empirical entropy, minimax regret and minimax risk. Bernoulli, 2017
2017
Closest in time.
N. Zhivotovskiy, S. Hanneke. Localization of VC classes: Beyond Local Rademacher complexities. Theoretical Computer Science, 2017
2017
Closest in time.