mlsanityData to 7 Oct 2026

Guiding Neural Collapse: Optimising Towards the Nearest Simplex Equiangular Tight Frame

arXiv 2411.01248 ↗First posted 2 Nov 2024cs.LGcited by 14

Not on the map. Why?

Abstract (arXiv)

Neural Collapse (NC) is a recently observed phenomenon in neural networks that characterises the solution space of the final classifier layer when trained until zero training loss. Specifically, NC suggests that the final classifier layer converges to a Simplex Equiangular Tight Frame (ETF), which maximally separates the weights corresponding to each class. By duality, the penultimate layer feature means also converge to the same simplex ETF. Since this simple symmetric structure is optimal, our idea is to utilise this property to improve convergence speed. Specifically, we introduce the notion of nearest simplex ETF geometry for the penultimate layer features at any given training iteration, by formulating it as a Riemannian optimisation. Then, at each iteration, the classifier weights are implicitly set to the nearest simplex ETF by solving this inner-optimisation, which is encapsulated within a declarative node to allow backpropagation. Our experiments on synthetic and real-world architectures for classification tasks demonstrate that our approach accelerates convergence and enhances training stability.

Key facts. Cited by 14 papers in the map (data through 7 Oct 2026). Builds on 53 of its 73 references that are in the map. First posted on arXiv 2 Nov 2024.

Builds on

53 of 73 references.

References · 53

  1. 2015Deep Residual Learning for Image Recognitioncited by 51,809
  2. 2014Very Deep Convolutional Networks for Large-Scale Image Recognitioncited by 15,267
  3. 2020Supervised Contrastive Learningcited by 2,803
  4. 2016Understanding deep learning requires rethinking generalizationcited by 1,657
  5. 2020Understanding Contrastive Representation Learning through Alignment and Uniformity on the Hyperspherecited by 1,393
  6. 2017Visualizing the Loss Landscape of Neural Netscited by 1,126
  7. 2018CosFace: Large Margin Cosine Loss for Deep Face Recognitioncited by 968
  8. 2017SphereFace: Deep Hypersphere Embedding for Face Recognitioncited by 733
  9. 2020Prevalence of Neural Collapse during the terminal phase of deep learning trainingcited by 713
  10. 2017The Implicit Bias of Gradient Descent on Separable Datacited by 649
  11. 2017OptNet: Differentiable Optimization as a Layer in Neural Networkscited by 588
  12. 2018Gradient Descent Finds Global Minima of Deep Neural Networkscited by 572
38 more
  1. 2019Differentiable Convex Optimization Layerscited by 458
  2. 2014In Search of the Real Inductive Bias: On the Role of Implicit Regularization in Deep Learningcited by 339
  3. 2019Gradient Descent Maximizes the Margin of Homogeneous Neural Networkscited by 308
  4. 2018Implicit Bias of Gradient Descent on Linear Convolutional Networkscited by 251
  5. 2021A Geometric Analysis of Neural Collapse with Unconstrained Featurescited by 226
  6. 2021Exploring Deep Neural Networks via Layer-Peeled Model: Minority Collapse in Imbalanced Trainingcited by 166
  7. 2021Neural Collapse Under MSE Loss: Proximity to and Dynamics on the Central Pathcited by 156
  8. 2020Learning Diverse and Discriminative Representations via the Principle of Maximal Coding Rate Reductioncited by 141
  9. 2020Neural collapse with unconstrained featurescited by 140
  10. 2019Cheap Orthogonal Constraints in Neural Networks: A Simple Parametrization of the Orthogonal and Unitary Groupcited by 133
  11. 2019Implicit Regularization of Discrete Gradient Dynamics in Linear Neural Networkscited by 122
  12. 2016On Differentiating Parameterized Argmin and Argmax Problems with Application to Bi-level Optimizationcited by 108
  13. 2022Inducing Neural Collapse in Imbalanced Learning: Do We Really Need a Learnable Classifier at the End of Deep Neural Network?cited by 100
  14. 2022On the Optimization Landscape of Neural Collapse under MSE Loss: Global Optimality with Unconstrained Featurescited by 97
  15. 2017L2-constrained Softmax Loss for Discriminative Face Verificationcited by 96
  16. 2016Pymanopt: A Python Toolbox for Optimization on Manifolds using Automatic Differentiationcited by 93
  17. 2016First-order Methods for Geodesically Convex Optimizationcited by 92
  18. 2021An Unconstrained Layer-Peeled Perspective on Neural Collapsecited by 87
  19. 2022Imbalance Trouble: Revisiting Neural-Collapse Geometrycited by 80
  20. 2019Trivializations for Gradient-Based Optimization on Manifoldscited by 78
  21. 2022Are All Losses Created Equal: A Neural Collapse Perspectivecited by 78
  22. 2019Deep Declarative Networks: A New Hopecited by 77
  23. 2021Dissecting Supervised Contrastive Learningcited by 64
  24. 2021A Prototype-Oriented Framework for Unsupervised Domain Adaptationcited by 62
  25. 2020Gradient descent follows the regularization path for general lossescited by 57
  26. 2020On the emergence of simplex symmetry in the final and penultimate layers of neural network classifierscited by 51
  27. 2022Neural Collapse with Normalized Features: A Geometric Analysis over the Riemannian Manifoldcited by 50
  28. 2018Fix your classifier: the marginal value of training the last weight layercited by 43
  29. 2020Gradient Methods Never Overfit On Separable Datacited by 29
  30. 2020Robust Recovery via Implicit Bias of Discrepant Learning Rates for Double Over-parameterizationcited by 26
  31. 2021Regular Polytope Networkscited by 24
  32. 2023On the Implicit Geometry of Cross-Entropy Parameterizations for Label-Imbalanced Datacited by 23
  33. 2021Inductive Bias of Multi-Channel Linear Convolutional Networks with Bounded Weight Normcited by 18
  34. 2023Automatic Gradient Descent: Deep Learning without Hyperparameterscited by 14
  35. 2023Neural Collapse Terminus: A Unified Solution for Class Incremental Learning and Its Variantscited by 14
  36. 2022Dissolving Constraints for Riemannian Optimizationcited by 12
  37. 2020Deep Networks from the Principle of Rate Reductioncited by 10
  38. 2019Accelerated Optimization With Orthogonality Constraintscited by 6

50 most cited of 53 All 53 (JSON)

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2025: 6; 2026: 8.

14 papers.

Sort: