Fat-Shattering Dimension of $k$-fold Aggregations

The sizes of compact subsets of hilbert space and continuity of gaussian processes

Richard M Dudley · 1967

Earlier work this paper cites.

What size net gives valid generalization?

Eric B. Baum and David Haussler · 1989

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.

Efficient distribution-free learning of probabilistic concepts

Michael J. Kearns and Robert E. Schapire · 1994

Earlier work this paper cites.

Bagging predictors

Leo Breiman · 1996

Earlier work this paper cites.

Scale-sensitive dimensions, uniform convergence, and learnability

Noga Alon, Shai Ben-David, Nicolò Cesa-Bianchi, and David Haussler · 1997

Earlier work this paper cites.

A decision-theoretic generalization of on-line learning and an application to boosting

Yoav Freund and Robert E Schapire · 1997

Earlier work this paper cites.

Prediction, learning, uniform convergence, and scale-sensitive dimensions

Peter L. Bartlett and Philip M. Long · 1998

Earlier work this paper cites.

Generalization performance of support vector machines and other pattern classifiers , pages 43–54

Peter Bartlett and John Shawe-Taylor · 1999

Earlier work this paper cites.

Random forests

Leo Breiman · 2001

Earlier work this paper cites.

Covering number bounds of certain regularized linear function classes

Tong Zhang · 2002

Earlier work this paper cites.

Robust regression by boosting the median

Balázs Kégl · 2003

Earlier work this paper cites.

Entropy and the combinatorial dimension

S. Mendelson and R. Vershynin · 2003

Earlier work this paper cites.

Vapnik–chervonenkis type conditions and uniform donsker classes of functions

Michel Talagrand · 2003

Earlier work this paper cites.

Duality of metric entropy

S. Artstein, V. Milman, and S. J. Szarek · 2004

Cited alongside, same era.

Combinatorics of random processes and sections of convex bodies

M. Rudelson and R. Vershynin · 2006

Cited alongside, same era.

The VC dimension of k-fold union

David Eisenstat and Dana Angluin · 2007

Cited alongside, same era.

On the performance of clustering in hilbert spaces

Gérard Biau, Luc Devroye, and Gábor Lugosi · 2008

Cited alongside, same era.

k-fold unions of low-dimensional concept classes

David Eisenstat · 2009

Cited alongside, same era.

Smoothness, low noise and fast rates

Nathan Srebro, Karthik Sridharan, and Ambuj Tewari · 2010

Cited alongside, same era.

Improved generalization bounds for robust learning

Idan Attias, Aryeh Kontorovich, and Yishay Mansour · 2019

Later among the works it cites.

Tight lower bounds on the vc-dimension of geometric set systems

Mónika Csikós, Nabil H. Mustafa, and Andrey Kupavskii · 2019

Later among the works it cites.

ℓ ∞ \ell_{\infty} vector contraction for rademacher complexity

Original

Dylan J. Foster and Alexander Rakhlin · 2019

Later among the works it cites.

Optimality of SVM: novel proofs and tighter bounds

Steve Hanneke and Aryeh Kontorovich · 2019

Later among the works it cites.

Closure properties for private classification and online prediction

Noga Alon, Amos Beimel, Shay Moran, and Uri Stemmer · 2020

Later among the works it cites.

New bounds for k k -means and information k k -means