Conformalized matrix completion

Yu Gui, R. Barber, Cong Ma
2/12/2026

No official code found. Best implementation: yugjerry/conf-mc (8 stars, last commit 2023-05-23).

Abstract

Matrix completion aims to estimate missing entries in a data matrix, using the assumption of a low-complexity structure (e.g., low rank) so that imputation is possible. While many effective estimation algorithms exist in the literature, uncertainty quantification for this problem has proved to be challenging, and existing methods are extremely sensitive to model misspecification. In this work, we propose a distribution-free method for predictive inference in the matrix completion problem. Our method adapts the framework of conformal prediction, which provides confidence intervals with guaranteed distribution-free validity in the setting of regression, to the problem of matrix completion. Our resulting method, conformalized matrix completion (cmc), offers provable predictive coverage regardless of the accuracy of the low-rank model. Empirical results on simulated and real data demonstrate that cmc is robust to model misspecification while matching the performance of existing model-based methods when the model is correct.

View on arXivView PDF

Code Implementations(1)

yugjerry/conf-mcCommunity100%

Conformalized matrix completion

82Cython, PythonApr 27, 20233 years ago
conformal-predictiondistribution-freematrix-completion

Similar Papers

Cite this paper

@article{gui2026conformalized,
  title  = {Conformalized matrix completion},
  author = {Yu Gui and R. Barber and Cong Ma},
  year   = {2026},
  eprint = {2305.10637},
  archivePrefix = {arXiv},
  url    = {https://arxiv.org/abs/2305.10637},
  journal = {NEURIPS 2023 2023}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2305.10637.svg)](https://codeofpaper.com/paper/2305.10637)

Discussion