paper-with-me

Papers

An Overview of Robust Subspace Recovery

2018-03-02 · Gilad Lerman, Tyler Maunu

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 emphasizes advantages and disadvantages of proposed approaches and unsolved problems in the area.

📄 PDF Abstract BibTeX arXiv:1803.01013

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Finding the Sparsest Vectors in a Subspace: Theory, Algorithms, and Applications

2020-01-20 · Qing Qu, Zhihui Zhu, Xiao Li, Manolis C. Tsakiris 외

The problem of finding the sparsest vector (direction) in a low dimensional subspace can be considered as a homogeneous variant of the sparse recovery problem, which finds applications in robust subspace recovery, dictio…

Dictionary LearningRepresentation Learning

Robust Subspace Learning: Robust PCA, Robust Subspace Tracking, and Robust Subspace Recovery

2017-11-26 · Namrata Vaswani, Thierry Bouwmans, Sajid Javed, Praneeth Narayanamurthy

PCA is one of the most widely used dimension reduction techniques. A related easier problem is "subspace learning" or "subspace estimation". Given relatively clean data, both are easily solved via singular value decompos…

Dimensionality Reduction

Robust subspace recovery by Tyler's M-estimator

2012-06-07 · Teng Zhang

This paper considers the problem of robust subspace recovery: given a set of $N$ points in $\mathbb{R}^D$, if many lie in a $d$-dimensional subspace, then can we recover the underlying subspace? We show that Tyler's M-es…

Position

Basis Pursuit and Orthogonal Matching Pursuit for Subspace-preserving Recovery: Theoretical Analysis

2019-12-30 · Daniel P. Robinson, Rene Vidal, Chong You

Given an overcomplete dictionary $A$ and a signal $b = Ac^*$ for some sparse vector $c^*$ whose nonzero entries correspond to linearly independent columns of $A$, classical sparse signal recovery theory considers the pro…

Homomorphic Sensing of Subspace Arrangements

2020-06-09 · Liangzu Peng, Manolis C. Tsakiris

Homomorphic sensing is a recent algebraic-geometric framework that studies the unique recovery of points in a linear subspace from their images under a given collection of linear maps. It has been successful in interpret…

Missing ValuesRetrieval