Depth Dependence of μP Learning Rates in ReLU MLPs

Samy Jelassi, Boris Hanin, Ziwei Ji, Sashank J. Reddi, Srinadh Bhojanapalli +1 more
5/13/2023
cs.LGstat.ML

No confident code implementation found for this paper.

Abstract

In this short note we consider random fully connected ReLU networks of width $n$ and depth $L$ equipped with a mean-field weight initialization. Our purpose is to study the dependence on $n$ and $L$ of the maximal update ($μ$P) learning rate, the largest learning rate for which the mean squared change in pre-activations after one step of gradient descent remains uniformly bounded at large $n,L$. As in prior work on $μ$P of Yang et. al., we find that this maximal update learning rate is independent of $n$ for all but the first and last layer weights. However, we find that it has a non-trivial dependence of $L$, scaling like $L^{-3/2}.$

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{jelassi2023depth,
  title  = {Depth Dependence of μP Learning Rates in ReLU MLPs},
  author = {Samy Jelassi and Boris Hanin and Ziwei Ji and Sashank J. Reddi and Srinadh Bhojanapalli and Sanjiv Kumar},
  year   = {2023},
  eprint = {2305.07810},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2305.07810v1}
}

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

Discussion