mlsanityData to 14 Oct 2026

Nonparametric Matrix Estimation with One-Sided Covariates

arXiv 2110.13969 ↗First posted 26 Oct 2021stat.ML cs.LGcited by 5

Not on the map. Why?

Abstract (arXiv)

Consider the task of matrix estimation in which a dataset X ∈ ℝn× m is observed with sparsity p, and we would like to estimate mathbbE[X], where mathbbE[Xui] = f(αu, βi) for some Holder smooth function f. We consider the setting where the row covariates α are unobserved yet the column covariates β are observed. We provide an algorithm and accompanying analysis which shows that our algorithm improves upon naively estimating each row separately when the number of rows is not too small. Furthermore when the matrix is moderately proportioned, our algorithm achieves the minimax optimal nonparametric rate of an oracle algorithm that knows the row covariates. In simulated experiments we show our algorithm outperforms other baselines in low data regimes.

Key facts. Cited by 5 papers in the map (data through 14 Oct 2026). Builds on 6 of its 38 references that are in the map. First posted on arXiv 26 Oct 2021.

Builds on

6 of 38 references.

References · 6

  1. 2016Matrix Completion has No Spurious Local Minimumcited by 125
  2. 2013Provable Inductive Matrix Completioncited by 32
  3. 2017Rates of Convergence of Spectral Methods for Graphon Estimationcited by 28
  4. 2014Matrix Completion on Graphscited by 26
  5. 2015Optimal Estimation and Completion of Matrices with Biclustering Structurescited by 12
  6. 2017Why are Big Data Matrices Approximately Low Rank?cited by 1

Built on by

Cited by year

Citing papers per year: 2022: 1; 2023: 1; 2024: 1; 2025: 2.

5 papers.