Endogenous Sparse Recovery

• Other Authors: Baraniuk, Richard G.
• Format: Others
• Language: English
• Published: 2013
• Subjects: Applied sciences; Applied Mathematics; Electrical engineering
• Online Access: http://hdl.handle.net/1911/70235

Sparsity has proven to be an essential ingredient in the development of efficient solutions to a number of problems in signal processing and machine learning. In all of these settings, sparse recovery methods are employed to recover signals that admit sparse representations in a pre-specified basis. Recently, sparse recovery methods have been employed in an entirely new way; instead of finding a sparse representation of a signal in a fixed basis, a sparse representation is formed "from within" the data. In this thesis, we study the utility of this endogenous sparse recovery procedure for learning unions of subspaces from collections of high-dimensional data. We provide new insights into the behavior of endogenous sparse recovery, develop sufficient conditions that describe when greedy methods will reveal local estimates of the subspaces in the ensemble, and introduce new methods to learn unions of overlapping subspaces from local subspace estimates.