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

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

Cites Work

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