Non-Euclidean Gradient Descent Operates at the Edge of Stability
Abstract
Lay Summary
Classical optimization literature does not fully capture the dynamics of gradient descent when training neural networks. In particular, theory often predicts that training should become unstable when the loss landscape becomes too “sharp,” but neural networks frequently operate near this predicted instability boundary without diverging. This behavior is known as the Edge of Stability. This work extends the study of Edge of Stability beyond vanilla gradient descent. It introduces a generalized notion of sharpness that depends on the geometry used by the optimizer, covering methods such as non-Euclidean descent, block coordinate descent, and spectral gradient descent. The paper shows, both theoretically and experimentally, that these methods also exhibit progressive sharpening followed by oscillations near the stability threshold. This provides a unified way to understand stability across different optimizers and helps explain why neural network training can remain effective in regimes where classical theory falls short.