Product-Stability: Provable Convergence for Gradient Descent on the Edge of Stability
cs.LG
Submitted: 2026-04-03
Updated: 2026-09-26
Comments: Fixed typos
License: http://creativecommons.org/licenses/by/4.0/
The gist: Empirically, modern deep learning training often occurs at the Edge of Stability (EoS), where the sharpness of the loss exceeds the threshold below which classical convergence analysis applies.
Terminology
Abstract
Empirically, modern deep learning training often occurs at the Edge of Stability (EoS), where the sharpness of the loss exceeds the threshold below which classical convergence analysis applies. Despite recent progress, existing theoretical explanations of EoS either rely on restrictive assumptions or focus on specific squared-loss-type objectives. In this work, we introduce and study a structural property of loss functions that we term product-stability. We show that for losses with product-stable minima, gradient descent applied to objectives of the form (x,y) l(xy) can provably converge to the local minimum even when training in the EoS regime. This framework substantially generalizes prior results and applies to a broad class of losses, including binary cross entropy. Using bifurcation diagrams, we characterize the resulting training dynamics, explain the emergence of stable oscillations, and precisely quantify the sharpness at convergence. Together, our results offer a principled explanation for stable EoS training for a wider class of loss functions.
Sources
- Learning threshold neurons via the "edge of stability"
- Understanding Gradient Descent on Edge of Stability in Deep Learning
- Large Stepsize Gradient Descent for Non-Homogeneous Two-Layer Networks: Margin Improvement and Fast Optimization
- Sharp Minima Can Generalize For Deep Nets
- (S)GD over Diagonal Linear Networks: Implicit Regularisation, Large Stepsizes and Edge of Stability
- Fantastic Generalization Measures and Where to Find Them
- On Large-Batch Training for Deep Learning: Generalization Gap and Sharp Minima
- Gradient Descent with Large Step Sizes: Chaos and Fractal Convergence Region
- Beyond the Quadratic Approximation: the Multiscale Structure of Neural Network Loss Landscapes
- Good regularity creates large learning rate implicit biases: edge of stability, balancing, and catapult
- Implicit Bias of Gradient Descent for Logistic Regression at the Edge of Stability
- Large Stepsize Gradient Descent for Logistic Loss: Non-Monotonicity of the Loss Improves Optimization Efficiency
- Minimax Optimal Convergence of Gradient Descent in Logistic Regression via Large and Adaptive Stepsizes
Related papers
- Polynomial-Augmented Neural Networks (PANNs) with Weak Orthogonality Constraints for Enhanced Function and PDE Approximation
- AIRL-S: Unifying Reinforcement Learning and Search-Based Test-Time Scaling via Adversarial Inverse Reinforcement Learning
- Transformers as Bayesian In-Context Experimenters: Smoothness-Adaptive Efficient ATE Estimation
- Convergence issues in Relational Concept Analysis based on AOC-posets
- Beliefs Beyond Posteriors: The Predictive Cost of ELBO Binding
- Understanding Diffusion Models via Ratio-Based Function Approximation with SignReLU Networks