Fetching the paper…
Reading the bibliography…
Acquisition of data is a difficult task in many applications of machine learning, and it is only natural that one hopes and expects the population risk to decrease (better performance) monotonically with increasing data points.
Iterated logarithm inequalities
DA Darling and Herbert Robbins · 1967
Earlier work this paper cites.
On tail probabilities for martingales
David A Freedman · 1975
Earlier work this paper cites.
Small sample size generalization
Robert P.W. Duin · 1995
Earlier work this paper cites.
Statistical mechanics of generalization
Manfred Opper and Wolfgang Kinzel · 1996
Earlier work this paper cites.
Classifiers in almost empty spaces
Robert P.W. Duin · 2000
Earlier work this paper cites.
Advances in large margin classifiers
Alexander J. Smola, Peter J. Bartlett, Dale Schuurmans, and Bernhard Schölkopf · 2000
Earlier work this paper cites.
Learning to generalize
Robert P.W. Duin · 2001
Earlier work this paper cites.
PAC-Bayesian statistical learning theory
Jean-Yves Audibert · 2004
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.
Prediction, learning, and games
Nicolo Cesa-Bianchi and Gábor Lugosi · 2006
Earlier work this paper cites.
Self-Normalized Processes: Limit Theory and Statistical Applications
V.H. Peña, T.L. Lai, and Q.M. Shao · 2008
Earlier work this paper cites.
On the peaking phenomenon of the lasso in model selection
Nicole Krämer · 2009
Earlier work this paper cites.
Empirical bernstein bounds and sample variance penalization
Andreas Maurer and Massimiliano Pontil · 2009
Earlier work this paper cites.
Empirical bernstein bounds and sample-variance penalization
Andreas Maurer and Massimiliano Pontil · 2009
Earlier work this paper cites.
Universal learning vs. no free lunch results
Shai Ben-David, Nathan Srebro, and Ruth Urner · 2011
Earlier work this paper cites.
Bounds on individual risk for log-loss predictors
Peter D Grünwald and Wojciech Kotłowski · 2011
Earlier work this paper cites.
Entropic value-at-risk: A new coherent risk measure
Amir Ahmadi-Javid · 2012
Earlier work this paper cites.
Minimizing the misclassification error rate using a surrogate convex loss
Shai Ben-David, David Loker, Nathan Srebro, and Karthik Sridharan · 2012
Earlier work this paper cites.
The dipping phenomenon
Marco Loog and Robert P.W. Duin · 2012
Cited alongside, same era.
Pac-bayes-empirical-bernstein inequality
Ilya O. Tolstikhin and Yevgeny Seldin · 2013
Cited alongside, same era.
Understanding machine learning: From theory to algorithms
Shai Shalev-Shwartz and Shai Ben-David · 2014
Cited alongside, same era.
Fast rates in statistical and online learning
Tim Van Erven, Nishant A. Mehta, Mark D. Reid, and Robert C. Williamson · 2015
Cited alongside, same era.
Contrastive pessimistic likelihood estimation for semi-supervised classification
Marco Loog · 2015
Cited alongside, same era.
Combining adversarial guarantees and stochastic fast rates in online learning
Wouter M. Koolen, Peter D. Grünwald, and Tim Van Erven · 2016
Cited alongside, same era.
More data can hurt for linear regression: Sample-wise double descent
Preetum Nakkiran · 2019
Later among the works it cites.
Open problem: Monotonicity of learning
Tom Viering, Alexander Mey, and Marco Loog · 2019
Later among the works it cites.
Making learners (more) monotone, 2019
Tom J. Viering, Alexander Mey, and Marco Loog · 2019
Later among the works it cites.
Non-vacuous generalization bounds at the imagenet scale: a pac-bayesian compression approach
Wenda Zhou, Victor Veitch, Morgane Austern, Ryan P. Adams, and Peter Orbanz · 2019
Later among the works it cites.
Non-exponentially weighted aggregation: regret bounds for unbounded loss functions
Pierre Alquier · 2020
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
On equivalence of martingale tail bounds and deterministic regret inequalities
Alexander Rakhlin and Karthik Sridharan · 2017
Cited alongside, same era.
Reconciling modern machine learning and the bias-variance trade-off
Mikhail Belkin, Daniel Hsu, Siyuan Ma, and Soumik Mandal · 2018
Cited alongside, same era.
Online learning: Sufficient statistics and the Burkholder method
Dylan J. Foster, Alexander Rakhlin, and Karthik Sridharan · 2018
Cited alongside, same era.
A jamming transition from under-to over-parametrization affects loss landscape and generalization
Stefano Spigler, Mario Geiger, Stéphane d’Ascoli, Levent Sagun, Giulio Biroli, and Matthieu Wyart · 2018
Cited alongside, same era.
Two models of double descent for weak features
Mikhail Belkin, Daniel Hsu, and Ji Xu · 2019
Cited alongside, same era.
A model of double descent for high-dimensional binary linear classification
Zeyu Deng, Abla Kammoun, and Christos Thrampoulidis · 2019
Cited alongside, same era.
Prasad Cheema and Mahito Sugiyama · 2020
Closest in time.
Multiple descent: Design your own generalization curve
Lin Chen, Yifei Min, Mikhail Belkin, and Amin Karbasi · 2020
Closest in time.
Triple descent and the two kinds of overfitting: Where & why do they appear?
Stéphane d’Ascoli, Levent Sagun, and Giulio Biroli · 2020
Closest in time.
Exact expressions for double descent and implicit regularization via surrogate random design
Michal Derezinski, Feynman T Liang, and Michael W Mahoney · 2020
Closest in time.
Time-uniform chernoff bounds via nonnegative supermartingales
Steven R Howard, Aaditya Ramdas, Jon McAuliffe, Jasjeet Sekhon, et al · 2020
Closest in time.
A brief prehistory of double descent
Marco Loog, Tom Viering, Alexander Mey, Jesse H. Krijthe, and David M. J. Tax · 2020
Closest in time.
Lipschitz and comparator-norm adaptivity in online learning
Zakaria Mhammedi and Wouter M. Koolen · 2020
Closest in time.
Deep double descent: Where bigger models and more data hurt
Preetum Nakkiran, Gal Kaplun, Yamini Bansal, Tristan Yang, Boaz Barak, and Ilya Sutskever · 2020
Closest in time.
Optimal regularization can mitigate double descent
Preetum Nakkiran, Prayaag Venkat, Sham Kakade, and Tengyu Ma · 2020
Closest in time.
Pac-bayes analysis beyond the usual bounds
Omar Rivasplata, Ilja Kuzborskij, Csaba Szepesvári, and John Shawe-Taylor · 2020
Closest in time.
Time-uniform, nonparametric, nonasymptotic confidence sequences
Steven R Howard, Aaditya Ramdas, Jon McAuliffe, and Jasjeet Sekhon · 2021
Closest in time.
A general framework for the disintegration of pac-bayesian bounds, 2021
Paul Viallard, Pascal Germain, Amaury Habrard, and Emilie Morvant · 2021
Closest in time.
The shape of learning curves: a review
Tom Viering and Marco Loog · 2021
Closest in time.