One-bit compressed sensing with non-Gaussian measurements

DOI10.1016/J.LAA.2013.04.002zbMath1332.94041arXiv1208.6279OpenAlexW2068693086MaRDI QIDQ2437341

Albert Ai, Alex Lapanowski, Yaniv Plan, R. V. Vershinin

Publication date: 3 March 2014

Published in: Linear Algebra and its Applications (Search for Journal in Brave)

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

zbMATH Keywords

convex programmingquantizationsignal reconstructionone-bit compressed sensing

Mathematics Subject Classification ID

Estimation in multivariate analysis (62H12) Geometric probability and stochastic geometry (60D05) Convex programming (90C25) Applications of mathematical programming (90C90) Signal theory (characterization, reconstruction, filtering, etc.) (94A12) Sampling theory in information and communication theory (94A20)

Related Items (26)

Sigma delta quantization with harmonic frames and partial Fourier ensembles ⋮ Robust Decoding from 1-Bit Compressive Sampling with Ordinary and Regularized Least Squares ⋮ Quantization and Compressive Sensing ⋮ 1-bit compressive sensing: reformulation and RRSP-based sign recovery theory ⋮ Phase retrieval by binary questions: which complementary subspace is closer? ⋮ Convergence guarantee for the sparse monotone single index model ⋮ Generalizing CoSaMP to signals from a union of low dimensional linear subspaces ⋮ Generic error bounds for the generalized Lasso with sub-exponential data ⋮ Fast and Reliable Parameter Estimation from Nonlinear Observations ⋮ A theory of capacity and sparse neural encoding ⋮ A unified approach to uniform signal recovery from nonlinear observations ⋮ Robust one-bit compressed sensing with partial circulant matrices ⋮ Sparse recovery from saturated measurements ⋮ High-dimensional estimation with geometric constraints: Table 1. ⋮ Quantized Compressed Sensing: A Survey ⋮ Applied harmonic analysis and data processing. Abstracts from the workshop held March 25--31, 2018 ⋮ Finite sample performance of linear least squares estimation ⋮ The landscape of empirical risk for nonconvex losses ⋮ On recovery guarantees for one-bit compressed sensing on manifolds ⋮ Estimation in High Dimensions: A Geometric Perspective ⋮ Non-Gaussian hyperplane tessellations and robust one-bit compressed sensing ⋮ High-dimensional index volatility models via Stein's identity ⋮ Memoryless scalar quantization for random frames ⋮ One-bit compressed sensing via ℓ _p (0 < p < 1)-minimization method ⋮ Unnamed Item ⋮ AdaBoost and robust one-bit compressed sensing

Cites Work

• Random matrices: The distribution of the smallest singular values
• One-Bit Compressed Sensing by Linear Programming
• 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
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: One-bit compressed sensing with non-Gaussian measurements