Nearly-optimal Robust Matrix Completion

23 June 2016

Papers citing "Nearly-optimal Robust Matrix Completion"

14 / 14 papers shown

Title
AltGDmin: Alternating GD and Minimization for Partly-Decoupled (Federated) Optimization Namrata Vaswani 37 0 0 20 Apr 2025
Leave-One-Out Analysis for Nonconvex Robust Matrix Completion with General Thresholding Functions Tianming Wang Ke Wei 33 1 0 28 Jul 2024
Learned Robust PCA: A Scalable Deep Unfolding Approach for High-Dimensional Outlier Detection HanQin Cai Jialin Liu W. Yin 33 39 0 11 Oct 2021
GNMR: A provable one-line algorithm for low rank matrix recovery Pini Zilber B. Nadler 48 13 0 24 Jun 2021
Generalized Low-rank plus Sparse Tensor Estimation by Fast Riemannian Optimization Jian-Feng Cai Jingyang Li Dong Xia 49 30 0 16 Mar 2021
Spectral Methods for Data Science: A Statistical Perspective Yuxin Chen Yuejie Chi Jianqing Fan Cong Ma 40 165 0 15 Dec 2020
Fast Robust Subspace Tracking via PCA in Sparse Data-Dependent Noise Praneeth Narayanamurthy Namrata Vaswani 24 10 0 14 Jun 2020
A Nonconvex Projection Method for Robust PCA Aritra Dutta Filip Hanzely Peter Richtárik 14 24 0 21 May 2018
Non-convex Optimization for Machine Learning Prateek Jain Purushottam Kar 33 478 0 21 Dec 2017
On Deterministic Sampling Patterns for Robust Low-Rank Matrix Completion Morteza Ashraphijuo Vaneet Aggarwal Xiaodong Wang 25 19 0 05 Dec 2017
Robust Subspace Learning: Robust PCA, Robust Subspace Tracking, and Robust Subspace Recovery Namrata Vaswani T. Bouwmans S. Javed Praneeth Narayanamurthy OOD 32 273 0 26 Nov 2017
Thresholding based Efficient Outlier Robust PCA Yeshwanth Cherapanamjeri Prateek Jain Praneeth Netrapalli 22 15 0 18 Feb 2017
PCA in Data-Dependent Noise (Correlated-PCA): Nearly Optimal Finite Sample Guarantees Namrata Vaswani Praneeth Narayanamurthy 29 2 0 10 Feb 2017
Fast Algorithms for Robust PCA via Gradient Descent Xinyang Yi Dohyung Park Yudong Chen C. Caramanis 16 264 0 25 May 2016