An approach to one-bit compressed sensing based on probably approximately correct learning theory

MaRDI QIDQ4633018zbMATH OpenFDO

Authors M. E. Ahsen, M. Vidyasagar

Publication date 2 May 2019

Full work available at URL https://arxiv.org/abs/1710.07973, http://jmlr.csail.mit.edu/papers/v20/17-504.html

zbMATH Keywords

noisy labelsPAC learningsparse vectors

Mathematics Subject Classification ID

Statistical aspects of information-theoretic topics (62B10) Estimation in multivariate analysis (62H12) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)

Recommendations

• One-bit compressed sensing by linear programming
• Statistical mechanics approach to 1-bit compressed sensing
• One-bit compressive sensing of dictionary-sparse signals
• One-bit compressed sensing via \(\ell_p\) \((0<p<1)\)-minimization method
• Noisy 1-bit compressive sensing: models and algorithms

Cites work

• A general lower bound on the number of examples needed for learning
• A locality-sensitive hash for real vectors
• A mathematical introduction to compressive sensing
• A note on uniform laws of averages for dependent processes
• A theory of the learnable
• A unified framework for high-dimensional analysis of M-estimators with decomposable regularizers
• An approach to one-bit compressed sensing based on probably approximately correct learning theory
• Central limit theorems for empirical measures
• Compressed sensing
• CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
• Decoding by Linear Programming
• For most large underdetermined systems of linear equations the minimal 𝓁₁‐norm solution is also the sparsest solution
• General bounds on the number of examples needed for learning probabilistic concepts
• scientific article; zbMATH DE number 193511 (Why is no real title available?)
• scientific article; zbMATH DE number 1322222 (Why is no real title available?)
• scientific article; zbMATH DE number 1332320 (Why is no real title available?)
• scientific article; zbMATH DE number 6982911 (Why is no real title available?)
• scientific article; zbMATH DE number 6438182 (Why is no real title available?)
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• Learnability and the Vapnik-Chervonenkis dimension
• Neural Network Learning
• On the density of families of sets
• One-bit compressed sensing by linear programming
• One-bit compressed sensing with non-Gaussian measurements
• One-Bit Compressive Sensing With Norm Estimation
• Rates of uniform convergence of empirical means with mixing processes
• Robust 1-bit Compressed Sensing and Sparse Logistic Regression: A Convex Programming Approach
• Robust 1-Bit Compressive Sensing via Binary Stable Embeddings of Sparse Vectors
• Sparse and redundant representations. From theory to applications in signal and image processing.
• Sparse Approximate Solutions to Linear Systems
• Sparse modeling. Theory, algorithms, and applications
• Stable signal recovery from incomplete and inaccurate measurements

Cited in

(5)

• AdaBoost and robust one-bit compressed sensing
• An approach to one-bit compressed sensing based on probably approximately correct learning theory
• Just least squares: binary compressive sampling with low generative intrinsic dimension
• Robust subgaussian estimation with VC-dimension
• Robust decoding from binary measurements with cardinality constraint least squares

This page was built for publication: An approach to one-bit compressed sensing based on probably approximately correct learning theory

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