Robust one-bit compressed sensing with partial circulant matrices

DOI10.1214/22-AAP1855MaRDI QIDQ6104014zbMATH OpenOpenAlexFDO

Authors Sjoerd Dirksen, Shahar Mendelson

Publication date 5 June 2023

Published in The Annals of Applied Probability (Search for Journal in Brave)

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

zbMATH Keywords

empirical processescompressed sensingquantizationgeneric chainingrandom circulant matrices

Mathematics Subject Classification ID

Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Geometric probability and stochastic geometry (60D05) Sampling theory in information and communication theory (94A20)

Abstract: We present optimal sample complexity estimates for one-bit compressed sensing problems in a realistic scenario: the procedure uses a structured matrix (a randomly sub-sampled circulant matrix) and is robust to analog pre-quantization noise as well as to adversarial bit corruptions in the quantization process. Our results imply that quantization is not a statistically expensive procedure in the presence of nontrivial analog noise: recovery requires the same sample size one would have needed had the measurement matrix been Gaussian and the noisy analog measurements been given as data.

Recommendations

• One-bit compressed sensing with partial Gaussian circulant matrices
• Quantized compressed sensing for random circulant matrices
• Quantization of compressive samples with stable and robust recovery
• One-bit compressed sensing with non-Gaussian measurements
• One-bit compressed sensing by linear programming

Cites work

• scientific article; zbMATH DE number 49190 (Why is no real title available?)
• A mathematical introduction to compressive sensing
• Capacity Analysis of One-Bit Quantized MIMO Systems With Transmitter Channel State Information
• Compressive sensing by random convolution
• Fast binary embeddings and quantized compressed sensing with structured matrices
• Flavors of compressive sensing
• Improved bounds for sparse recovery from subsampled random convolutions
• Inequalities of Bernstein-Jackson-type and the degree of compactness of operators in Banach spaces
• Non-Gaussian hyperplane tessellations and robust one-bit compressed sensing
• One-bit compressed sensing by linear programming
• One-bit compressed sensing with non-Gaussian measurements
• One-bit compressed sensing with partial Gaussian circulant matrices
• Quantized compressed sensing for random circulant matrices
• Quantized compressed sensing: a survey
• Quantized compressive sensing with RIP matrices: the benefit of dithering
• Recovering low-rank matrices from binary measurements
• Robust 1-bit Compressed Sensing and Sparse Logistic Regression: A Convex Programming Approach
• Some limit theorems for empirical processes (with discussion)
• \(5n\) Minkowski symmetrizations suffice to arrive at an approximate Euclidean ball
• ``Local vs. ``global parameters -- breaking the Gaussian complexity barrier

Cited in

(5)

• Fast Metric Embedding into the Hamming Cube
• Quantized compressed sensing for random circulant matrices
• A unified approach to uniform signal recovery from nonlinear observations
• Robust Decoding from 1-Bit Compressive Sampling with Ordinary and Regularized Least Squares
• One-bit compressed sensing with partial Gaussian circulant matrices

This page was built for publication: Robust one-bit compressed sensing with partial circulant matrices

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