On the Limitations of Fractal Dimension as a Measure of Generalization
Charlie Tan, Inés García-Redondo, Qiquan Wang, Michael M. Bronstein, Anthea Monod
Abstract
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.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext cd22a114-bcd6-44ff-8b19-481f3615515fCited by top-tier papers2
- T-REGS: Minimum Spanning Tree Regularization for Self-Supervised LearningJulie Mordacq, David Loiseaux, Vicky Kalogeiton, Steve OudotNeurIPS 2025 · 2 citations
- IdEst: Assessing Self-Supervised Learning Representations via Intrinsic DimensionJulie Mordacq, Vicky Kalogeiton, Steve OudotICML 2026 · 1 citation
Builds on7
- Deep Double Descent: Where Bigger Models and More Data HurtPreetum Nakkiran, Gal Kaplun, Yamini Bansal, Tristan Yang et al.ICLR 2020 · 1,108 citations
- Fantastic Generalization Measures and Where to Find ThemYiding Jiang, Behnam Neyshabur, Hossein Mobahi, Dilip Krishnan et al.ICLR 2020 · 705 citations
- Intrinsic Dimension, Persistent Homology and Generalization in Neural NetworksTolga Birdal, Aaron Lou, Leonidas J. Guibas, Umut SimsekliNeurIPS 2021 · 94 citations
- Bad Global Minima Exist and SGD Can Reach ThemShengchao Liu, Dimitris S. Papailiopoulos, Dimitris AchlioptasNeurIPS 2020 · 89 citations
- Hausdorff Dimension, Heavy Tails, and Generalization in Neural NetworksUmut Simsekli, Ozan Sener, George Deligiannidis, Murat A. ErdogduNeurIPS 2020 · 79 citations
Related papers
- Topological Generalization Bounds for Discrete-Time Stochastic Optimization AlgorithmsRayna Andreeva, Benjamin Dupuis, Rik Sarkar, Tolga Birdal et al.NeurIPS 2024 · 13 citations
- Generalization Bounds using Data-Dependent Fractal DimensionsBenjamin Dupuis, George Deligiannidis, Umut SimsekliICML 2023 · 17 citations
- Generalization Error of Generalized Linear Models in High DimensionsMelikasadat Emami, Mojtaba Sahraee-Ardakan, Parthe Pandit, Sundeep Rangan et al.ICML 2020 · 40 citations
- Topological Parallax: A Geometric Specification for Deep Perception ModelsAbraham D. Smith, Michael J. Catanzaro, Gabrielle Angeloro, Nirav Patel et al.NeurIPS 2023 · 2 citations
- Evaluating Generative Models via Cubical Homology based Persistent EntropySuryaka Suresh, Vinayak AbrolKDD 2025
