HackerTube.dev

An Observation on Generalization

Simons Institute for the Theory of Computing · 210.1K views · 2023-08-14 · 57:21

Open on YouTube ↗

If playback is restricted in your region, try opening the original video. Use Mark watched to add it to your marked videos.

Overview

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.

On Hacker News

Cited in discussions of learning as compression and of why neural networks generalize.

Discussed on HN; no positive recommendation is recorded in this export · HN mentions 2023–2026

Topics

Search by tags

What people said

jawarner · 2026-07 · Reference

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]

Read the original HN comment ↗
JoshCole · 2025-09 · Reference

> 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] ).

Read the original HN comment ↗
DigitalNoumena · 2023-08 · Reference

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]

Read the original HN comment ↗

Sources

Video by Simons Institute for the Theory of Computing, played through YouTube.

Data and selection notes

HN summaries and labels may contain AI errors. HN dates refer to discussions, not video publication.

HN Library: HackerTube export (2026-10-31) and open-index/hacker-news. Upstream summaries and classifications may contain AI errors.

Views, duration and playback status refresh separately from the published catalog. When an update fails, existing data remains visible.

Selection checks
  • SaaS & AI candidates: Matches the configured criteria
  • Editor-approved picks: Editorial review is required

Rule matches identify candidates. They do not guarantee video quality or financial results.

About the library and its sources