arXiv (All)
open access
Polar Switch: Fast Muon Orthogonalization with Polynomial Circuits
Muon, a 2024-born optimizer for language models, differs from the 2015-born spectral gradient descent mainly in its fast, GPU-friendly Newton--Schulz polynomial for orthogonalizing the gradient matrix. Accordingly, a line of research proposes faster polynomial iterations for gradient orthogonalizati
Conceptio Open Archive
Analyze & explore related research in Conceptio
Connect this record directly into your research workflow or AI agent. Explore citations across open repositories, query full text, and export structured proof bundles.
This document is indexed with metadata only: full text is not available in the archive for this record. Open the official source ↗
Related documents
- Polar Switch: Fast Muon Orthogonalization with Polynomial Circuits#1381243
- T-MUON: Tensorizing Muon via t-SVD for Large Language Model Pre-training#1389884
- MatrixFSDP: communication-free matrix optimizers under ZeRO-3 parameter sharding#926111
- Demystifying Manifold Constraints in LLM Pre-training#1129237
- Riemannian Structure and Optimization for a Class of Low-Parametric Orthogonal Matrices#1064526
Record · ID 1401993
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Retrieved via Conceptio: every document is proof-bundled with source, license, and retrieval metadata.
Bring this data into your agent: Connect via MCP or API · 20 free credits to start · no card required
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive
Read the Docs → · View CLI source on GitHub · Conceptio Open Knowledge Archive