arXiv — cs.AI preprintsInternational5 October 2026
Training-Loss Guarantees for Muon with Finite-Step Newton--Schulz Orthogonalization
This is an official announcement record
Firsthand records what arXiv — cs.AI preprints announced and links to the original. The wording below is theirs, not ours.
arXiv:2610.03306v1 Announce Type: cross Abstract: Existing convergence analyses of Muon either assume exact orthogonalization or analyze classical Newton--Schulz polynomials, and guarantee only stationarity, so it is unresolved what Muon's five tuned Newton--Schulz steps preserve and whether that suffices to reach a prescribed neural-network training loss. We establish a finite-time training guarantee that accounts for both momentum accumulation before orthogonalization and the tuned finite-step update. For full-batch training of a sufficiently wide two-layer ReLU network with fixed random out
Read the official announcement
Opens arxiv.org
More from arXiv — cs.AI preprints
- MintFlow: Minimal Trajectory Intervention for Constrained Flow Matching5 October 2026
- Fast Models, Slow Evidence: A Paired and Self-Audited Evaluation of System-1 Decision Models for LLM Agent Harnesses5 October 2026
- The AI Risk Observatory: What Can We Learn from AI Disclosures in Annual Reports About Societal Resilience?5 October 2026
- Keep It CALM: Analyzing the Limits of Global Unsafety in Text-to-Image Generation5 October 2026
- Choosing Before Acting: Comparative Value Estimation for Long-Horizon Tool-Use Agents5 October 2026
This content is for informational purposes only and is not professional advice. Specifications, prices, plan tiers, and features change frequently and may differ from what is shown here; verify current details on the manufacturer's or company's official page before purchasing. Ratings are based on analysis of published documentation, not independent lab testing.