Metraipolis › archive › dc_16d50e249fa6
D-SLR: The Disjoint Row-Sparse plus Low-Rank Decomposition — arXiv:2610.10636
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2610.10636
- License (as archived)
- CC0-1.0
- Archived
- 2026-10-09T06:20:52.492Z
- SHA-256 of the archived text
ad4db2975847a9d6be514b94e3306b132dd1607fcda2797b6633df79102ee31f- Stable URL of this page
https://metraipolis.com/documento/dc_16d50e249fa6
How to cite
D-SLR: The Disjoint Row-Sparse plus Low-Rank Decomposition — arXiv:2610.10636 — arXiv (en), https://arxiv.org/abs/2610.10636 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_16d50e249fa6 (Metraipolis archive dc_16d50e249fa6, sha256 ad4db2975847a9d6be514b94e3306b132dd1607fcda2797b6633df79102ee31f)
BibTeX
@misc{dc16d50e249fa6,
title = {D-SLR: The Disjoint Row-Sparse plus Low-Rank Decomposition — arXiv:2610.10636},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2610.10636},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_16d50e249fa6; sha256 ad4db2975847a9d6be514b94e3306b132dd1607fcda2797b6633df79102ee31f},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2610.10636. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Compressing a matrix for reconstruction still defaults to the truncated SVD, approximating the data with a single low-rank structure. It is common to reduce the residual further by adding an overlapping row-sparse component, but methods that solve this joint problem often require iterative solvers and tuning of regularization parameters. We propose the Disjoint Row-Sparse plus Low-Rank (D-SLR) decomposition, a closed-form drop-in for the truncated SVD that improves or exactly matches it. D-SLR restricts rows to either being stored verbatim or approximated by the low-rank fit, never both. Under squared error this restriction costs nothing: the joint optimum is attainable disjointly with fewer parameters at every non-trivial rank and stored row count (shape). With zero stored rows D-SLR reduces to the truncated SVD, so it never does worse at equal cost. The algorithm scores the entire error-versus-parameters tradeoff, and the solution is chosen afterwards by a supplied error target or parameter count, or by a selection rule. The grid and solution together cost three SVDs, with no tuning or regularization. We derive an assumption-free, a-posteriori lower bound on the error at every shape, giving each solution a computable certificate on the potential gain of any other choice of rank and stored rows. Experiments on synthetic and real data (LLM embedding tables, network traffic, hyperspectral images) confirm the gains and quantify the certificate. Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.LG, nuovi lavori del giorno). Categorie arXiv: Machine Learning (cs.LG) ; Methodology (stat.ME); Machine Learning (stat.ML). Pagina del lavoro: https://arxiv.org/abs/2610.10636 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito). Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina. Letto il 2026-10-09T05:50:30.892Z dalla pagina https://arxiv.org/list/cs.LG/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).