In plain words: Deep networks can work well on new data even though they are huge and can land on sharp, fragile-looking solutions. It explains why, and shows how to write guarantees that say something real instead of the usual bounds that are too loose to matter.
Abstract · Generalization in Deep Learning
This paper provides theoretical insights into why and how deep learning can generalize well, despite its large capacity, complexity, possible algorithmic instability, nonrobustness, and sharp minima, responding to an open question in the literature. We also discuss approaches to provide non-vacuous generalization guarantees for deep learning. Based on theoretical observations, we propose new open problems and discuss the limitations of our results.
Kenji Kawaguchi, Leslie Pack Kaelbling, Yoshua Bengio
arXiv:1710.05468 · stat.ML, cs.AI, cs.LG, cs.NE · submitted Oct 16, 2017 · updated Aug 22, 2023
abstract · pdf · html · Published by Cambridge University Press. BibTeX of this paper is available at: https://people.csail.mit.edu/kawaguch/bibtex.html