paper-with-me

홈 › Papers

A Proof of Learning Rate Transfer under $μ$P

2025-11-03 · Soufiane Hayou arxiv

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.

📄 PDF Abstract BibTeX arXiv:2511.01734

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Yanasse: Finding New Proofs from Deep Vision's Analogies, Part 1

2026-04-19 · Alexandre Linhares arxiv

Project Yanasse presents a method for discovering new proofs of theorems in one area of mathematics by transferring proof strategy patterns (e.g., Lean 4 tactic invocation patterns) from a structurally distant area. The …

PaMpeR: Proof Method Recommendation System for Isabelle/HOL

2018-06-19 · Yutaka Nagashima, Yilun He

Deciding which sub-tool to use for a given proof state requires expertise specific to each ITP. To mitigate this problem, we present PaMpeR, a Proof Method Recommendation system for Isabelle/HOL. Given a proof state, PaM…

Chat-Based Support Alone May Not Be Enough: Comparing Conversational and Embedded LLM Feedback for Mathematical Proof Learning

2026-02-21 · Eason Chen, Sophia Judicke, Kayla Beigh, Xinyi Tang 외 arxiv

We evaluate GPTutor, an LLM-powered tutoring system for an undergraduate discrete mathematics course. It integrates two LLM-supported tools: a structured proof-review tool that provides embedded feedback on students' wri…

ProofWala: Multilingual Proof Data Synthesis and Theorem-Proving

2025-02-07 · Amitayush Thakur, George Tsoukalas, Greg Durrett, Swarat Chaudhuri

Neural networks have shown substantial promise at automatic theorem-proving in interactive proof assistants (ITPs) like Lean and Coq. However, most neural theorem-proving models are restricted to specific ITPs, leaving o…

Automated Theorem Proving

Understanding the QuickXPlain Algorithm: Simple Explanation and Formal Proof

2020-01-07 · Patrick Rodler

In his seminal paper of 2004, Ulrich Junker proposed the QuickXPlain algorithm, which provides a divide-and-conquer computation strategy to find within a given set an irreducible subset with a particular (monotone) prope…

Recommendation Systems