aiqbench analysis
This research establishes "product-stability" as a structural property enabling gradient descent to provably converge at the Edge of Stability, significantly broadening theoretical guarantees beyond restricted squared-loss objectives. By applying this framework to diverse loss functions like binary cross-entropy, the study provides a principled explanation for the stable oscillations observed in modern deep learning training dynamics.
Product-Stability: Provable Convergence for Gradient Descent on the Edge of Stability
arXiv:2604.02653v3 Announce Type: replace 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) \mapsto 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.
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) \mapsto 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.
Machine Learning (cs.LG)
arXiv:2604.02653 [cs.LG]
(or arXiv:2604.02653v3 [cs.LG] for this version)
https://doi.org/10.48550/arXiv.2604.02653 Focus to learn more arXiv-issued DOI via DataCite
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 247 words
Related coverage
Flatland: The Adventures of Gradient Descent with Large Step Sizes
arXiv · Jun 8, 2026
A Bifurcation Theory Framework for Gradient Descent on the Edge of Stability
arXiv · Jun 16, 2026

[AINews] Reality Checks on AI News (Yegge shuts down Gas Town, Databricks’ +60% Astra cost)
Latent Space · Sep 17, 2026
Non-Euclidean Gradient Descent Has Many Edges of Stability
arXiv · Oct 14, 2026