Minimum complexity pursuit: Stability analysis

Shirin Jalali; Arian Maleki; Richard Baraniuk

doi:10.1109/ISIT.2012.6283602

Minimum complexity pursuit: Stability analysis

Shirin Jalali, Arian Maleki, Richard Baraniuk

Houston Methodist

Research output: Chapter in Book/Report/Conference proceeding › Conference contribution

4 Scopus citations

Abstract

A host of problems involve the recovery of structured signals from a dimensionality reduced representation such as a random projection; examples include sparse signals (compressive sensing) and low-rank matrices (matrix completion). Given the wide range of different recovery algorithms developed to date, it is natural to ask whether there exist "universal" algorithms for recovering "structured" signals from their linear projections. We recently answered this question in the affirmative in the noise-free setting. In this paper, we extend our results to the case of noisy measurements.

Original language	English (US)
Title of host publication	2012 IEEE International Symposium on Information Theory Proceedings, ISIT 2012
Pages	1857-1861
Number of pages	5
DOIs	https://doi.org/10.1109/ISIT.2012.6283602
State	Published - 2012
Event	2012 IEEE International Symposium on Information Theory, ISIT 2012 - Cambridge, MA, United States Duration: Jul 1 2012 → Jul 6 2012

Publication series

Name	IEEE International Symposium on Information Theory - Proceedings

Other

Other	2012 IEEE International Symposium on Information Theory, ISIT 2012
Country/Territory	United States
City	Cambridge, MA
Period	7/1/12 → 7/6/12

ASJC Scopus subject areas

Theoretical Computer Science
Information Systems
Modeling and Simulation
Applied Mathematics

Access to Document

10.1109/ISIT.2012.6283602

Cite this

Jalali, S, Maleki, A & Baraniuk, R 2012, Minimum complexity pursuit: Stability analysis. in 2012 IEEE International Symposium on Information Theory Proceedings, ISIT 2012., 6283602, IEEE International Symposium on Information Theory - Proceedings, pp. 1857-1861, 2012 IEEE International Symposium on Information Theory, ISIT 2012, Cambridge, MA, United States, 7/1/12. https://doi.org/10.1109/ISIT.2012.6283602

@inproceedings{781e63f00be44aabaaa6dfe89bb9a991,

title = "Minimum complexity pursuit: Stability analysis",

abstract = "A host of problems involve the recovery of structured signals from a dimensionality reduced representation such as a random projection; examples include sparse signals (compressive sensing) and low-rank matrices (matrix completion). Given the wide range of different recovery algorithms developed to date, it is natural to ask whether there exist {"}universal{"} algorithms for recovering {"}structured{"} signals from their linear projections. We recently answered this question in the affirmative in the noise-free setting. In this paper, we extend our results to the case of noisy measurements.",

author = "Shirin Jalali and Arian Maleki and Richard Baraniuk",

year = "2012",

doi = "10.1109/ISIT.2012.6283602",

language = "English (US)",

isbn = "9781467325790",

series = "IEEE International Symposium on Information Theory - Proceedings",

pages = "1857--1861",

booktitle = "2012 IEEE International Symposium on Information Theory Proceedings, ISIT 2012",

note = "2012 IEEE International Symposium on Information Theory, ISIT 2012 ; Conference date: 01-07-2012 Through 06-07-2012",

}

TY - GEN

T1 - Minimum complexity pursuit

T2 - 2012 IEEE International Symposium on Information Theory, ISIT 2012

AU - Jalali, Shirin

AU - Maleki, Arian

AU - Baraniuk, Richard

PY - 2012

Y1 - 2012

N2 - A host of problems involve the recovery of structured signals from a dimensionality reduced representation such as a random projection; examples include sparse signals (compressive sensing) and low-rank matrices (matrix completion). Given the wide range of different recovery algorithms developed to date, it is natural to ask whether there exist "universal" algorithms for recovering "structured" signals from their linear projections. We recently answered this question in the affirmative in the noise-free setting. In this paper, we extend our results to the case of noisy measurements.

AB - A host of problems involve the recovery of structured signals from a dimensionality reduced representation such as a random projection; examples include sparse signals (compressive sensing) and low-rank matrices (matrix completion). Given the wide range of different recovery algorithms developed to date, it is natural to ask whether there exist "universal" algorithms for recovering "structured" signals from their linear projections. We recently answered this question in the affirmative in the noise-free setting. In this paper, we extend our results to the case of noisy measurements.

UR - http://www.scopus.com/inward/record.url?scp=84867548409&partnerID=8YFLogxK

UR - http://www.scopus.com/inward/citedby.url?scp=84867548409&partnerID=8YFLogxK

U2 - 10.1109/ISIT.2012.6283602

DO - 10.1109/ISIT.2012.6283602

M3 - Conference contribution

AN - SCOPUS:84867548409

SN - 9781467325790

T3 - IEEE International Symposium on Information Theory - Proceedings

SP - 1857

EP - 1861

BT - 2012 IEEE International Symposium on Information Theory Proceedings, ISIT 2012

Y2 - 1 July 2012 through 6 July 2012

ER -

Minimum complexity pursuit: Stability analysis

Abstract

Publication series

Other

ASJC Scopus subject areas

Access to Document

Other files and links

Fingerprint

Cite this