A Nonconvex Projection Method for Robust PCA

21 May 2018

Papers citing "A Nonconvex Projection Method for Robust PCA"

8 / 8 papers shown

Title
Towards a Better Theoretical Understanding of Independent Subnetwork Training Egor Shulgin Peter Richtárik AI4CE 28 6 0 28 Jun 2023
Inductive Matrix Completion: No Bad Local Minima and a Fast Algorithm Pini Zilber B. Nadler 21 8 0 31 Jan 2022
AgFlow: Fast Model Selection of Penalized PCA via Implicit Regularization Effects of Gradient Flow Haiyan Jiang Haoyi Xiong Dongrui Wu Ji Liu Dejing Dou 13 1 0 07 Oct 2021
Optimization for Supervised Machine Learning: Randomized Algorithms for Data and Parameters Filip Hanzely 32 0 0 26 Aug 2020
Robust Low-rank Matrix Completion via an Alternating Manifold Proximal Gradient Continuation Method Minhui Huang Shiqian Ma Lifeng Lai 14 26 0 18 Aug 2020
Solving the Robust Matrix Completion Problem via a System of Nonlinear Equations Yunfeng Cai P. Li 16 5 0 24 Mar 2020
Best Pair Formulation & Accelerated Scheme for Non-convex Principal Component Pursuit Aritra Dutta Filip Hanzely Jingwei Liang Peter Richtárik 14 10 0 25 May 2019
Online and Batch Supervised Background Estimation via L1 Regression Aritra Dutta Peter Richtárik 16 8 0 23 Nov 2017