Inversion dynamics of class manifolds in deep learning reveals tradeoffs underlying generalisation
Not on the map. Why?
Abstract (arXiv)
To achieve near-zero training error in a classification problem, the layers of a feed-forward network have to disentangle the manifolds of data points with different labels, to facilitate the discrimination. However, excessive class separation can bring to overfitting since good generalisation requires learning invariant features, which involve some level of entanglement. We report on numerical experiments showing how the optimisation dynamics finds representations that balance these opposing tendencies with a non-monotonic trend. After a fast segregation phase, a slower rearrangement (conserved across data sets and architectures) increases the class entanglement.The training error at the inversion is stable under subsampling, and across network initialisations and optimisers, which characterises it as a property solely of the data structure and (very weakly) of the architecture. The inversion is the manifestation of tradeoffs elicited by well-defined and maximally stable elements of the training set, coined ``stragglers'', particularly influential for generalisation.
Key facts. Cited by 6 papers in the map (data through 7 Oct 2026). Builds on 31 of its 67 references that are in the map. First posted on arXiv 9 Mar 2023.
Builds on
31 of 67 references.
References · 31
- 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,283
- 2020Supervised Contrastive Learningcited by 2,803
- 2016Understanding deep learning requires rethinking generalizationcited by 1,657
- 2017A Closer Look at Memorization in Deep Networkscited by 936
- 2018Reconciling modern machine learning practice and the bias-variance trade-offcited by 919
- 2019Deep Double Descent: Where Bigger Models and More Data Hurtcited by 667
- 2017Exploring Generalization in Deep Learningcited by 595
- 2022Beyond neural scaling laws: beating power law scaling via data pruningcited by 519
- 2017Opening the Black Box of Deep Neural Networks via Informationcited by 494
- 2014Deep metric learning using Triplet networkcited by 421
- 2018Deep Learning for Classical Japanese Literaturecited by 415
- 2018Measuring the Intrinsic Dimension of Objective Landscapescited by 364
19 more
- 2019Intrinsic dimension of data representations in deep neural networkscited by 276
- 2016Exponential expressivity in deep neural networks through transient chaoscited by 260
- 2018Estimating the intrinsic dimension of datasets by a minimal neighborhood informationcited by 246
- 2017High-dimensional dynamics of generalization error in neural networkscited by 238
- 2017Emergence of Invariance and Disentanglement in Deep Representationscited by 213
- 2019Analyzing and Improving Representations with the Soft Nearest Neighbor Losscited by 95
- 2013Deep Learning of Representations: Looking Forwardcited by 84
- 2017Classification and Geometry of General Perceptual Manifoldscited by 62
- 2019Where is the Information in a Deep Neural Network?cited by 40
- 2019Dimensionality compression and expansion in Deep Neural Networkscited by 38
- 2022Data-driven emergence of convolutional structure in neural networkscited by 29
- 2018How deep is deep enough? -- Quantifying class separability in the hidden layers of deep neural networkscited by 28
- 2017Rethinking generalization requires revisiting old ideas: statistical mechanics approaches and complex learning behaviorcited by 24
- 2021Learning through atypical "phase transitions" in overparameterized neural networkscited by 21
- 2018Semi-Supervised Learning via Compact Latent Space Clusteringcited by 15
- 2022The activity-weight duality in feed forward neural networks: The geometric determinants of generalizationcited by 12
- 2019Intrinsic dimension estimation for locally undersampled datacited by 10
- 2022Linear Classification of Neural Manifolds with Correlated Variabilitycited by 9
- 2020Beyond the storage capacity: data driven satisfiability transitioncited by 6
Built on by
Citing papers per year: 2023: 1; 2024: 2; 2025: 1; 2026: 2.
6 papers.
- 2023Local Kernel Renormalization as a mechanism for feature learning in overparametrized Convolutional Neural Networkscited by 19
- 2024Feature learning in finite-width Bayesian deep linear networks with multiple outputs and convolutional layerscited by 12
- 2026Reasoning emerges from constrained inference manifolds in large language modelscited by 5
- 2024Spring-block theory of feature learning in deep neural networkscited by 2
- 2025The Advantage of Fine-Grained Trainingcited by 1
- 2026Kernel Renormalization in Bayesian Deep Neural Networks: the Equivalent Wishart Ansatz in the Proportional Regimecited by 1
- 2026Kernel Renormalization in Bayesian Deep Neural Networks: the Equivalent Wishart Ansatz in the Proportional Regime28 May 2026
- 2026Reasoning emerges from constrained inference manifolds in large language models2 May 2026
- 2025The Advantage of Fine-Grained Training5 Sep 2025
- 2024Spring-block theory of feature learning in deep neural networks28 Jul 2024
- 2024Feature learning in finite-width Bayesian deep linear networks with multiple outputs and convolutional layers5 Jun 2024
- 2023Local Kernel Renormalization as a mechanism for feature learning in overparametrized Convolutional Neural Networks21 Jul 2023