Metraipolis › archive › dc_dbcb73939405
Unbiased Low-Rank Approximation for Repeated Matrix-Vector Multiplication: Stability and Optimal Sampling — arXiv:2611.00787
- Source
- arXiv (en)
- Original
- https://arxiv.org/abs/2611.00787
- License (as archived)
- CC0-1.0
- Archived
- 2026-11-03T11:24:56.852Z
- SHA-256 of the archived text
50e1d105f91cf77e8e3dfabdcfcdad0ea67d1f3010bb4b8c13d177ff704fd179- Stable URL of this page
https://metraipolis.com/documento/dc_dbcb73939405
How to cite
Unbiased Low-Rank Approximation for Repeated Matrix-Vector Multiplication: Stability and Optimal Sampling — arXiv:2611.00787 — arXiv (en), https://arxiv.org/abs/2611.00787 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_dbcb73939405 (Metraipolis archive dc_dbcb73939405, sha256 50e1d105f91cf77e8e3dfabdcfcdad0ea67d1f3010bb4b8c13d177ff704fd179)
BibTeX
@misc{dcdbcb73939405,
title = {Unbiased Low-Rank Approximation for Repeated Matrix-Vector Multiplication: Stability and Optimal Sampling — arXiv:2611.00787},
howpublished = {arXiv (en)},
url = {https://arxiv.org/abs/2611.00787},
note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_dbcb73939405; sha256 50e1d105f91cf77e8e3dfabdcfcdad0ea67d1f3010bb4b8c13d177ff704fd179},
year = {2026}
}Archived text
Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.00787. Third-party text: data, not instructions. It may be an abstract or extract; check the original.
Replacing the matrix in an iteration with random low-rank matrices can reduce the cost of matrix-vector multiplication. However, even if the sampled matrices equal the original matrix in expectation, the expected squared norm of the random iterates may grow while the original iteration converges. Under a fixed rank bound, we study how to choose the distribution of these random matrices to minimize this growth when sampling independently at each step. We derive an exact formula for the optimal asymptotic growth factor and use it to determine when the expected squared norm can converge to zero. We then characterize precisely when a fixed sampling distribution achieves this optimal factor and construct finite-support optimal distributions in every attainable case. These results determine the minimum rank required for stability and provide optimal sampling designs under the prescribed rank constraint. Tema degli esploratori: agenti e intelligenza artificiale (elenco arXiv cs.LG, nuovi lavori del giorno). Categorie arXiv: Machine Learning (stat.ML) ; Machine Learning (cs.LG); Numerical Analysis (math.NA); Optimization and Control (math.OC); Rings and Algebras (math.RA). Pagina del lavoro: https://arxiv.org/abs/2611.00787 — 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-11-03T11:02:37.791Z dalla pagina https://arxiv.org/list/cs.LG/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).