Bridging Convex and Nonconvex Optimization in Robust PCA: Noise, Outliers, and Missing Data

15 January 2020

Papers citing "Bridging Convex and Nonconvex Optimization in Robust PCA: Noise, Outliers, and Missing Data"

10 / 10 papers shown

Title
Alternating minimization for square root principal component pursuit Shengxiang Deng Xudong Li Yangjing Zhang 37 0 0 31 Dec 2024
Leave-One-Out Analysis for Nonconvex Robust Matrix Completion with General Thresholding Functions Tianming Wang Ke Wei 33 0 0 28 Jul 2024
Provably Accelerating Ill-Conditioned Low-rank Estimation via Scaled Gradient Descent, Even with Overparameterization Cong Ma Xingyu Xu Tian Tong Yuejie Chi 16 9 0 09 Oct 2023
Deflated HeteroPCA: Overcoming the curse of ill-conditioning in heteroskedastic PCA Yuchen Zhou Yuxin Chen 38 4 0 10 Mar 2023
Optimal tuning-free convex relaxation for noisy matrix completion Yuepeng Yang Cong Ma 24 8 0 12 Jul 2022
Robust Matrix Completion with Heavy-tailed Noise Bingyan Wang Jianqing Fan 21 3 0 09 Jun 2022
GNMR: A provable one-line algorithm for low rank matrix recovery Pini Zilber B. Nadler 40 13 0 24 Jun 2021
Generalized Low-rank plus Sparse Tensor Estimation by Fast Riemannian Optimization Jian-Feng Cai Jingyang Li Dong Xia 30 30 0 16 Mar 2021
Accelerating Ill-Conditioned Low-Rank Matrix Estimation via Scaled Gradient Descent Tian Tong Cong Ma Yuejie Chi 14 113 0 18 May 2020
The Projected Power Method: An Efficient Algorithm for Joint Alignment from Pairwise Differences Yuxin Chen Emmanuel Candes 32 92 0 19 Sep 2016