Fetching the paper…
Reading the bibliography…
Algorithm-dependent generalization error bounds are central to statistical learning theory.
Mimicking the one-dimensional marginal distributions of processes having an itô differential
Gyöngy, I. (1986) · 1986
Earlier work this paper cites.
The fokker-planck equation, volume 18 of springer series in synergetics
Risken, H. (1989) · 1989
Earlier work this paper cites.
Pac-bayesian model averaging
McAllester, D. A. (1999) · 1999
Earlier work this paper cites.
On the trend to equilibrium for the fokker-planck equation: an interplay between physics and functional analysis
Markowich, P. A. and C. Villani (2000) · 2000
Earlier work this paper cites.
Stability and generalization
Bousquet, O. and A. Elisseeff (2002) · 2002
Earlier work this paper cites.
Pac-bayesian stochastic model selection
McAllester, D. A. (2003) · 2003
Earlier work this paper cites.
Information theory and statistics: A tutorial
Csiszár, I., P. C. Shields, et al. (2004) · 2004
Earlier work this paper cites.
Stability of randomized learning algorithms
Elisseeff, A., T. Evgeniou, and M. Pontil (2005) · 2005
Earlier work this paper cites.
Stability results in learning theory
Rakhlin, A., S. Mukherjee, and T. Poggio (2005) · 2005
Earlier work this paper cites.
Sparse regression learning by aggregation and langevin monte-carlo
Dalalyan, A. S. and A. B. Tsybakov (2012) · 2012
Cited alongside, same era.
Sampling from a log-concave distribution with projected langevin monte carlo
Bubeck, S., R. Eldan, and J. Lehec (2015) · 2015
Cited alongside, same era.
Escaping from saddle points—online stochastic gradient for tensor decomposition
Ge, R., F. Huang, C. Jin, and Y. Yuan (2015) · 2015
Cited alongside, same era.
Train faster, generalize better: Stability of stochastic gradient descent
Hardt, M., B. Recht, and Y. Singer (2015) · 2015
Cited alongside, same era.
Dynamics of stochastic gradient algorithms
Li, Q., C. Tai, et al. (2015) · 2015
Cited alongside, same era.
Optimal learning for multi-pass stochastic gradient methods
Lin, J. and L. Rosasco (2016) · 2016
Later among the works it cites.
Generalization bounds for randomized learning with application to stochastic gradient descent
London, B. (2016) · 2016
Later among the works it cites.
Understanding deep learning requires rethinking generalization
Zhang, C., S. Bengio, M. Hardt, B. Recht, and O. Vinyals (2016) · 2016
Later among the works it cites.
How to escape saddle points efficiently
Jin, C., R. Ge, P. Netrapalli, S. M. Kakade, and M. I. Jordan (2017) · 2017
Closest in time.
Batch size matters: A diffusion approximation framework on nonconvex stochastic gradient descent
Li, C. J., L. Li, J. Qian, and J.-G. Liu (2017) · 2017
Closest in time.
alphaXiv searches the wider corpus for related work and actual follow-ups.
alphaXiv is searching for related work…
Statistical inference for model parameters in stochastic gradient descent
Chen, X., J. D. Lee, X. T. Tong, and Y. Zhang (2016) · 2016
Cited alongside, same era.
Pac-bayesian theory meets bayesian inference
Germain, P., F. Bach, A. Lacoste, and S. Lacoste-Julien (2016) · 2016
Cited alongside, same era.
Generalization properties and implicit regularization for multiple passes sgm
Lin, J., R. Camoriano, and L. Rosasco (2016) · 2016
Cited alongside, same era.
The true cost of stochastic gradient langevin dynamics
Nagapetyan, T., A. B. Duncan, L. Hasenclever, S. J. Vollmer, L. Szpruch, and K. Zygalakis (2017) · 2017
Closest in time.
Non-convex learning via stochastic gradient langevin dynamics: a nonasymptotic analysis
Raginsky, M., A. Rakhlin, and M. Telgarsky (2017) · 2017
Closest in time.
A hitting time analysis of stochastic gradient langevin dynamics
Zhang, Y., P. Liang, and M. Charikar (2017) · 2017
Closest in time.