AI Chat AI Image Generator AI Video Text to Speech

An Overview of Robust Subspace Recovery

03/02/2018

∙

by Gilad Lerman, et al.

∙

∙

This paper will serve as an introduction to the body of work on robust subspace recovery. Robust subspace recovery involves finding an underlying low-dimensional subspace in a dataset that is possibly corrupted with outliers. While this problem is easy to state, it has been difficult to develop optimal algorithms due to its underlying nonconvexity. This work will emphasize advantages and disadvantages of proposed approaches and unsolved problems in the area.

Gilad Lerman
42 publications
Tyler Maunu
12 publications

page 1

page 2

page 3

page 4

research

∙ 11/30/2017

RANSAC Algorithms for Subspace Recovery and Subspace Clustering

We consider the RANSAC algorithm in the context of subspace recovery and...

0 Ery Arias-Castro, et al. ∙

research

∙ 03/05/2020

Simultaneous robust subspace recovery and semi-stability of quiver representations

We consider the problem of simultaneously finding lower-dimensional subs...

0 Calin Chindris, et al. ∙

research

∙ 03/30/2019

Robust Subspace Recovery Layer for Unsupervised Anomaly Detection

We propose a neural network for unsupervised anomaly detection with a no...

0 Chieh-Hsin Lai, et al. ∙

research

∙ 06/24/2014

Fast, Robust and Non-convex Subspace Recovery

This work presents a fast and non-convex algorithm for robust subspace r...

0 Gilad Lerman, et al. ∙

research

∙ 05/25/2017

Distributed Robust Subspace Recovery

We study Robust Subspace Recovery (RSR) in distributed settings. We cons...

0 Vahan Huroyan, et al. ∙

research

∙ 04/05/2019

Robust Subspace Recovery with Adversarial Outliers

We study the problem of robust subspace recovery (RSR) in the presence o...

0 Tyler Maunu, et al. ∙

research

∙ 02/07/2020

List Decodable Subspace Recovery

Learning from data in the presence of outliers is a fundamental problem ...

0 Prasad Raghavendra, et al. ∙