mlsanityData to 7 Oct 2026

NuMuon: Nuclear-Norm-Constrained Muon for Compressible LLM Training

arXiv 2603.03597 ↗First posted 4 Mar 2026cs.LGcited by 4

Not on the map. Why?

Abstract (arXiv)

The rapid progress of large language models (LLMs) is increasingly constrained by memory and deployment costs, motivating compression methods for practical deployment. Many state-of-the-art compression pipelines leverage the low-rank structure of trained weight matrices, a phenomenon often associated with the properties of popular optimizers such as Adam. In this context, Muon is a recently proposed optimizer that improves LLM pretraining via full-rank update steps, but its induced weight-space structure has not been characterized yet. In this work, we report a surprising empirical finding: despite imposing full-rank updates, Muon-trained models exhibit pronounced low-rank structure in their weight matrices and are readily compressible under standard pipelines. Motivated by this insight, we propose NuMuon, which augments Muon with a nuclear-norm constraint on the update direction, further constraining the learned weights toward low-rank structure. Across billion-parameter-scale models, we show that NuMuon increases weight compressibility and improves post-compression model quality under state-of-the-art LLM compression pipelines while retaining Muon's favorable convergence behavior.

Key facts. Cited by 4 papers in the map (data through 7 Oct 2026). Builds on 51 of its 69 references that are in the map. First posted on arXiv 4 Mar 2026.

Builds on

51 of 69 references.

References · 51

  1. 2023GPT-4 Technical Reportcited by 18,132
  2. 2015Distilling the Knowledge in a Neural Networkcited by 10,076
  3. 2020Scaling Laws for Neural Language Modelscited by 6,411
  4. 2024Qwen2.5 Technical Reportcited by 4,713
  5. 2019HellaSwag: Can a Machine Really Finish Your Sentence?cited by 4,018
  6. 2019PIQA: Reasoning about Physical Commonsense in Natural Languagecited by 2,818
  7. 2022Emergent Abilities of Large Language Modelscited by 2,483
  8. 2018The Lottery Ticket Hypothesis: Finding Sparse, Trainable Neural Networkscited by 2,250
  9. 2023A Survey on Large Language Model based Autonomous Agentscited by 2,203
  10. 2018Can a Suit of Armor Conduct Electricity? A New Dataset for Open Book Question Answeringcited by 2,114
  11. 2024The FineWeb Datasets: Decanting the Web for the Finest Text Data at Scalecited by 1,104
  12. 2023SparseGPT: Massive Language Models Can Be Accurately Pruned in One-Shotcited by 1,090
38 more
  1. 2016The LAMBADA dataset: Word prediction requiring a broad discourse contextcited by 960
  2. 2022LLM.int8(): 8-bit Matrix Multiplication for Transformers at Scalecited by 881
  3. 2024MiniCPM: Unveiling the Potential of Small Language Models with Scalable Training Strategiescited by 694
  4. 2023Are Emergent Abilities of Large Language Models a Mirage?cited by 515
  5. 2024GaLore: Memory-Efficient LLM Training by Gradient Low-Rank Projectioncited by 447
  6. 2017Implicit Regularization in Matrix Factorizationcited by 318
  7. 2014Exploiting Linear Structure Within Convolutional Networks for Efficient Evaluationcited by 304
  8. 20242 OLMo 2 Furiouscited by 302
  9. 2023SqueezeLLM: Dense-and-Sparse Quantizationcited by 285
  10. 2014Speeding up Convolutional Neural Networks with Low Rank Expansionscited by 283
  11. 2024A Survey on Knowledge Distillation of Large Language Modelscited by 276
  12. 2023A Survey on Model Compression for Large Language Modelscited by 263
  13. 2019PowerSGD: Practical Low-Rank Gradient Compression for Distributed Optimizationcited by 234
  14. 2024SVD-LLM: Truncation-aware Singular Value Decomposition for Large Language Model Compressioncited by 231
  15. 2013Predicting Parameters in Deep Learningcited by 223
  16. 2024A Survey on Efficient Inference for Large Language Modelscited by 197
  17. 2022Language model compression with weighted low-rank factorizationcited by 192
  18. 2025Training Deep Learning Models with Norm-Constrained LMOscited by 177
  19. 2023ASVD: Activation-aware Singular Value Decomposition for Compressing Large Language Modelscited by 156
  20. 2021The Low-Rank Simplicity Bias in Deep Networkscited by 150
  21. 2023CodePlan: Repository-level Coding using LLMs and Planningcited by 139
  22. 2024BiLLM: Pushing the Limit of Post-Training Quantization for LLMscited by 137
  23. 2023DiLoCo: Distributed Low-Communication Training of Language Modelscited by 115
  24. 2025Fantastic Pretraining Optimizers and Where to Find Themcited by 87
  25. 2023PB-LLM: Partially Binarized Large Language Modelscited by 80
  26. 2021Think you have Solved Direct-Answer Question Answering? Try ARC-DA, the Direct-Answer AI2 Reasoning Challengecited by 79
  27. 2024Modular Duality in Deep Learningcited by 71
  28. 2025Gluon: Making Muon & Scion Great Again! (Bridging Theory and Practice of LMO-based Optimizers for LLMs)cited by 66
  29. 2015Randomized Block Krylov Methods for Stronger and Faster Approximate Singular Value Decompositioncited by 63
  30. 2022Implicit Regularization Towards Rank Minimization in ReLU Networkscited by 53
  31. 2025Benchmarking Optimizers for Large Language Model Pretrainingcited by 53
  32. 2022Rank Diminishing in Deep Neural Networkscited by 47
  33. 2025Dobi-SVD: Differentiable SVD for LLM Compression and Some New Perspectivescited by 45
  34. 2016Gossip training for deep learningcited by 33
  35. 2022Training invariances and the low-rank phenomenon: beyond linear networkscited by 33
  36. 2022Compression-aware Training of Neural Networks using Frank-Wolfecited by 16
  37. 2025LLMs on the Line: Data Determines Loss-to-Loss Scaling Lawscited by 16
  38. 2025Subspace Networks: Scaling Decentralized Training with Communication-Efficient Model Parallelismcited by 10

50 most cited of 51 All 51 (JSON)

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 4.

4 papers.