N2: A Unified Python Package and Test Bench for Nearest Neighbor-Based Matrix Completion
Not on the map. Why?
Abstract (arXiv)
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 approaches are robust to a range of missingness patterns and effective across diverse applications. This paper introduces N2, a unified Python package and testbed that consolidates a broad class of NN-based methods through a modular, extensible interface. Built for both researchers and practitioners, N2 supports rapid experimentation and benchmarking. Using this framework, we introduce a new NN variant that achieves state-of-the-art results in several settings. We also release a benchmark suite of real-world datasets, from healthcare and recommender systems to causal inference and LLM evaluation, designed to stress-test matrix completion methods beyond synthetic scenarios. Our experiments demonstrate that while classical methods excel on idealized data, NN-based techniques consistently outperform them in real-world settings.
Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 21 of its 46 references that are in the map. First posted on arXiv 4 Jun 2025.
Builds on
21 of 46 references.
References · 21
- 2020Measuring Massive Multitask Language Understandingcited by 7,768
- 2023Mistral 7Bcited by 3,065
- 2024Gemma: Open Models Based on Gemini Research and Technologycited by 889
- 2016Kernel Mean Embedding of Distributions: A Review and Beyondcited by 360
- 2014Matrix Completion and Low-Rank SVD via Fast Alternating Least Squarescited by 104
- 2024Efficient multi-prompt evaluation of LLMscited by 72
- 2019Personalized HeartSteps: A Reinforcement Learning Algorithm for Optimizing Physical Activitycited by 70
- 2021Causal Matrix Completioncited by 45
- 2019Missing Not at Random in Matrix Completion: The Effectiveness of Estimating Missingness Probabilities Under a Low Nuclear Norm Assumptioncited by 29
- 2020Estimating Barycenters of Measures in High Dimensionscited by 18
- 2024Unitxt: Flexible, Shareable and Reusable Data Preparation and Evaluation for Generative AIcited by 18
- 2017Local nearest neighbour classification with applications to semi-supervised learningcited by 17
9 more
- 2018Design-based Analysis in Difference-In-Differences Settings with Staggered Adoptioncited by 15
- 2021Matrix completion with data-dependent missingness probabilitiescited by 15
- 2022Counterfactual inference in sequential experimentscited by 13
- 2021The Micro-Randomized Trial for Developing Digital Interventions: Experimental Design and Data Analysis Considerationscited by 11
- 2022Doubly robust nearest neighbors in factor modelscited by 9
- 2025Benchmarking Generative AI for Scoring Medical Student Interviews in Objective Structured Clinical Examinations (OSCEs)cited by 7
- 2024Distributional Matrix Completion via Nearest Neighbors in the Wasserstein Spacecited by 3
- 2024Learning Counterfactual Distributions via Kernel Nearest Neighborscited by 2
- 2025Adaptively-weighted Nearest Neighbors for Matrix Completioncited by 1
Built on by
Not cited yet.