arXiv (All)
open access
Blind error estimation for CUR approximation
Low-rank approximation is a fundamental tool for scalable matrix computations. While such approximations have classically been formed via the truncated SVD, recent advances in randomized numerical linear algebra have produced methods of comparable accuracy at a fraction of the cost. A key advantage
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
- High-Dimensional Assisted Learning for Vertically Distributed Data with Blockwise Missingness#620737
- High-Dimensional Assisted Learning for Vertically Distributed Data with Blockwise Missingness#619058
- Tackling Parallelization Challenges of Randomized Preconditioners With Dependency Tracking#997434
- Resolving positive semi-definiteness in physics-informed kernels for scientific machine learning#662169
- Resolving positive semi-definiteness in physics-informed kernels for scientific machine learning#661119
Record · ID 1050002
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