Fetching the paper…
Reading the bibliography…
We present a novel notion of complexity that interpolates between and generalizes some classic existing complexity notions in learning theory: for estimators like empirical risk minimization (ERM) with arbitrary bounded losses, it is upper bounded in terms of data-independent Rademacher complexity; for generalized Bayesian estimators, it is upper bounded by the data-dependent information complexity (also known as stochastic or PAC-Bayesian, $\mathrm{KL}(\text{posterior} \operatorname{\|} \text{prior})$ complexity.
Exponential inequalities for sums of random vectors
V.V Yurinskiĭ · 1976
Earlier work this paper cites.
Universal sequential coding of single messages
Yu. M. Shtarkov · 1987
Earlier work this paper cites.
Stochastic Complexity in Statistical Inquiry
Jorma Rissanen · 1989
Earlier work this paper cites.
Minimum complexity density estimation
Andrew R. Barron and Thomas M. Cover · 1991
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.
Fisher information and stochastic complexity
Jorma Rissanen · 1996
Earlier work this paper cites.
The minimum description length principle in coding and modeling
A. Barron, J. Rissanen, and B. Yu · 1998
Earlier work this paper cites.
Statistical Learning Theory
Vladimir N. Vapnik · 1998
Earlier work this paper cites.
A decision-theoretic extension of stochastic complexity and its applications to learning
Kenji Yamanishi · 1998
Earlier work this paper cites.
Viewing all models as “probabilistic”
Peter D. Grünwald · 1999
Earlier work this paper cites.
Rademacher processes and bounding the risk of function learning
Vladimir Koltchinskii and Dmitry Panchenko · 1999
Earlier work this paper cites.
Worst case prediction over sequences under log loss
Manfred Opper and David Haussler · 1999
Earlier work this paper cites.
Empirical Processes in M-Estimation (Cambridge Series in Statistical and Probabilistic Mathematics)
Sara van de Geer · 2000
Earlier work this paper cites.
Worst-case bounds for the logarithmic loss of predictors
Nicolò Cesa-Bianchi and Gábor Lugosi · 2001
Earlier work this paper cites.
The Elements of Statistical Learning: Data Mining, Inference and Prediction
Trevor Hastie, Robert Tibshirani, and Jerome Friedman · 2001
Earlier work this paper cites.
A Bennett concentration inequality and its application to suprema of empirical processes
Olivier Bousquet · 2002
Cited alongside, same era.
Learning and Generalization with Applications to Neural Networks
Mathukumalli Vidyasagar · 2002
Cited alongside, same era.
PAC-Bayesian statistical learning theory
Jean-Yves Audibert · 2004
Cited alongside, same era.
Optimal aggregation of classifiers in statistical learning
Alexander B Tsybakov · 2004
Cited alongside, same era.
Local Rademacher complexities
Peter L. Bartlett, Olivier Bousquet, and Shahar Mendelson · 2005
Cited alongside, same era.
Worst-case bounds for Gaussian process models
Sham M. Kakade, Matthias W. Seeger, and Dean P. Foster · 2006
Cited alongside, same era.
Human Rademacher complexity
Xiaojin Zhu, Bryan R Gibson, and Timothy T Rogers · 2009
Later among the works it cites.
Oracle Inequalities in Empirical Risk Minimization and Sparse Recovery Problems: École D’Été de Probabilités de Saint-Flour XXXVIII-2008 , volume 2033
Vladimir Koltchinskii · 2011
Later among the works it cites.
The safe Bayesian
Peter Grünwald · 2012
Later among the works it cites.
Horizon-independent optimal prediction with log-loss in exponential families
Peter Bartlett, Peter Grünwald, Peter Harremoës, Fares Hedayati, and Wojciech Kotlowski · 2013
Later among the works it cites.
Concentration inequalities: A nonasymptotic theory of independence
Stéphane Boucheron, Gábor Lugosi, and Pascal Massart · 2013
Later among the works it cites.
Information theoretic validity of penalized likelihood
Sabyasachi Chatterjee and Andrew Barron · 2014
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
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.
Combining PAC-Bayesian and generic chaining bounds
Jean-Yves Audibert and Olivier Bousquet · 2007
Cited alongside, same era.
PAC-Bayesian Supervised Classification
Olivier Catoni · 2007
Cited alongside, same era.
Strictly proper scoring rules, prediction, and estimation
Tilmann Gneiting and Adrian E Raftery · 2007
Cited alongside, same era.
The Minimum Description Length Principle
Peter D. Grünwald · 2007
Cited alongside, same era.
Later among the works it cites.
Upper and lower bounds for stochastic processes: Modern methods and classical problems , volume 60
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.
Sequential probability assignment with binary alphabets and large classes of experts
Alexander Rakhlin and Karthik Sridharan · 2015
Later among the works it cites.
Fast rates in statistical and online learning
Tim van Erven, Peter D. Grünwald, Nishant A. Mehta, Mark D. Reid, and Robert C. Williamson · 2015
Later among the works it cites.
Fast rates with unbounded losses
Peter D. Grünwald and Nishant A. Mehta · 2016
Later among the works it cites.
Informal remark, 2016
Teemu Roos · 2016
Later among the works it cites.
Localization of VC classes: Beyond local Rademacher complexities
Nikita Zhivotovskiy and Steve Hanneke · 2016
Later among the works it cites.
Fast rates with high probability in exp-concave statistical learning
Nishant A. Mehta · 2017
Closest in time.
Empirical entropy, minimax regret and minimax risk
Alexander Rakhlin, Karthik Sridharan, and Alexandre B Tsybakov · 2017
Closest in time.