Evidence map›Paper›PMID 31666329›Full record

ArticleProceedings of the National Academy of Sciences of the United States of America2019

Inference and uncertainty quantification for noisy matrix completion.

Yuxin Chen, Jianqing Fan, Cong Ma, Yuling Yan

Abstract read
In one paragraph

Article in Proceedings of the National Academy of Sciences of the United States of America, 2019. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 19 papers.

0numbers the graph read from it
0cells of the map it votes in
19citing papers in PubMed
–field-weighted citation impact
1 · What the graph read from it

What it found

Each row is one number read from the abstract, on the scale the paper reported it, with its interval. Left of the dashed line favours the treatment, right favours the comparator. Under each row is the sentence it came from. New to these charts? A ten-minute tutorial.

The abstract states no effect estimate the extractor could read, or names no intervention and outcome on the map, so this paper lights no cell and moves no belief. It is still indexed, cited and linked below.

2 · The registry

The trial behind it

Trials whose registry record cites this paper, or whose number appears in the abstract. A trial that started after this paper was published is citing it as background, not reporting it.

Neither the registry nor the abstract names a trial number. If this is a trial report, that itself is worth knowing.

3 · Its place in the literature

Who cites it

19 citing papers in PubMed.

  1. Article
  2. Inference of dependency knowledge graph for Electronic Health Records.Journal of the Royal Statistical Society. Series B, Statistical methodology · 2026
    Article
  3. Article
  4. Article
  5. Article
  6. AUGMENTED DOUBLY ROBUST POST-IMPUTATION INFERENCE FOR PROTEOMIC DATA.bioRxiv : the preprint server for biology · 2025
    Article
  7. Article
  8. Article
  9. Matrix completion under complex survey sampling.Annals of the Institute of Statistical Mathematics · 2023
    Article
  10. Article
  11. Uncertainty in denoising of MRSI using low-rank methods.Magnetic resonance in medicine · 2022
    Article
  12. Multiple Imputation via Generative Adversarial Network for High-dimensional Blockwise Missing Value Problems.Proceedings of the ... International Conference on Machine Learning and Applications. International Conference on Machine Learning and Applications · 2021
    Article
  13. Article
  14. Article
  15. Article
  16. RankSIAM journal on mathematics of data science · 2021
    Article
  17. Article
  18. NOISY MATRIX COMPLETION: UNDERSTANDING STATISTICAL GUARANTEES FOR CONVEX RELAXATION VIA NONCONVEX OPTIMIZATION.SIAM journal on optimization : a publication of the Society for Industrial and Applied Mathematics · 2020
    Article
  19. Comment: Feature Screening and Variable Selection via Iterative Ridge Regression.Technometrics : a journal of statistics for the physical, chemical, and engineering sciences · 2020
    Article
4 · The record

Corrections and comments

PubMed lists nothing against this paper. Absence here is not a guarantee, only a check that was made.

5 · Who and what money

Authors and funding

4 authors.

Yuxin ChenDepartment of Electrical Engineering, Princeton University, Princeton, NJ 08544; yuxin.chen@princeton.edu.
Jianqing FanDepartment of Operations Research and Financial Engineering, Princeton University, Princeton, NJ 08544.
Cong MaDepartment of Operations Research and Financial Engineering, Princeton University, Princeton, NJ 08544.ORCID 0000-0003-2532-0038
Yuling YanDepartment of Operations Research and Financial Engineering, Princeton University, Princeton, NJ 08544.

Funding

Statistical Methods for Ultrahigh-dimensional Biomedical DataR01GM072611 · NIGMS · PRINCETON UNIVERSITY · PI CATTANEO, MATIAS DAMIAN · 2006 to 2021
$4.2M
NIGMS NIH HHS R01 GM072611
6 · The paper itself

Abstract

Noisy matrix completion aims at estimating a low-rank matrix given only partial and corrupted entries. Despite remarkable progress in designing efficient estimation algorithms, it remains largely unclear how to assess the uncertainty of the obtained estimates and how to perform efficient statistical inference on the unknown matrix (e.g., constructing a valid and short confidence interval for an unseen entry). This paper takes a substantial step toward addressing such tasks. We develop a simple procedure to compensate for the bias of the widely used convex and nonconvex estimators. The resulting debiased estimators admit nearly precise nonasymptotic distributional characterizations, which in turn enable optimal construction of confidence intervals/regions for, say, the missing entries and the low-rank factors. Our inferential procedures do not require sample splitting, thus avoiding unnecessary loss of data efficiency. As a byproduct, we obtain a sharp characterization of the estimation accuracy of our debiased estimators in both rate and constant. Our debiased estimators are tractable algorithms that provably achieve full statistical efficiency.

Indexed as

AlgorithmsBiasConfidence IntervalsModels, StatisticalStatistics as TopicUncertaintyconfidence intervalsconvex relaxationnonconvex optimization

Identifiers

PMID31666329
PMCPMC6859358

What OpenQuestion holds

Textmetadata
LicenceCC BY-NC-ND
Read underepoch 390

Registered trials

None linked

Read under generation 80e0d062 · epoch 390. Bibliography from PubMed, PubMed Central and OpenAlex; grants from NIH RePORTER; trial links from ClinicalTrials.gov; estimates, votes and beliefs from the OpenQuestion graph.