An Observation on Generalization and Unsupervised Compression
Connects Kolmogorov complexity and Solomonoff induction to next-token prediction, arguing that optimal sequence compression forces models to recover shared world structure.
Faculty & visiting speakers
Self-contained seminars, public lectures, and invited talks.
Connects Kolmogorov complexity and Solomonoff induction to next-token prediction, arguing that optimal sequence compression forces models to recover shared world structure.
Formalizes mathematical privacy guarantees under arbitrary auxiliary information, composition theorems, Laplace/Gaussian noise calibration, and adaptive data analysis.



Automata, cryptographic hardness, interactive proofs, and privacy guarantees
MIT · Ruhr University Bochum · Harvard University +1