An Observation on Generalization
Simons Institute for the Theory of Computing0 HN recommenders · 2023–2026
210K views · talk · evergreen · Uploaded 2023-08-14
Ilya Sutskever gives a Simons Institute talk on why neural networks generalize, framing learning as finding short descriptions, like compression. It was part of the Large Language Models and Transformers program.
Cited in discussions of learning as compression and of why neural networks generalize.
2:25:52The spelled-out intro to neural networks and backpropagation: building micrograd
Andrej Karpathy
19:42But what is the Fourier Transform? A visual introduction.
3Blue1Brown
18:40But what is a neural network? | Deep learning chapter 1
3Blue1Brown
23:53D/A and A/D | Digital Show and Tell (Monty Montgomery @ xiph.org)
FL Studio
1:30:28AlphaGo - The Movie | Full award-winning documentary
Google DeepMind
27:14Transformers, the tech behind LLMs | Deep Learning Chapter 5
3Blue1Brown
51:22USENIX Security '18-Q: Why Do Keynote Speakers Keep Suggesting That Improving Security Is Possible?
USENIX
1:08:40Lecture 1 | Machine Learning (Stanford)
Stanford
3 comments from Hacker News
I am curious why isn't the network always in an "interference" state, but sometimes it collapses into a "restricted" ONB? > the neural networks we observe in practice are in some sense noisily simulating larger, highly sparse networks This seems somewhat related to a point made by Ilya Sutskever here [1]: NNs can be though of an approximation to the Kolmogorov compressor. Speculating, one could say any network is a projection of the ideal compressor (which argualy perfectly represents all n-features in an n-dimensional ONB) into a lower dimentional space, hence the interference. But why is there not always such an interference? [1] [VIDEO]
> We are now getting an equivalent definition of what neural nets are being trained for! LLMs are trained to compress the internet as much as possible! Nice payoff. Others have also called out the relationship to compression ( [VIDEO] ).
Noting the theory papers on Kolmorogov complexity. For those not familiar, Ilya argues that the reason why neural networks generalize -- why they work at all -- is because they are effectively finding a simple description of their training data , converging down onto the limit of the Kolmorogov complexity. [1] [1] [VIDEO]