arXiv (All)
open access
Convergence rates of randomly pivoted methods for low-rank approximation
Randomly pivoted Cholesky, QR, and LU are iterative algorithms that form structured low-rank approximations of a matrix by sampling columns, or rows and columns, from the residual. We give convergence rates for these methods that depend on the decay of the singular values of the original matrix. The
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
- Analysis of RCLUPPr: stability, robustness and acceleration#999827
- Hutch#: Optimal non-adaptive Frobenius norm estimation#1075941
- Stable and Online Algorithms for Random Matrix Discrepancy#1156862
- Towards discrete convex analysis over classical root systems#620506
- Towards discrete convex analysis over classical root systems#618827
Record · ID 973874
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