SAM operates far from home: eigenvalue regularization as a dynamical phenomenon

Atish Agarwala, Yann N. Dauphin
2/17/2023
cs.LG

No confident code implementation found for this paper.

Abstract

The Sharpness Aware Minimization (SAM) optimization algorithm has been shown to control large eigenvalues of the loss Hessian and provide generalization benefits in a variety of settings. The original motivation for SAM was a modified loss function which penalized sharp minima; subsequent analyses have also focused on the behavior near minima. However, our work reveals that SAM provides a strong regularization of the eigenvalues throughout the learning trajectory. We show that in a simplified setting, SAM dynamically induces a stabilization related to the edge of stability (EOS) phenomenon observed in large learning rate gradient descent. Our theory predicts the largest eigenvalue as a function of the learning rate and SAM radius parameters. Finally, we show that practical models can also exhibit this EOS stabilization, and that understanding SAM must account for these dynamics far away from any minima.

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!

Cite this paper

@article{agarwala2023operates,
  title  = {SAM operates far from home: eigenvalue regularization as a dynamical phenomenon},
  author = {Atish Agarwala and Yann N. Dauphin},
  year   = {2023},
  eprint = {2302.08692},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2302.08692v1},
  journal = {ICML 2023 2023}
}

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/2302.08692.svg)](https://codeofpaper.com/paper/2302.08692)

Discussion