Conformalized matrix completion

被引:0
|
作者
Gui, Yu [1 ]
Barber, Rina Foygel [1 ]
Ma, Cong [1 ]
机构
[1] Univ Chicago, Dept Stat, Chicago, IL 60637 USA
基金
美国国家科学基金会;
关键词
CONVEX RELAXATION; RANK; PARAMETERS; INFERENCE; NORM;
D O I
暂无
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
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.
引用
收藏
页数:25
相关论文
共 50 条
  • [1] Network Completion: Beyond Matrix Completion
    Tran, Cong
    Shin, Won-Yong
    35TH INTERNATIONAL CONFERENCE ON INFORMATION NETWORKING (ICOIN 2021), 2021, : 667 - 670
  • [2] Fast Exact Matrix Completion: A Unified Optimization Framework for Matrix Completion
    Bertsimas, Dimitris
    Li, Michael Lingzhi
    JOURNAL OF MACHINE LEARNING RESEARCH, 2020, 21
  • [3] Matrix Completion Problems
    Cravo, Gloria
    LINEAR ALGEBRA AND ITS APPLICATIONS, 2009, 430 (8-9) : 2511 - 2540
  • [4] Matrix completion by deep matrix factorization
    Fan, Jicong
    Cheng, Jieyu
    NEURAL NETWORKS, 2018, 98 : 34 - 41
  • [5] Unsigned Matrix Completion
    Yao, Yunzhen
    Peng, Liangzu
    Tsakiris, Manolis C.
    2021 IEEE INTERNATIONAL SYMPOSIUM ON INFORMATION THEORY (ISIT), 2021, : 2250 - 2255
  • [6] The Complexity of Matrix Completion
    Harvey, Nicholas J. A.
    Karger, David R.
    Yekhanin, Sergey
    PROCEEDINGS OF THE SEVENTHEENTH ANNUAL ACM-SIAM SYMPOSIUM ON DISCRETE ALGORITHMS, 2006, : 1103 - 1111
  • [7] MATRIX COMPLETION THEOREMS
    NEWMAN, M
    PROCEEDINGS OF THE AMERICAN MATHEMATICAL SOCIETY, 1985, 94 (01) : 39 - 45
  • [8] Matrix Completion With Noise
    Candes, Emmanuel J.
    Plan, Yaniv
    PROCEEDINGS OF THE IEEE, 2010, 98 (06) : 925 - 936
  • [9] Coherent Matrix Completion
    Chen, Yudong
    Bhojanapalli, Srinadh
    Sanghavi, Sujay
    Ward, Rachel
    INTERNATIONAL CONFERENCE ON MACHINE LEARNING, VOL 32 (CYCLE 1), 2014, 32
  • [10] Robust matrix completion
    Klopp, Olga
    Lounici, Karim
    Tsybakov, Alexandre B.
    PROBABILITY THEORY AND RELATED FIELDS, 2017, 169 (1-2) : 523 - 564