A two-sided nearest-neighbor estimator is claimed to match the oracle minimax rate for matrix completion under Holder-smooth, possibly non-Lipschitz latent factor models, even when entries are missing not at random.
Title resolution pending
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
stat.ML 1years
2024 1verdicts
REJECT 1representative citing papers
citing papers explorer
-
Two-Sided Nearest Neighbors: An adaptive and minimax optimal procedure for matrix completion
A two-sided nearest-neighbor estimator is claimed to match the oracle minimax rate for matrix completion under Holder-smooth, possibly non-Lipschitz latent factor models, even when entries are missing not at random.