mlsanityData to 7 Oct 2026

Statistical Inference For Noisy Matrix Completion Incorporating Auxiliary Information

arXiv 2403.14899 ↗First posted 22 Mar 2024stat.ME stat.MLcited by 2

Not on the map. Why?

Abstract (arXiv)

This paper investigates statistical inference for noisy matrix completion in a semi-supervised model when auxiliary covariates are available. The model consists of two parts. One part is a low-rank matrix induced by unobserved latent factors; the other part models the effects of the observed covariates through a coefficient matrix which is composed of high-dimensional column vectors. We model the observational pattern of the responses through a logistic regression of the covariates, and allow its probability to go to zero as the sample size increases. We apply an iterative least squares (LS) estimation approach in our considered context. The iterative LS methods in general enjoy a low computational cost, but deriving the statistical properties of the resulting estimators is a challenging task. We show that our method only needs a few iterations, and the resulting entry-wise estimators of the low-rank matrix and the coefficient matrix are guaranteed to have asymptotic normal distributions. As a result, individual inference can be conducted for each entry of the unknown matrices. We also propose a simultaneous testing procedure with multiplier bootstrap for the high-dimensional coefficient matrix. This simultaneous inferential tool can help us further investigate the effects of covariates for the prediction of missing entries.

Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Builds on 10 of its 33 references that are in the map. First posted on arXiv 22 Mar 2024.

Builds on

10 of 33 references.

References · 10

  1. 2014Matrix Completion and Low-Rank SVD via Fast Alternating Least Squarescited by 104
  2. 2014Guaranteed Matrix Completion via Non-convex Factorizationcited by 81
  3. 2013Confidence Intervals and Hypothesis Testing for High-Dimensional Regressioncited by 78
  4. 2019Noisy Matrix Completion: Understanding Statistical Guarantees for Convex Relaxation via Nonconvex Optimizationcited by 58
  5. 2019Inference and Uncertainty Quantification for Noisy Matrix Completioncited by 39
  6. 2013Matrix Completion via Max-Norm Constrained Optimizationcited by 18
  7. 2019Statistical Inferences of Linear Forms for Noisy Matrix Completioncited by 18
  8. 2018Collective Matrix Completioncited by 9
  9. 2021Covariate-assisted Sparse Tensor Completioncited by 4
  10. 2020Sparse network asymptotics for logistic regressioncited by 2

Built on by

Cited by year

Citing papers per year: 2024: 2.

2 papers.