Fast recovery from a union of subspaces
© 2016 NIPS Foundation - All Rights Reserved. We address the problem of recovering a high-dimensional but structured vector from linear observations in a general setting where the vector can come from an arbitrary union of subspaces. This setup includes well-studied problems such as compressive sens...
Main Authors: | Hegde, Chinmay (Author), Indyk, Piotr (Author), Schmidt, Ludwig (Author) |
---|---|
Other Authors: | Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science (Contributor), Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory (Contributor) |
Format: | Article |
Language: | English |
Published: |
Curran Associates Inc.,
2021-12-16T17:25:58Z.
|
Subjects: | |
Online Access: | Get fulltext |
Similar Items
-
Fast recovery from a union of subspaces
by: Indyk, Piotr, et al.
Published: (2021) -
Approximation Algorithms for Model-Based Compressive Sensing
by: Hegde, Chinmay, et al.
Published: (2018) -
Approximation-tolerant model-based compressive sensing
by: Hegde, Chinmay, et al.
Published: (2018) -
Nearly Linear-Time Model-Based Compressive Sensing
by: Hegde, Chinmay, et al.
Published: (2018) -
Almost-Euclidean Subspaces of ℓ1N via Tensor Products: A Simple Approach to Randomness Reduction
by: Indyk, Piotr, et al.
Published: (2012)