Pages that link to "Item:Q5281264"

The following pages link to Information Theoretic Bounds for Compressed Sensing (Q5281264):

Displaying 18 items.

• Sparse microwave imaging: principles and applications (Q362310) (← links)
• Sharp support recovery from noisy random measurements by \(\ell_1\)-minimization (Q427066) (← links)
• Rigorous restricted isometry property of low-dimensional subspaces (Q778034) (← links)
• A strong converse bound for multiple hypothesis testing, with applications to high-dimensional estimation (Q1746556) (← links)
• The all-or-nothing phenomenon in sparse linear regression (Q2078961) (← links)
• Iterative algorithm for discrete structure recovery (Q2131266) (← links)
• Adaptive multi-penalty regularization based on a generalized Lasso path (Q2175012) (← links)
• Which bridge estimator is the best for variable selection? (Q2215760) (← links)
• Fano's inequality for random variables (Q2218038) (← links)
• Non-uniform recovery guarantees for binary measurements and infinite-dimensional compressed sensing (Q2658730) (← links)
• Compressed Sensing with Side Information on the Feasible Region (Q2840908) (← links)
• Compressed Sensing Performance Bounds Under Poisson Noise (Q4570422) (← links)
• Asymptotic Achievability of the CramÉr–Rao Bound for Noisy Compressive Sampling (Q4571618) (← links)
• Information-Theoretic Limits on Sparsity Recovery in the High-Dimensional and Noisy Setting (Q4974108) (← links)
• Computational approaches to non-convex, sparsity-inducing multi-penalty regularization (Q4989924) (← links)
• Rényi Information Dimension: Fundamental Limits of Almost Lossless Analog Compression (Q5281336) (← links)
• Information-Theoretic Limits on Sparse Signal Recovery: Dense versus Sparse Measurement Matrices (Q5281472) (← links)
• Numerical characterization of support recovery in sparse regression with correlated design (Q6558520) (← links)