Abstract
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 data set 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.
Original language | English (US) |
---|---|
Article number | 8425657 |
Pages (from-to) | 1380-1410 |
Number of pages | 31 |
Journal | Proceedings of the IEEE |
Volume | 106 |
Issue number | 8 |
DOIs | |
State | Published - Aug 2018 |
Bibliographical note
Publisher Copyright:© 1963-2012 IEEE.
Keywords
- Big data
- Dimension reduction
- Nonconvex optimization
- Recovery guarantees
- Robustness
- Subspace modeling
- Unsupervised learning