Flavors of Margin: Implicit Bias of Steepest Descent in Homogeneous Neural Networks
Not on the map. Why?
Abstract (arXiv)
We study the implicit bias of the general family of steepest descent algorithms with infinitesimal learning rate in deep homogeneous neural networks. We show that: (a) an algorithm-dependent geometric margin starts increasing once the networks reach perfect training accuracy, and (b) any limit point of the training trajectory corresponds to a KKT point of the corresponding margin-maximization problem. We experimentally zoom into the trajectories of neural networks optimized with various steepest descent algorithms, highlighting connections to the implicit bias of popular adaptive methods (Adam and Shampoo).
Key facts. Cited by 13 papers in the map (data through 7 Oct 2026). Builds on 30 of its 57 references that are in the map. First posted on arXiv 29 Oct 2024.
Builds on
30 of 57 references.
References · 30
- 2014Adam: A Method for Stochastic Optimizationcited by 36,960
- 2021Convex optimizationcited by 2,479
- 2017The Implicit Bias of Gradient Descent on Separable Datacited by 649
- 2018Shampoo: Preconditioned Stochastic Tensor Optimizationcited by 413
- 2014In Search of the Real Inductive Bias: On the Role of Implicit Regularization in Deep Learningcited by 339
- 2019Gradient Descent Maximizes the Margin of Homogeneous Neural Networkscited by 308
- 2020Kernel and Rich Regimes in Overparametrized Modelscited by 302
- 2018Characterizing Implicit Bias in Terms of Optimization Geometrycited by 259
- 2017The Marginal Value of Adaptive Gradient Methods in Machine Learningcited by 248
- 2018Gradient descent aligns the layers of deep linear networkscited by 182
- 2024Old Optimizer, New Norm: An Anthologycited by 173
- 2020Directional convergence and alignment in deep learningcited by 172
18 more
- 2022Reconstructing Training Data from Trained Neural Networkscited by 129
- 2018Stochastic subgradient method converges on tame functionscited by 120
- 2015Path-SGD: Path-Normalized Optimization in Deep Neural Networkscited by 117
- 2023Noise Is Not the Main Factor Behind the Gap Between SGD and Adam on Transformers, but Sign Descent Might Becited by 114
- 2022On the Implicit Bias in Deep-Learning Algorithmscited by 84
- 2022Benign Overfitting without Linearity: Neural Network Classifiers Trained by Gradient Descent for Noisy Linear Datacited by 74
- 2024Scalable Optimization in the Modular Normcited by 64
- 2024Implicit Bias of AdamW: ℓ_∞ Norm Constrained Optimizationcited by 54
- 2019Lexicographic and Depth-Sensitive Margins in Homogeneous and Non-Homogeneous Deep Modelscited by 53
- 2020The Implicit Bias for Adaptive Optimization Algorithms on Homogeneous Neural Networkscited by 43
- 2022The Implicit Bias of Benign Overfittingcited by 38
- 2013Margins, Shrinkage, and Boostingcited by 35
- 2021On Margin Maximization in Linear and ReLU Networkscited by 34
- 2024The Implicit Bias of Adam on Separable Datacited by 32
- 2022The Asymmetric Maximum Margin Bias of Quasi-Homogeneous Neural Networkscited by 25
- 2021Does Momentum Change the Implicit Regularization on Separable Data?cited by 21
- 2024Large Stepsize Gradient Descent for Non-Homogeneous Two-Layer Networks: Margin Improvement and Fast Optimizationcited by 17
- 2024The Price of Implicit Bias in Adversarially Robust Generalizationcited by 4
Built on by
Citing papers per year: 2025: 6; 2026: 7.
13 papers.
Sort:
- 2025Implicit Bias of Spectral Descent and Muon on Multiclass Separable Datacited by 33
- 2025An Exploration of Non-Euclidean Gradient Descent: Muon and its Many Variantscited by 25
- 2025How Muon's Spectral Design Benefits Generalization: A Study on Imbalanced Datacited by 16
- 2025The Rich and the Simple: On the Implicit Bias of Adam and SGDcited by 12
- 2026The Implicit Bias of Adam and Muon on Smooth Homogeneous Neural Networkscited by 6
- 2025Implicit Bias of Per-sample Adam on Separable Data: Departure from the Full-batch Regimecited by 2
- 2026Never Saddle for Reparameterized Steepest Descent as Mirror Flowcited by 2
- 2025Any-stepsize Gradient Descent for Separable Data under Fenchel-Young Lossescited by 1
- 2026Hard labels sampled from sparse targets mislead rotation invariant algorithmscited by 0
- 2026Implicit Bias of Mirror Flow in Homogeneous Neural Networks: Sparse and Dense Feature Learningcited by 0
- 2026HORST: Composing Optimizer Geometries for Sparse Transformer Trainingcited by 0
- 2026Non-asymptotic implicit bias of logistic regression at early-stage gradient descent dynamicscited by 0
- 2026Optimizer-dependent training dynamics converge to the same one-third optimal data scaling29 Sep 2026
- 2026Non-asymptotic implicit bias of logistic regression at early-stage gradient descent dynamics5 Aug 2026
- 2026HORST: Composing Optimizer Geometries for Sparse Transformer Training20 May 2026
- 2026Implicit Bias of Mirror Flow in Homogeneous Neural Networks: Sparse and Dense Feature Learning19 May 2026
- 2026Hard labels sampled from sparse targets mislead rotation invariant algorithms21 Mar 2026
- 2026Never Saddle for Reparameterized Steepest Descent as Mirror Flow2 Mar 2026
- 2026The Implicit Bias of Adam and Muon on Smooth Homogeneous Neural Networks18 Feb 2026
- 2025Implicit Bias of Per-sample Adam on Separable Data: Departure from the Full-batch Regime30 Oct 2025
- 2025How Muon's Spectral Design Benefits Generalization: A Study on Imbalanced Data27 Oct 2025
- 2025An Exploration of Non-Euclidean Gradient Descent: Muon and its Many Variants10 Oct 2025
- 2025The Rich and the Simple: On the Implicit Bias of Adam and SGD29 May 2025
- 2025Any-stepsize Gradient Descent for Separable Data under Fenchel-Young Losses7 Feb 2025
1 more
- 2025Implicit Bias of Spectral Descent and Muon on Multiclass Separable Datacited by 33
- 2025An Exploration of Non-Euclidean Gradient Descent: Muon and its Many Variantscited by 25
- 2025How Muon's Spectral Design Benefits Generalization: A Study on Imbalanced Datacited by 16
- 2025The Rich and the Simple: On the Implicit Bias of Adam and SGDcited by 12
- 2026The Implicit Bias of Adam and Muon on Smooth Homogeneous Neural Networkscited by 6
- 2025Implicit Bias of Per-sample Adam on Separable Data: Departure from the Full-batch Regimecited by 2
- 2026Never Saddle for Reparameterized Steepest Descent as Mirror Flowcited by 2
- 2025Any-stepsize Gradient Descent for Separable Data under Fenchel-Young Lossescited by 1
- 2026Hard labels sampled from sparse targets mislead rotation invariant algorithmscited by 0
- 2026Implicit Bias of Mirror Flow in Homogeneous Neural Networks: Sparse and Dense Feature Learningcited by 0
- 2026HORST: Composing Optimizer Geometries for Sparse Transformer Trainingcited by 0
- 2026Non-asymptotic implicit bias of logistic regression at early-stage gradient descent dynamicscited by 0
12 most cited of 13 All 13 (JSON)
- 2026Optimizer-dependent training dynamics converge to the same one-third optimal data scaling29 Sep 2026
- 2026Non-asymptotic implicit bias of logistic regression at early-stage gradient descent dynamics5 Aug 2026
- 2026HORST: Composing Optimizer Geometries for Sparse Transformer Training20 May 2026
- 2026Implicit Bias of Mirror Flow in Homogeneous Neural Networks: Sparse and Dense Feature Learning19 May 2026
- 2026Hard labels sampled from sparse targets mislead rotation invariant algorithms21 Mar 2026
- 2026Never Saddle for Reparameterized Steepest Descent as Mirror Flow2 Mar 2026
- 2026The Implicit Bias of Adam and Muon on Smooth Homogeneous Neural Networks18 Feb 2026
- 2025Implicit Bias of Per-sample Adam on Separable Data: Departure from the Full-batch Regime30 Oct 2025
- 2025How Muon's Spectral Design Benefits Generalization: A Study on Imbalanced Data27 Oct 2025
- 2025An Exploration of Non-Euclidean Gradient Descent: Muon and its Many Variants10 Oct 2025
- 2025The Rich and the Simple: On the Implicit Bias of Adam and SGD29 May 2025
- 2025Any-stepsize Gradient Descent for Separable Data under Fenchel-Young Losses7 Feb 2025
12 newest of 13 All 13 (JSON)