Jensen-Shannon Information Based Characterization of the Generalization Error of Learning Algorithms

J. Lin, “Divergence measures based on the shannon entropy,” IEEE Transactions on Information theory

1991

Earlier work this paper cites.

V. N. Vapnik, “An overview of statistical learning theory,” IEEE transactions on neural networks

1999

Earlier work this paper cites.

O. Bousquet and A. Elisseeff, “Stability and generalization,” Journal of machine learning research

2002

Earlier work this paper cites.

D. A. McAllester, “Pac-bayesian stochastic model selection,” Machine Learning

2003

Earlier work this paper cites.

P. Melville, S. M. Yang, M. Saar-Tsechansky, and R. Mooney, “Active learning for probability estimation using jensen-shannon divergence,” in European conference on machine learning

2005

Earlier work this paper cites.

D. P. Palomar and S. Verdú, “Lautum information,” IEEE transactions on information theory

2008

Earlier work this paper cites.

John Wiley & Sons, 2011

Original

P. Dupuis and R. S. Ellis, A weak convergence approach to the theory of large deviations · 2010

Earlier work this paper cites.

H. Xu and S. Mannor, “Robustness and generalization,” Machine learning

2012

Earlier work this paper cites.

Cambridge university press, 2014

S. Shalev-Shwartz and S. Ben-David, Understanding machine learning: From theory to algorithms · 2014

Cited alongside, same era.

I. Goodfellow, J. Pouget-Abadie, M. Mirza, B. Xu, D. Warde-Farley, S. Ozair, A. Courville, and Y. Bengio, “Generative adversarial nets,” in Advances in neural information processing systems

2014

Cited alongside, same era.

I. Sason and S. Verdú, “ f f -divergence inequalities,” IEEE Transactions on Information Theory

2016

Cited alongside, same era.

MIT press Massachusetts, USA:, 2017

Y. Bengio, I. Goodfellow, and A. Courville, Deep learning · 2017

Cited alongside, same era.

A. Xu and M. Raginsky, “Information-theoretic analysis of generalization capability of learning algorithms,” in Advances in Neural Information Processing Systems

2017

Cited alongside, same era.

A. T. Lopez and V. Jog, “Generalization error bounds using wasserstein distances,” in 2018 IEEE Information Theory Workshop (ITW)

2018

Later among the works it cites.

D. Russo and J. Zou, “How much does your data exploration overfit? controlling bias via information usage,” IEEE Transactions on Information Theory

2019

Later among the works it cites.

Y. Bu, S. Zou, and V. V. Veeravalli, “Tightening mutual information based bounds on generalization error,” arXiv preprint arXiv:1901.04609

Original

2019

Later among the works it cites.

A. R. Esposito, M. Gastpar, and I. Issa, “Generalization error bounds via r \ \backslash ’enyi-, f f -divergences and maximal leakage,” arXiv preprint arXiv:1912.01439

Original

2019

Later among the works it cites.

H. Wang, M. Diaz, J. C. S. Santos Filho, and F. P. Calmon, “An information-theoretic view of generalization via wasserstein distance,” in 2019 IEEE International Symposium on Information Theory (ISIT)