ADLER -- An efficient Hessian-based strategy for adaptive learning rate

Dario Balboni, Davide Bacciu
5/25/2023
cs.LGmath.OC

No confident code implementation found for this paper.

Abstract

We derive a sound positive semi-definite approximation of the Hessian of deep models for which Hessian-vector products are easily computable. This enables us to provide an adaptive SGD learning rate strategy based on the minimization of the local quadratic approximation, which requires just twice the computation of a single SGD run, but performs comparably with grid search on SGD learning rates on different model architectures (CNN with and without residual connections) on classification tasks. We also compare the novel approximation with the Gauss-Newton approximation.

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{balboni2023adler,
  title  = {ADLER -- An efficient Hessian-based strategy for adaptive learning rate},
  author = {Dario Balboni and Davide Bacciu},
  year   = {2023},
  eprint = {2305.16396},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2305.16396v1}
}

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

Discussion