Fetching the paper…
Reading the bibliography…
In this work, we improve upon the stepwise analysis of noisy iterative learning algorithms initiated by Pensia, Jog, and Loh (2018) and recently extended by Bu, Zou, and Veeravalli (2019).
“Tightening Mutual Information Based Bounds on Generalization Error” To appear
Yuheng Bu, Shaofeng Zou and Venugopal. Veeravalli · 1901
Earlier work this paper cites.
“PAC-Bayesian supervised classification: the thermodynamics of statistical learning”
Olivier Catoni · 1901
Earlier work this paper cites.
“On generalization error bounds of noisy gradient methods for non-convex learning”, 2019
Jian Li, Xuanyuan Luo and Mingda Qiao · 1902
Earlier work this paper cites.
“Strengthened Information-theoretic Bounds on the Generalization Error”, 2019
A. I. and M · 1903
Earlier work this paper cites.
“On variational bounds of mutual information”, 2019
Ben Poole et al · 1905
Earlier work this paper cites.
“On the Shannon capacity of an arbitrary channel”
JHB Kemperman · 1974
Earlier work this paper cites.
“Asymptotic evaluation of certain Markov process expectations for large time, I”
Monroe Donsker and SR Varadhan · 1975
Earlier work this paper cites.
“A computer simulation of charged particles in solution. I. Technique and equilibrium properties”
Donald Ermak · 1975
Earlier work this paper cites.
“Recursive stochastic algorithms for global optimization in Rˆd”
Saul Gelfand and Sanjoy Mitter · 1991
Earlier work this paper cites.
“A PAC analysis of a Bayesian estimator”
John Shawe-Taylor and Robert Williamson · 1997
Earlier work this paper cites.
“Some PAC-Bayesian Theorems”
David. McAllester · 1999
Earlier work this paper cites.
“Foundations of modern probability”
Olav Kallenberg · 2006
Earlier work this paper cites.
“Tighter PAC-Bayes bounds”
Amiran Ambroladze, Emilio Parrado-Hernández and John Shawe-Taylor · 2007
Cited alongside, same era.
“MNIST handwritten digit database”, http://yann.lecun.com/exdb/mnist/, 2010
Yann LeCun, Corinna Cortes and Christopher.. Burges · 2010
Cited alongside, same era.
“Bayesian learning via stochastic gradient Langevin dynamics”
Max Welling and Yee Teh · 2011
Cited alongside, same era.
“PAC-Bayes bounds with data dependent priors”
Emilio Parrado-Hernández, Amiran Ambroladze, John Shawe-Taylor and Shiliang Sun · 2012
Cited alongside, same era.
“Concentration inequalities: A nonasymptotic theory of independence”
Stéphane Boucheron, Gábor Lugosi and Pascal Massart · 2013
Cited alongside, same era.
“Understanding machine learning: From theory to algorithms”
Shai Shalev-Shwartz and Shai Ben-David · 2014
Cited alongside, same era.
“Information-theoretic analysis of generalization capability of learning algorithms”
Aolin Xu and Maxim Raginsky · 2017
Later among the works it cites.
“Generalization error bounds using Wasserstein distances”
A. and V · 2018
Later among the works it cites.
“Chaining mutual information and tightening generalization bounds”
Amir Asadi, Emmanuel Abbe and Sergio Verdú · 2018
Later among the works it cites.
“Learners that Use Little Information”
Raef Bassily et al · 2018
Later among the works it cites.
“Data-dependent PAC-Bayes priors via differential privacy”
Gintare Dziugaite and Daniel. Roy · 2018
Later among the works it cites.
“Calibrating Noise to Variance in Adaptive Data Analysis”
Vitaly Feldman and Thomas Steinke · 2018
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
“How much does your data exploration overfit? Controlling bias via information usage”, 2015
Daniel Russo and James Zou · 2015
Cited alongside, same era.
“Train faster, generalize better: Stability of stochastic gradient descent”
Moritz Hardt, Ben Recht and Yoram Singer · 2016
Cited alongside, same era.
“Information-theoretic analysis of stability and bias of learning algorithms”
Maxim Raginsky et al · 2016
Cited alongside, same era.
“On-Average KL-Privacy and Its Equivalence to Generalization for Max-Entropy Mechanisms”
Yu-Xiang Wang, Jing Lei and Stephen. Fienberg · 2016
Cited alongside, same era.
“Nonasymptotic convergence analysis for the unadjusted Langevin algorithm”
Alain Durmus and Eric Moulines · 2017
Cited alongside, same era.
“Non-convex learning via Stochastic Gradient Langevin Dynamics: a nonasymptotic analysis”
Maxim Raginsky, Alexander Rakhlin and Matus Telgarsky · 2017
Cited alongside, same era.
Later among the works it cites.
“Dependence measures bounding the exploration bias for general measurements”
Jiantao Jiao, Yanjun Han and Tsachy Weissman · 2018
Later among the works it cites.
“Generalization Bounds of SGLD for Non-convex Learning: Two Theoretical Viewpoints”
Wenlong Mou, Liwei Wang, Xiyu Zhai and Kai Zheng · 2018
Later among the works it cites.
“Generalization error bounds for noisy, iterative algorithms”
Ankit Pensia, Varun Jog and Po-Ling Loh · 2018
Later among the works it cites.
“PAC-Bayes bounds for stable algorithms with instance-dependent priors”
Omar Rivasplata et al · 2018
Later among the works it cites.
“Information matrices and generalization”
Valentin Thomas et al · 2019
Closest in time.