Feature Learning Beyond the Edge of Stability

Dávid Terjék
2/18/2025
cs.LG

No confident code implementation found for this paper.

Abstract

We propose a homogeneous multilayer perceptron parameterization with polynomial hidden layer width pattern and analyze its training dynamics under stochastic gradient descent with depthwise gradient scaling in a general supervised learning scenario. We obtain formulas for the first three Taylor coefficients of the minibatch loss during training that illuminate the connection between sharpness and feature learning, providing in particular a soft rank variant that quantifies the quality of learned hidden layer features. Based on our theory, we design a gradient scaling scheme that in tandem with a quadratic width pattern enables training beyond the edge of stability without loss explosions or numerical errors, resulting in improved feature learning and implicit sharpness regularization as demonstrated empirically.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{terjk2025feature,
  title  = {Feature Learning Beyond the Edge of Stability},
  author = {Dávid Terjék},
  year   = {2025},
  eprint = {2502.13110},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2502.13110v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2502.13110.svg)](https://codeofpaper.com/paper/2502.13110)

Discussion