arXiv (All)
open access
Two-Sided Nearest Neighbors: An adaptive and minimax optimal procedure for matrix completion
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
- Two-Sided Nearest Neighbors: An adaptive and minimax optimal procedure for matrix completion#668240
- N$^2$: A Unified Python Package and Test Bench for Nearest Neighbor-Based Matrix Completion#1084022
- HRNN: A Hybrid Graph Index for Approximate Reverse k-Nearest Neighbor Search on High-Dimensional Vectors#259606
- An Efficient Newton Algorithm for Nonnegative Matrix Factorization with the Kullback-Leibler Divergence#370329
- Low solution rank of the matrix LASSO under RIP with consequences for rank-constrained algorithms#144202
Record · ID 670305
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