Evidence map›Paper›PMID 36148268›Full record

ArticleAnnals of statistics2021

BRIDGING CONVEX AND NONCONVEX OPTIMIZATION IN ROBUST PCA: NOISE, OUTLIERS, AND MISSING DATA.

Yuxin Chen, Jianqing Fan, Cong Ma, Yuling Yan

Abstract read
In one paragraph

Article in Annals of statistics, 2021. The graph could read no effect estimate from its abstract, so it casts no vote on the map. Cited by 6 papers.

0numbers the graph read from it
0cells of the map it votes in
6citing 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

6 citing papers in PubMed.

  1. Article
  2. Article
  3. Article
  4. GNMR: A Provable One-Line Algorithm for Low Rank Matrix Recovery.SIAM journal on mathematics of data science · 2022
    Article
  5. Article
  6. 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 and Computer Engineering, Princeton University, Princeton, NJ 08544.
Jianqing FanDepartment of Operations Research and Fin Eng, Princeton University, Princeton, NJ 08544.
Cong MaDepartment of Electrical Engineering and Computer Science, University of California, Berkeley, Berkeley, CA 94720.
Yuling YanDepartment of Operations Research and Fin Eng, 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

This paper delivers improved theoretical guarantees for the convex programming approach in low-rank matrix estimation, in the presence of (1) random noise, (2) gross sparse outliers, and (3) missing data. This problem, often dubbed as

Indexed as

convex relaxationleave-one-out analysisℓ∞ guaranteesPrimary 62F10robust principal component analysissecondary 62B10

Identifiers

PMID36148268
PMCPMC9491514

What OpenQuestion holds

Textmetadata
LicenceTDM
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.