Fundamental Performance Limits for Ideal Decoders in High-Dimensional Linear Inverse Problems

DOI10.1109/TIT.2014.2364403zbMath1359.94838arXiv1311.6239OpenAlexW2140089781MaRDI QIDQ2979183

Anthony Bourrier, Tomer Peleg, Rémi Gribonval, Patrick Pérez, Michael E. Davies

Publication date: 2 May 2017

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/1311.6239

Mathematics Subject Classification ID

Decoding (94B35)

Related Items (12)

The Quest for Optimal Sampling: Computationally Efficient, Structure-Exploiting Measurements for Compressed Sensing ⋮ Infinite-dimensional compressed sensing and function interpolation ⋮ Compressive statistical learning with random feature moments ⋮ Compressed sensing with local structure: uniform recovery guarantees for the sparsity in levels class ⋮ Learning with optimal interpolation norms ⋮ Performance bounds of the intensity-based estimators for noisy phase retrieval ⋮ BREAKING THE COHERENCE BARRIER: A NEW THEORY FOR COMPRESSED SENSING ⋮ Stable recovery of low-dimensional cones in Hilbert spaces: one RIP to rule them all ⋮ Generalized sampling and infinite-dimensional compressed sensing ⋮ The basins of attraction of the global minimizers of the non-convex sparse spike estimation problem ⋮ On the Absence of Uniform Recovery in Many Real-World Applications of Compressed Sensing and the Restricted Isometry Property and Nullspace Property in Levels ⋮ Multilinear Compressive Sensing and an Application to Convolutional Linear Networks

This page was built for publication: Fundamental Performance Limits for Ideal Decoders in High-Dimensional Linear Inverse Problems