Conformalized matrix completion

被引:0
|
作者
Gui, Yu [1 ]
Barber, Rina Foygel [1 ]
Ma, Cong [1 ]
机构
[1] Univ Chicago, Dept Stat, Chicago, IL 60637 USA
来源
ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 36 (NEURIPS 2023) | 2023年
基金
美国国家科学基金会;
关键词
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 条
  • [41] Functional correspondence by matrix completion
    Kovnatsky, Artiom
    Bronstein, Michael M.
    Bresson, Xavier
    Vandergheynst, Pierre
    2015 IEEE CONFERENCE ON COMPUTER VISION AND PATTERN RECOGNITION (CVPR), 2015, : 905 - 914
  • [42] Optimal Discrete Matrix Completion
    Huo, Zhouyuan
    Liu, Ji
    Huang, Heng
    THIRTIETH AAAI CONFERENCE ON ARTIFICIAL INTELLIGENCE, 2016, : 1687 - 1693
  • [43] Robust and Scalable Matrix Completion
    Kang, Yangyang
    2016 INTERNATIONAL CONFERENCE ON BIG DATA AND SMART COMPUTING (BIGCOMP), 2016, : 46 - 52
  • [44] Structured matrix estimation and completion
    Klopp, Olga
    Luz, Yu
    Tsybakov, Alexandre B.
    Zhou, Harrison H.
    BERNOULLI, 2019, 25 (4B) : 3883 - 3911
  • [45] EXTENDABLE NEURAL MATRIX COMPLETION
    Duc Minh Nguyen
    Tsiligianni, Evaggelia
    Deligiannis, Nikos
    2018 IEEE INTERNATIONAL CONFERENCE ON ACOUSTICS, SPEECH AND SIGNAL PROCESSING (ICASSP), 2018, : 6328 - 6332
  • [46] Deterministic Algorithms for Matrix Completion
    Heiman, Eyal
    Schechtman, Gideon
    Shraibman, Adi
    RANDOM STRUCTURES & ALGORITHMS, 2014, 45 (02) : 306 - 317
  • [47] A Note on Matrix Completion Problems
    Cravo, Gloria
    ALGEBRA COLLOQUIUM, 2012, 19 : 1179 - 1186
  • [48] Correntropy Based Matrix Completion
    Yang, Yuning
    Feng, Yunlong
    Suykens, Johan A. K.
    ENTROPY, 2018, 20 (03)
  • [49] Some matrix completion problems
    Cravo, Gloria
    COMPTES RENDUS MATHEMATIQUE, 2007, 344 (11) : 673 - 676
  • [50] Matrix Completion with Selective Sampling
    Parkinson, Christian
    Huynh, Kevin
    Needell, Deanna
    2019 13TH INTERNATIONAL CONFERENCE ON SAMPLING THEORY AND APPLICATIONS (SAMPTA), 2019,