Uniform recovery guarantees for quantized corrupted sensing using structured or generative priors

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Ill-posedness and regularization problems in numerical linear algebra (65F22)

Cites Work

Robust Lasso With Missing and Grossly Corrupted Observations
A unified framework for high-dimensional analysis of $M$-estimators with decomposable regularizers
Robust principal component analysis?
High-Dimensional Probability
Concentration inequalities. A nonasymptotic theory of independence
1-Bit matrix completion
Tight Oracle Inequalities for Low-Rank Matrix Recovery From a Minimal Number of Noisy Random Measurements
Restricted strong convexity and weighted matrix completion: Optimal bounds with noise
A simple proof of the restricted isometry property for random matrices
Convex regularization for high-dimensional multiresponse tensor regression
A Max-Norm Constrained Minimization Approach to 1-Bit Matrix Completion
Rank-Sparsity Incoherence for Matrix Decomposition
Robust uncertainty principles: exact signal reconstruction from highly incomplete frequency information
Solving Inverse Problems With Piecewise Linear Estimators: From Gaussian Mixture Models to Structured Sparsity
Compressed sensing
The Generalized Lasso With Non-Linear Observations
Dimensionality reduction with subgaussian matrices: a unified theory
Compressed sensing and matrix completion with constant proportion of corruptions
One-bit compressed sensing by linear programming
Robust 1-Bit Compressive Sensing via Binary Stable Embeddings of Sparse Vectors
Quantization
Upper bounds on product and multiplier empirical processes
Corrupted Sensing: Novel Guarantees for Separating Structured Signals
Exact Recoverability From Dense Corrupted Observations via $\ell _{1}$-Minimization
Sharp recovery bounds for convex demixing, with applications
A unified approach to uniform signal recovery from nonlinear observations
Dithered quantizers
A Simple Tool for Bounding the Deviation of Random Matrices on Geometric Sets
Robust 1-bit Compressed Sensing and Sparse Logistic Regression: A Convex Programming Approach
Weighted nuclear norm minimization and its applications to low level vision
High-dimensional estimation with geometric constraints: Table 1.
Proof methods for robust low-rank matrix recovery
Non-Gaussian hyperplane tessellations and robust one-bit compressed sensing
High-Dimensional Estimation of Structured Signals From Non-Linear Observations With General Convex Loss Functions
<scp>Sub‐Gaussian</scp> Matrices on Sets: Optimal Tail Dependence and Applications
Outlier-Robust PCA: The High-Dimensional Case
Quantization and Compressive Sensing
Quantized Compressed Sensing: A Survey
Quantized compressive sensing with RIP matrices: the benefit of dithering
Covariance estimation under one-bit quantization
Quantized Compressed Sensing by Rectified Linear Units
The Generalized Lasso for Sub-Gaussian Measurements With Dithered Quantization
Stable Recovery of Structured Signals From Corrupted Sub-Gaussian Measurements
High dimensional statistical estimation under uniformly dithered one-bit quantization
Uniform exact reconstruction of sparse signals and low-rank matrices from phase-only measurements
Quantizing heavy-tailed data in statistical estimation: (near) minimax rates, covariate quantization, and uniform recovery
Tuning-free one-bit covariance estimation using data-driven dithering
Quantized corrupted sensing with random dithering
Quantized low-rank multivariate regression with random dithering

This page was built for publication: Uniform recovery guarantees for quantized corrupted sensing using structured or generative priors

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6623969)