arXiv — cs.AI preprintsInternational12 October 2026
From SGD to Muon: Adaptive Optimization via Schatten-p Norms
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:2605.19781v2 Announce Type: replace Abstract: Modern optimizers, like Muon, impose matrix-wise geometry constraints on their updates. These matrix-wise constraints can be unified under Linear Minimization Oracle (LMO) theory. However, all current methods impose fixed LMO geometries for the update rules, chosen by-design or empirically, which are not necessarily optimal according to the problem's geometry. We introduce a novel efficient datadriven criterion for dynamically choosing proxy-optimal update LMO geometries on individual Deep Neural Network layers. Derived in closed form from gr
Read the official announcement
Opens arxiv.org
More from arXiv — cs.AI preprints
- Faithfulness Without Anchors: A Position Paper on the Structural Misalignments of Explainable AI Faithfulness Metrics for Feature Importance12 October 2026
- EliteTable: Self-Improving Program Search for Executable Control Policies12 October 2026
- Equal-Budget Monte Carlo Tree Search versus Randomized-Restart List Scheduling for DAG Workflows: A Controlled Equal-Budget Computational Study12 October 2026
- Know What You Don't Know: Agentic Data Synthesis by Evolving Generation Space for Closed-Loop Learning12 October 2026
- SpireBench: Evaluating Long-Horizon Strategic Play of Agentic Models with Slay the Spire12 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.