Skip to content

Curvature-Conditioned Multiscale Momentum with Sphere Constraints for LLM Pretraining

Aug 2026 · 0 citations · 57 references
Computer Science

TL;DR

This work proposes a curvature-conditioned multiscale momentum method with sphere constraints, which significantly accelerates Muon across diverse architectures (dense, MoE) and model sizes (0.12B--2.3B parameters).

Abstract

Pretraining accounts for a large fraction of the total computational cost in LLM training. However, noise-dominant gradients and the highly ill-conditioned loss landscape bring severe challenges. Although modern adaptive optimizers such as AdamW and Muon have achieved great success in large-scale pretraining, their reliance on gradient normalization offers limited mitigation of the ill-conditioned curvature. The progress along flat directions (eigen-directions of small eigenvalues), which dominates the final loss reduction, remains relatively slow. To enhance training dynamics along flat directions, we propose a curvature-conditioned multiscale momentum method with sphere constraints, delivering steady acceleration in LLM pretraining. This multiscale momentum, applied only along flat directions, pairs a slow-decay component for noise reduction with a fast-decay component for rapid curvature adaptation, harnessing their complementary strengths. Crucially, we employ a sphere constraint technique to prevent parameter inflation and excessively rapid effective learning rate decay that would otherwise arise from a naive combination. Extensive experiments show that the proposed method significantly accelerates Muon across diverse architectures (dense, MoE) and model sizes (0.12B--2.3B parameters). Theoretically, we verify the acceleration effect and provide insight into the design principles underlying the flat-direction multiscale momentum.

View source

Similar papers

Jul 2026

Between Gradient and Natural Gradient: A Continuum of LoRA Initializations

It is shown that a principled design space for LoRA initialization and curvature preconditioning should be treated as a tunable dimension rather than a fixed design decision, and a deployable, search-free variant, ULoRA-Auto, selects per-layer exponents from measured spectral statistics, approaches this upper bound at...

Dian Liu, Farshid Ghezelbash · 0 citations
Jul 2026

Mini-batch Noise Lowers Sharpness via Dominant-Subspace Fluctuations

This work shows how the averaged gradient over fluctuations in the dominant directions produces a sharpness correction term, and derive a sharpness correction term induced by mini-batch noise in the dominant directions, which brings the sharpness evolution of GD closer to that of SGD.

Jun-Ho So, Dongwook Shin · 1 citation
Preprint Aug 2026

MALT: Lightweight Curvature-Aware Muon via Diagonal Preconditioning

Experiments on GPT-2 Small, Medium, and Large pretraining show that the proposed methods outperform Muon while maintaining nearly the same memory footprint and wall-clock time.

Tongle Wu, Huanyu Dong, Ying Sun et al. · 1 citation
Jul 2026

Manifold-Constrained Noise Optimization for Diverse Diffusion Sampling

MoNO is proposed, a training-free method that performs Manifold-constrained Noise Optimization on a low-dimensional, quality-stabilizing noise manifold that combines Riemannian updates on an affine low-frequency sphere to preserve prior likelihood and fix unstable high-frequency components by construction.

Qi-Tan Shi, Cheng Jin, Zi-Yuan Liu et al. · 1 citation
#artificial intelligence Preprint Aug 2026

LoRA-GA$^2$: Low Rank Adaptation with Multi-step Gradient Adaptive Alignment

This paper introduces a lightweight probe for multi-step gradients of pretrained weights that incurs no additional GPU memory cost and only marginal time overhead, and employs a spectrum-aware, importance-based rank allocation and optimal initialization derived from multi-step gradients.

Hao-Nan He, Xin Fan · 0 citations

Related blog posts

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.