Maxim Raginsky

Information-theoretic analysis of generalization capability of learning algorithms

2017 · arXiv (Cornell University)

We derive upper bounds on the generalization error of a learning algorithm in terms of the mutual information between its input and output. The bounds provide an information-theoretic understanding of generalization in learning problems, and …