MACRO: Demystifying Manifold Constraints as the New Foundation for LLM Pre-training

Demystifying Manifold Constraints in LLM Pre-training

2026-05-01
Kang An, Jiaxiang Li, Donald Goldfarb, Shiqian Ma
Summary
Problem
Method
Results
Takeaways
Abstract

The paper introduces MACRO (Msign-Aligned Constrained Riemannian Optimizer), a provably convergent, single-loop Riemannian optimization framework for LLM pre-training. It systematically demystifies manifold constraints (Frobenius, Spectral, and Oblique), demonstrating that they can achieve SOTA performance while replacing traditional stabilization heuristics.

TL;DR

Researchers from Rice University and Columbia University have unveiled MACRO (Msign-Aligned Constrained Riemannian Optimizer), a framework that proves manifold constraints on weight matrices can replace two of the most critical "black magic" heuristics in deep learning: normalization layers (RMSNorm) and weight decay. By treating optimization as a geometric problem on a manifold, MACRO achieves superior stability and performance across models up to 1B parameters.

Background: The Heuristic Crutch

Why do we use RMSNorm or Weight Decay? Conventionally, these are seen as essential stabilizers to prevent activation explosions and improve generalization. However, they are often tuned heuristically. The authors of this paper ask a bold question: Do the intrinsic geometric properties of manifold constraints subsume these heuristics?

The answer is a resounding yes. By constraining weights to specific "spheres" (Spectral or Frobenius), we can mathematically guarantee that activations stay within a healthy range without needing learnable parameters to "fix" them post-hoc.

Methodology: The MACRO Framework

The core innovation is the Msign-Aligned Constrained Riemannian Optimizer (MACRO). Unlike previous "double-loop" methods that were too slow for large-scale training, MACRO uses a streamlined single-loop process:

  1. Tangent Space Projection: Gradients are projected onto the local tangent space of the manifold.
  2. Steepest Descent via Matrix Sign: It applies the msign operator (SVD-based) to find the most efficient update direction.
  3. Manifold Retraction: Weights are projected back onto the manifold (e.g., a Frobenius sphere) to prevent drift.

MACRO Algorithm Workflow

Why the Spectral Sphere Wins in the Extreme

The paper distinguishes between two main constraints:

  • Frobenius Sphere: Controls average-case activation scales.
  • Spectral Sphere: Controls worst-case activation scales (singular value bounding).

When learnable normalization is removed entirely, the Spectral Sphere proves more robust because it strictly prevents the maximum possible amplification of any input signal.

Disentangling Weight Decay and Normalization

The most profound insight of this work is how geometry replaces training dynamics:

  • Replacing Weight Decay: Standard weight decay heuristically tries to balance the "rotation" of weights. MACRO locks the relative learning rate and enforces rotational equilibrium from Step 1.
  • Replacing RMSNorm: As shown in the experiment below, as the manifold radius increases, the model's internal learnable affine parameters () naturally shrink, proving they were performing redundant work.

Interplay between Radius and RMSNorm Params

Experimental Battleground: Normalization-Free Training

Most impressively, the researchers successfully trained a 330M parameter model without any learnable normalization layers. While standard optimizers like Muon diverged (NaN), MACRO remained stable and achieved competitive losses.

Optimizer3e-35e-31e-2 (Standard LR)
Muon (Baseline)2.9122.849NaN
MACRO-spec (Ours)2.8202.7682.739

At the 1B scale, MACRO consistently outperformed or matched high-performance baselines like Muon and MuonH.

1B Training Curve Comparison

Deep Insight: Toward Principled Symmetries

This work signals a shift from "tuning" LLMs to "designing" their geometric environment. By using MACRO, we gain:

  1. Mathematical Convergence: Rigorous proofs match the rate of non-convex optimization.
  2. Parameter Efficiency: Removing learnable norms simplifies the architecture.
  3. Stability: Zero-shot P (Maximal Update Parameterization) transfer is naturally enabled by the manifold structure.

Conclusion & Future Outlook

MACRO demystifies manifold constraints as more than just a "trick" for stability—they are a principled alternative to the overhead of normalization and weight decay. While the paper notes that learnable norms still offer a slight performance edge (due to layer-specific adaptation), the path is clear: future LLMs may focus on layer-specific geometric constraints rather than manually tuned heuristic layers.

Takeaway: If you want a more stable, theoretically grounded LLM, stop tuning your weight decay and start optimizing on the manifold.

Find Similar Papers

Try Our Examples

  • Search for recent papers that achieve "normalization-free" training in Transformer architectures using geometric or spectral constraints.
  • Which study first introduced the concept of "rotational equilibrium" in neural network optimization, and how does MACRO's implementation differ from that original theory?
  • Explore the application of Riemannian optimization or manifold constraints in domains like Vision Transformers (ViT) or Diffusion Models to assess if activation scale control is equally effective there.
Contents
MACRO: Demystifying Manifold Constraints as the New Foundation for LLM Pre-training
1. TL;DR
2. Background: The Heuristic Crutch
3. Methodology: The MACRO Framework
3.1. Why the Spectral Sphere Wins in the Extreme
4. Disentangling Weight Decay and Normalization
5. Experimental Battleground: Normalization-Free Training
6. Deep Insight: Toward Principled Symmetries
7. Conclusion & Future Outlook