arXiv (OAI Expanded)
open access
N$^2$: A Unified Python Package and Test Bench for Nearest Neighbor-Based Matrix Completion
Nearest neighbor (NN) methods have re-emerged as competitive tools for matrix completion, offering strong empirical performance and recent theoretical guarantees, including entry-wise error bounds, confidence intervals, and minimax optimality. Despite their simplicity, recent work has shown that NN
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#670305
- Two-Sided Nearest Neighbors: An adaptive and minimax optimal procedure for matrix completion#668240
- Beyond singular value gaps in randomized subspace approximation#1061683
- Near-Optimal Nonconvex Matrix Completion#1123449
- Near-Optimal Nonconvex Matrix Completion#919410
Record · ID 1084022
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