DeepAI AI Chat
Log In Sign Up

Best Pair Formulation & Accelerated Scheme for Non-convex Principal Component Pursuit

by   Aritra Dutta, et al.

The best pair problem aims to find a pair of points that minimize the distance between two disjoint sets. In this paper, we formulate the classical robust principal component analysis (RPCA) as the best pair; which was not considered before. We design an accelerated proximal gradient scheme to solve it, for which we show global convergence, as well as the local linear rate. Our extensive numerical experiments on both real and synthetic data suggest that the algorithm outperforms relevant baseline algorithms in the literature.


page 6

page 8

page 9

page 14

page 16


A robust approach for principal component analyisis

In this paper we analyze different ways of performing principal componen...

Deep Unrolling for Nonconvex Robust Principal Component Analysis

We design algorithms for Robust Principal Component Analysis (RPCA) whic...

Informed Non-convex Robust Principal Component Analysis with Features

We revisit the problem of robust principal component analysis with featu...

Complex and Quaternionic Principal Component Pursuit and Its Application to Audio Separation

Recently, the principal component pursuit has received increasing attent...

Hyperplane Clustering Via Dual Principal Component Pursuit

We extend the theoretical analysis of a recently proposed single subspac...

Tracking the national and regional COVID-19 epidemic status in the UK using directed Principal Component Analysis

One of the difficulties in monitoring an ongoing pandemic is deciding on...