כתבה
arXiv cs.LG ·
D-SLR: פירוק נפרד של טורים-רזוס + רציפות נמוכה
D-SLR: The Disjoint Row-Sparse plus Low-Rank Decomposition
פירוק נפרד של טורים-רזוס + רציפות נמוכה: פיצוי סגור-צורה להקטנת מטריצה.
תקציר מקורי באנגליתarXiv:2610.10636v1 Announce Type: new Abstract: 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
קרא במקור המקורי
arxiv.org
פתח כתבה מקורית