arXiv (All)
open access
Spectral Deflation for Factorization-Free Matrix Filtering in Muon and Semidefinite Programming
GPU implementations of the Muon optimizer and of first-order semidefinite programming (SDP) solvers share one computational pattern: a matrix factorization is replaced by a fixed-depth polynomial filter applied after normalization. When a few dominant spectral components carry most of the input's sc
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
- TIDE-MC: Two-Sided Interpolative Decomposition for Billion-Scale GPU Matrix Completion#423939
- AMO: Operator-level Adaptive Muon Orthogonalization#1117421
- VAC: A Volume-sampling-based Elimination Rule for Approximate Cholesky Factorization#1034009
- Bilinear Optimization Divergence: Diagnosing Factor-Constrained LoRA Continual Learning#1049333
- Distributed principal component analysis with limited communication#308498
Record · ID 1035072
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