Simple Bounds for Recovering Low-complexity Models

Emmanuel J. Candès, Benjamin Recht

Type: Preprint

Publication Date: 2011-01-01

Citations: 0

DOI: https://doi.org/10.48550/arxiv.1106.1474

View Publication

Locations

arXiv (Cornell University) - View - PDF
CiteSeer X (The Pennsylvania State University) - View - PDF
DataCite API - View

Similar Works

Action	Title	Year	Authors
+	Simple Bounds for Recovering Low-complexity Models	2011	Emmanuel J. Candès Benjamin Recht
+ PDF Chat	Simple bounds for recovering low-complexity models	2012	Emmanuel J. Candès Benjamin Recht
+	Convex block-sparse linear regression with expanders -- provably	2016	Anastasios Kyrillidis Bubacarr Bah Rouzbeh Hasheminezhad Quoc Tran-Dinh Luca Baldassarre Volkan Cevher
+	Robust Recovery of Low-Rank Matrices with Non-Orthogonal Sparse Decomposition from Incomplete Measurements	2018	Massimo Fornasier Johannes Maly Valeriya Naumova
+	Robust Recovery of Low-Rank Matrices with Non-Orthogonal Sparse Decomposition from Incomplete Measurements	2018	Massimo Fornasier Johannes Maly Valeriya Naumova
+	Compressed sensing of low-rank plus sparse matrices	2020	Jared Tanner Simon Vary
+	Tight oracle bounds for low-rank matrix recovery from a minimal number of random measurements	2010	Emmanuel J. Candès Yaniv Plan
+ PDF Chat	Sparse Signal Recovery from Quadratic Measurements via Convex Programming	2013	Xiaodong Li Vladislav Voroninski
+	Guaranteed Sparse Recovery under Linear Transformation	2013	Ji Liu Lei Yuan Jieping Ye
+	Sparse Signal Recovery from Quadratic Measurements via Convex Programming	2012	Xiaodong Li Vladislav Voroninski
+	Improved bounds for sparse recovery from subsampled random convolutions	2016	Shahar Mendelson Holger Rauhut Rachel Ward
+	Improved bounds for sparse recovery from subsampled random convolutions	2016	Shahar Mendelson Holger Rauhut Rachel Ward
+ PDF Chat	Low-Rank Matrix Estimation from Rank-One Projections by Unlifted Convex Optimization	2021	Sohail Bahmani Kiryung Lee
+	Low-Rank Matrix Estimation From Rank-One Projections by Unlifted Convex Optimization	2020	Sohail Bahmani Kiryung Lee
+	Low-Rank Matrix Estimation From Rank-One Projections by Unlifted Convex Optimization	2020	Sohail Bahmani Kiryung Lee
+	Universality in Learning from Linear Measurements	2019	Ehsan Abbasi Fariborz Salehi Babak Hassibi
+ PDF Chat	Improved bounds for sparse recovery from subsampled random convolutions	2018	Shahar Mendelson Holger Rauhut Rachel Ward
+	Optimal Sample Complexity for Stable Matrix Recovery	2017	Yanjun Li Kiryung Lee Yoram Bresler
+	Optimal Sample Complexity for Stable Matrix Recovery	2016	Yanjun Li Kiryung Lee Yoram Bresler
+	Information-theoretic limits on sparse signal recovery: Dense versus sparse measurement matrices	2008	Wei Wang Martin J. Wainwright Kannan Ramchandran

Works That Cite This (0)

Action	Title	Year	Authors

Works Cited by This (0)

Action	Title	Year	Authors