Generalization at the Edge of Stability

Generalization at the Edge of Stability

🎙 Tolga Birdal 👥 3K 📅 June 11, 2026 ⏱ 61 min 👁 201 📄 original study 🧭 2026-08-16
Available in: English (current) Français

Keywords

generalizationedge of stabilityfractal dimensionpersistent homologystochastic gradient descent

Summary

Tolga Birdal presents a theoretical framework linking the generalization of neural networks to the fractal dimension of their training trajectories, particularly in the edge of stability regime. He introduces the concept of ‘sharpness dimension’ and proves a generalization bound based on it, showing that generalization depends on the full Hessian spectrum. The talk covers background on fractal dimensions, persistent homology, and the limitations of prior assumptions about SGD noise. Experiments on MLPs and transformers validate the theory and provide insights into grokking. The approach replaces traditional complexity measures with topological ones, offering a new perspective on why overparameterized networks generalize well.

101 words

Critical Evaluation

Value of the Information & Strength of the Argument

The talk provides a novel theoretical contribution by connecting generalization to fractal dimensions and persistent homology, moving beyond empirical observations. The argumentation is rigorous, building from established concepts and clearly motivating each step. The speaker acknowledges limitations and contrasts with prior work, strengthening the credibility. The empirical validation adds practical relevance.

Scientific Rigor, Source Quality, Title Accuracy

The talk references prior work (e.g., by Mandelbrot, and others on heavy-tailed noise) but does not provide explicit citations or URLs. The title accurately reflects the content. The presentation is scientifically rigorous, with clear definitions and proofs outlined, though some details are omitted for brevity.

111 words

Title / Content Match

The title accurately reflects the content, focusing on generalization in the edge of stability regime.

Quality & Reliability

8/10

The talk presents original research with theoretical proofs and empirical validation, but lacks detailed methodological exposition and peer-reviewed publication details.

Key Moments

Cited Sources

  • Mandelbrot's book on fractals — Referenced for the concept of fractal dimension and the Cantor set example.
  • Prior work on heavy-tailed noise in SGD — Mentioned as motivation for avoiding assumptions about Gaussian noise.

Concurring Sources

Dissenting Sources

  • Prior work on generalization bounds using spectral norm — The talk argues that such bounds are insufficient as they ignore the full Hessian spectrum.

Contribution & Novelties

The talk introduces a novel theoretical framework linking generalization to the fractal dimension of training trajectories, specifically the ‘sharpness dimension’ based on Lyapunov dimension theory. This provides a more nuanced understanding than previous bounds based on trace or spectral norm. The use of persistent homology offers a computationally feasible way to estimate this dimension. The work also sheds light on the grokking phenomenon.

Pour aller plus loin :

103 words

Radar Profile

The radar profile shows high scores in technical level and information quality, reflecting the advanced theoretical content. The lower score in quantity of information is due to the concise presentation, but the overall profile indicates a rigorous and valuable contribution.

Reliability 8/10