arXiv Machine Learning
Two-Sided Nearest Neighbors: An adaptive and minimax optimal procedure for matrix completion
Read the original on arXiv Machine Learning →The Flow has not summarised this story yet — read it at arXiv Machine Learning.
Related stories
arXiv Machine Learning
Aug 18
Doubly robust nearest neighbors in factor models
arXiv:2211. 14297v4 Announce Type: replace-cross Abstract: We introduce and analyze an improved variant of nearest neighbors (NN) for estimation with missing data in latent factor models.
arXiv Machine Learning
3d ago
N$^2$: A Unified Python Package and Test Bench for Nearest Neighbor-Based Matrix Completion
arXiv:2506.04166v3 Announce Type: replace Abstract: Nearest neighbor (NN) methods have re-emerged as competitive tools for matrix completion, offering strong empirical performance and recent theoreti...
arXiv Machine Learning
Jun 19
Alternating Direction Method of Multipliers for Nonlinear Matrix Decompositions
arXiv:2512. 17473v3 Announce Type: replace-cross Abstract: We present an algorithm based on the alternating direction method of multipliers (ADMM) for solving nonlinear matrix decompositions (NMD).
arXiv Machine Learning
2d ago
Near-Optimal Nonconvex Matrix Completion
arXiv:2609. 17048v1 Announce Type: cross Abstract: We study nonconvex methods for matrix completion, the problem of recovering a low-rank matrix from a subset of its entries.
arXiv Machine Learning
Jun 10
Sample-efficient inductive matrix completion with noise and inexact side-information
arXiv:2605. 17189v2 Announce Type: replace-cross Abstract: Inductive matrix completion (IMC) is a variant of low-rank matrix completion that incorporates row and column side-information.
arXiv Statistics ML
3d ago
Synthetic Nearest Neighbors: Extending Synthetic Controls for Matrix Completion with Missing Not at Random Data
arXiv:2609.13586v1 Announce Type: cross Abstract: We develop a causal framework for matrix completion under missing not at random (MNAR) data. Drawing on synthetic controls from the econometric panel...