Skip to content
Back to the collection

Generalization in Deep Learning

Kenji Kawaguchi, Leslie Pack Kaelbling, Yoshua Bengio

2017 · arXiv

Read the paper
HN score
2
Mentions
5
Readers
4
Months
5
What’s in a score?

From the abstract

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.

Metadata: arXiv. Abstracts retain their original authors’ rights.

In the conversation

Original HN comments, with labels from simple text rules. A label describes the whole comment and may miss context or irony. Read the discussion to make up your own mind. About the labels

5 selected excerpts · 5 total mentions

rademacher
Recommendation · rule
I haven't read this paper yet so I can't speak to it's quality but it appears to be addressing the same questions in this post. Bengio is a coauthor so maybe that's a good sign . Here's the abstract. 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. https://arxiv.org/abs/1710.05468
aoeusnth1
Recommendation · rule
https://arxiv.org/abs/1710.05468 was an interesting paper that came out recently. It showed that large CNN models which have far greater capacity than the data they are shown (and could have memorized it) still tend to learn very good generalizable minima. See proposition 1: (i) For any model class F whose model complexity is large enough to memorize any dataset and which includes f∗ possibly at an arbitrarily sharp minimum, there exists (A, Sm) such that the generalization gap is at most epsilon, and (ii) For any dataset Sm, there exist arbitrarily unstable and arbitrarily non-robust algorithms A such that the generalization gap of f_A(Sm) is at most epsilon.
gradys
Neutral mention · rule
The AI most certainly does not lack the ability to generalize. Not as well as humans, but generalization is the key interesting result in deep learning, leading to papers like this one: https://arxiv.org/abs/1710.05468 The ability to generalize actually seems to keep increasing with the number of parameters, which is the key interesting result in the GPT-* line of work that Copilot is based on.
nl
Neutral mention · rule
We know no more about the theory of LSTM networks than we do about ordinary NNs. Perhaps, but we do know a lot more about how (deep) NNs work than we did 40 years ago. Take for example: Generalization in Deep Learning[1] which gives a theoretical grounding of generalization. McCulloch and Pitts original 1943 paper explicitly mentions hooking a recurrent NN to external memory (they talk about a Turing machine tape). Yes, and DaVinci invented the helicopter, he just failed to get it working. [1] https://arxiv.org/pdf/1710.05468.pdf
nl
Neutral mention · rule
"boys" Not sure what this was supposed to mean? Yes, I think Fei Fei Li's datasets are much better tests than MNIST if that is what you were getting at? I don't see any of these people submitting MNIST to NIPS in 2017 None of them submitted things as entirely new and different as this, either. Having said that, I think my point holds. The completely awesome 2017 "Generalization in Deep Learning" paper[1] was co-authored by Bengio and uses MNIST - because everyone can follow it. Yann LeCun was co-author on the 2017 "Adversarially Regularized Autoencoders for Generating Discrete Structures"[1.5], using MNIST Ian Goodfellow Autoencoder NIPS paper[1] used MNIST as one of its…
Read the full comment
4 datasets. Yes, it was 2014, but when introducing a new technique using familiar datasets isn't a bad thing. DeepMind's "Bayes by Backprop" (ICML15) used MNIST[2] Another example: the (June 2017) John Langford (Vowpal Wabbit) et. al paper[3] on using Boosting to learn ResNet blocks used MNIST. So yes, I agree there are much better datasets to compare performance on. But to prove something new works, MNIST is a useful dataset. [0] https://arxiv.org/pdf/1710.05468.pdf [1] http://papers.nips.cc/paper/5423-generative-adversarial-nets [1.5] https://arxiv.org/pdf/1706.04223.pdf [2] https://deepmind.com/research/publications/weight-uncertaint... [3] https://arxiv.org/pdf/1706.04964.pdf

Keep following the thread.

More in Machine learning

More from the same topics.