Error Bounds for Consistent Reconstruction: Random Polytopes and Coverage Processes

Alexander M. Powell, J. Tyler Whitehouse

Type: Article

Publication Date: 2015-02-09

Citations: 11

DOI: https://doi.org/10.1007/s10208-015-9251-2

View Publication

Download PDF

Locations

Foundations of Computational Mathematics - View
arXiv (Cornell University) - View - PDF

Similar Works

Action	Title	Year	Authors
+	Error bounds for consistent reconstruction: random polytopes and coverage processes	2014	Alexander M. Powell J. Tyler Whitehouse
+	Error bounds for consistent reconstruction: random polytopes and coverage processes	2014	Alexander M. Powell J. Tyler Whitehouse
+ PDF Chat	Error Decay of (almost) Consistent Signal Estimations from Quantized Gaussian Random Projections	2016	Laurent Jacques
+	Error Decay of (almost) Consistent Signal Estimations from Quantized Gaussian Random Projections	2014	Laurent Jacques
+	Error Decay of (almost) Consistent Signal Estimations from Quantized Gaussian Random Projections	2014	Laurent Jacques
+	Error Decay of (almost) Consistent Signal Estimations from Quantized Random Gaussian Projections.	2014	Laurent Jacques
+	A Quotient Property for Matrices with Heavy-Tailed Entries and its Application to Noise-Blind Compressed Sensing	2018	Felix Krahmer Christian Kümmerle Holger Rauhut
+	Information-theoretic limits on sparse signal recovery: Dense versus sparse measurement matrices	2008	Wei Wang Martin J. Wainwright Kannan Ramchandran
+	High-dimensional subset recovery in noise: Sparsified measurements without loss of statistical efficiency	2008	Dapo Omidiran Martin J. Wainwright
+	Compressed Sensing and Matrix Completion with Constant Proportion of Corruptions	2011	Xiaodong Li
+ PDF Chat	Uniform recovery from subgaussian multi-sensor measurements	2018	Il Yong Chun Ben Adcock
+	A Sublinear Algorithm for Sparse Reconstruction with l2/l2 Recovery Guarantees	2008	Robert Calderbank Howard Caygill Sina Jafarpour
+	Large information plus noise random matrix models and consistent subspace estimation in large sensor networks	2011	Walid Hachem Philippe Loubaton Xavier Mestre Jamal Najım Pascal Vallet
+	Large information plus noise random matrix models and consistent subspace estimation in large sensor networks	2011	Walid Hachem Philippe Loubaton Xavier Mestre Jamal Najım Pascal Vallet
+ PDF Chat	Simple bounds for recovering low-complexity models	2012	Emmanuel J. Candès Benjamin Recht
+	Reconstruction and subgaussian operators	2005	Shahar Mendelson Alain Pajor Nicole Tomczak-Jaegermann
+	Phase Transitions for Support Recovery from Gaussian Linear Measurements	2021	Lekshmi Ramesh Chandra R. Murthy Himanshu Tyagi
+	Phase Transitions for Support Recovery from Gaussian Linear Measurements	2021	Lekshmi Ramesh C. Ravindra Murthy Himanshu Tyagi
+	An Estimation Theoretic Approach for Sparsity Pattern Recovery in the Noisy Setting	2009	Ali Hormati Amin Karbasi Soheil Mohajer Martin Vetterli
+ PDF Chat	Sparse recovery under weak moment assumptions	2017	Guillaume Lecué Shahar Mendelson

Works That Cite This (8)

Action	Title	Year	Authors
+ PDF Chat	Duality and geodesics for probabilistic frames	2017	Clare Wickman Kasso A. Okoudjou
+ PDF Chat	Quantization and Compressive Sensing	2015	Petros T. Boufounos Laurent Jacques Felix Krahmer Rayan Saab
+	Quantization and Finite Frames	2012	Alexander M. Powell Rayan Saab Özgür Yılmaz
+ PDF Chat	Bound and Conquer: Improving Triangulation by Enforcing Consistency	2019	Adam Scholefield Alireza Ghasemi Martin Vetterli
+ PDF Chat	Memoryless scalar quantization for random frames	2021	Kateryna Melnykova Özgür Yılmaz
+ PDF Chat	Error Decay of (almost) Consistent Signal Estimations from Quantized Gaussian Random Projections	2016	Laurent Jacques
+	Bound and Conquer: Improving Triangulation by Enforcing Consistency	2018	Adam Scholefield Alireza Ghasemi Martin Vetterli
+	Memoryless scalar quantization for random frames	2018	Kateryna Melnykova Özgür Yılmaz

Works Cited by This (18)

Action	Title	Year	Authors
+	Mean squared error bounds for the Rangan–Goyal soft thresholding algorithm	2009	Alexander M. Powell
+	Quantized Frame Expansions with Erasures	2001	Vivek K Goyal Jelena Kovačević Jonathan A. Kelner
+	Covering the circle with random arcs of random sizes	1982	Andrew F. Siegel Lars Holst
+	Deterministic and randomized polynomial‐time approximation of radii	2001	Andreas Brieden Peter Gritzmann Ravindran Kannan Victor Klee László Lovász Miklós Simonovits
+	A Course in Large Sample Theory	2017	Thomas S. Ferguson
+ PDF Chat	Random coverings in several dimensions	1986	Svante Janson
+	Recursive consistent estimation with bounded noise	2001	Sundeep Rangan Vivek K Goyal
+ PDF Chat	Oversampled A/D conversion and error-rate dependence of nonbandlimited signals with finite rate of innovation	2006	Ivana Jovanović Baltasar Beferull‐Lozano
+	On Simple Oversampled A/D Conversion in	2001	Zoran Cvetković Martin Vetterli
+	Limit theorems for uniform distributions on spheres in high-dimensional euclidean spaces	1982	A. J. Stam