A Proof of Learning Rate Transfer under μP

Soufiane Hayou
11/3/2025
stat.MLcs.AIcs.CL

No confident code implementation found for this paper. 1 possible match can be shown below.

Abstract

We provide the first proof of learning rate transfer with width in a linear multi-layer perceptron (MLP) parametrized with $μ$P, a neural network parameterization designed to ``maximize'' feature learning in the infinite-width limit. We show that under $μP$, the optimal learning rate converges to a \emph{non-zero constant} as width goes to infinity, providing a theoretical explanation to learning rate transfer. In contrast, we show that this property fails to hold under alternative parametrizations such as Standard Parametrization (SP) and Neural Tangent Parametrization (NTP). We provide intuitive proofs and support the theoretical findings with extensive empirical results.

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. 1 weaker match is hidden by default — 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{hayou2025proof,
  title  = {A Proof of Learning Rate Transfer under μP},
  author = {Soufiane Hayou},
  year   = {2025},
  eprint = {2511.01734},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2511.01734v1}
}

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

Discussion