On the Limitations of Fractal Dimension as a Measure of Generalization
Not on the map. Why?
Abstract (arXiv)
Bounding and predicting the generalization gap of overparameterized neural networks remains a central open problem in theoretical machine learning. There is a recent and growing body of literature that proposes the framework of fractals to model optimization trajectories of neural networks, motivating generalization bounds and measures based on the fractal dimension of the trajectory. Notably, the persistent homology dimension has been proposed to correlate with the generalization gap. This paper performs an empirical evaluation of these persistent homology-based generalization measures, with an in-depth statistical analysis. Our study reveals confounding effects in the observed correlation between generalization and topological measures due to the variation of hyperparameters. We also observe that fractal dimension fails to predict generalization of models trained from poor initializations. We lastly reveal the intriguing manifestation of model-wise double descent in these topological generalization measures. Our work forms a basis for a deeper investigation of the causal relationships between fractal geometry, topological data analysis, and neural network optimization.
Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 19 of its 48 references that are in the map. First posted on arXiv 4 Jun 2024.
Builds on
19 of 48 references.
References · 19
- 2018Averaging Weights Leads to Wider Optima and Better Generalizationcited by 1,194
- 2019Deep Double Descent: Where Bigger Models and More Data Hurtcited by 667
- 2018Loss Surfaces, Mode Connectivity, and Fast Ensembling of DNNscited by 585
- 2019Fantastic Generalization Measures and Where to Find Themcited by 507
- 2017Sharp Minima Can Generalize For Deep Netscited by 462
- 2019Ripser: efficient computation of Vietoris-Rips persistence barcodescited by 115
- 2019Asymmetric Valleys: Beyond Sharp and Flat Local Minimacited by 90
- 2021Intrinsic Dimension, Persistent Homology and Generalization in Neural Networkscited by 70
- 2020Hausdorff Dimension, Heavy Tails, and Generalization in Neural Networkscited by 62
- 2020giotto-tda: A Topological Data Analysis Toolkit for Machine Learning and Data Explorationcited by 55
- 2019Bad Global Minima Exist and SGD Can Reach Themcited by 49
- 2019On the Heavy-Tailed Theory of Stochastic Gradient Descent for Deep Neural Networkscited by 42
7 more
- 2020Generalization bounds for deep learningcited by 38
- 2021Fractal Structure and Generalization Properties of Stochastic Optimization Algorithmscited by 23
- 2021Local permutation tests for conditional independencecited by 23
- 2018Persistent Homology and the Upper Box Dimensioncited by 15
- 2023Generalization Bounds with Data-dependent Fractal Dimensionscited by 15
- 2013Distributed computation of persistent homologycited by 12
- 2022Discrete Morse Sandwich: Fast Computation of Persistence Diagrams for Scalar Data -- An Algorithm and A Benchmarkcited by 11
Built on by
Citing papers per year: 2025: 2; 2026: 3.
5 papers.
- 2025T-REGS: Minimum Spanning Tree Regularization for Self-Supervised Learningcited by 2
- 2026Topological Signatures of Grokkingcited by 2
- 2026IdEst: Assessing Self-Supervised Learning Representations via Intrinsic Dimensioncited by 2
- 2025Stability, Complexity and Data-Dependent Worst-Case Generalization Boundscited by 1
- 2026On the Stability and Generalization of First-order Bilevel Minimax Optimizationcited by 0
- 2026IdEst: Assessing Self-Supervised Learning Representations via Intrinsic Dimension2 Jun 2026
- 2026Topological Signatures of Grokking7 May 2026
- 2026On the Stability and Generalization of First-order Bilevel Minimax Optimization22 Apr 2026
- 2025T-REGS: Minimum Spanning Tree Regularization for Self-Supervised Learning27 Oct 2025
- 2025Stability, Complexity and Data-Dependent Worst-Case Generalization Bounds9 Jul 2025