Summary
This paper introduces a preconditioning (PC) layer, a weight parameterization based on a low-degree polynomial preconditioner that maintains stable weight conditioning throughout large language model (LLM) training. The PC module reshapes the singular-value spectrum of weight matrices via polynomial preconditioning, improving training stability and convergence. A key practical benefit is that after training, the preconditioned weights can be merged back into the original architecture, so the approach introduces zero inference overhead. The authors demonstrate advantages over standard transformers in Llama-1B pre-training, and the method is compatible with both the AdamW and Muon optimizers. On the theoretical side, they justify the spectrum-control principle by proving that uniformly bounding each layer's singular values guarantees geometric convergence of gradient descent to global minima for certain deep linear networks. The work is by Senmiao Wang, Tiantian Fang, Haoran Zhang, Yushun Zhang, Kunxiang Zhao, Alex Schwing, and Ruoyu Sun, with code open-sourced on GitHub and the paper available as arXiv:2606.06470.
Research area: ML
Authors: Senmiao Wang, Tiantian Fang, Haoran Zhang, Yushun Zhang, Kunxiang Zhao, Alex Schwing, Ruoyu Sun
Published: 2026-06-04
arXiv: 2606.06470
What the paper proposes
We propose a preconditioning (PC) layer, a weight parameterization via polynomial preconditioner that ensures stable weight conditioning throughout LLM training.
Key aspects:
- Spectral control: The PC module reshapes the singular-value spectrum of weight matrices via low-degree polynomial preconditioning.
- Zero inference overhead: After training, the preconditioned weights can be merged back into the original architecture, incurring no inference overhead.
- Empirical results: The PC layer shows advantages over standard transformers in Llama-1B pre-training, working with both the AdamW and Muon optimizers.
- Theory: The spectrum-control principle is justified by proving that uniformly bounding each layer's singular values ensures geometric convergence of gradient descent to global minima, for certain deep linear networks.
Resources
- Code: https://github.com/Empath-aln/PC-layer
- Paper: https://arxiv.org/abs/2606.06470
This page is an English static mirror generated for search and AI citation.
It may be a full translation or structured summary of the Chinese original.
Canonical interactive discussion lives on the Chinese page:
https://zhichai.net/topic/177980966