scientific article; zbMATH DE number 7049730

zbMath1483.68273arXiv1710.07973MaRDI QIDQ4633018

M. Eren Ahsen, Mathukumalli Vidyasagar

Publication date: 2 May 2019

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

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

PAC learningsparse vectorsnoisy labels

Mathematics Subject Classification ID

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

Related Items (2)

Just least squares: binary compressive sampling with low generative intrinsic dimension ⋮ Unnamed Item

Cites Work

• A mathematical introduction to compressive sensing
• CoSaMP: Iterative signal recovery from incomplete and inaccurate samples
• Central limit theorems for empirical measures
• A note on uniform laws of averages for dependent processes
• A general lower bound on the number of examples needed for learning
• Rates of uniform convergence of empirical means with mixing processes
• General bounds on the number of examples needed for learning probabilistic concepts
• One-bit compressed sensing with non-Gaussian measurements
• On the density of families of sets
• One-Bit Compressed Sensing by Linear Programming
• One-Bit Compressive Sensing With Norm Estimation
• 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
• Learnability and the Vapnik-Chervonenkis dimension
• Decoding by Linear Programming
• Sparse and Redundant Representations
• A theory of the learnable
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• Sparse Approximate Solutions to Linear Systems
• Neural Network Learning
• For most large underdetermined systems of linear equations the minimal 𝓁₁‐norm solution is also the sparsest solution
• Stable signal recovery from incomplete and inaccurate measurements
• Compressed sensing
• A unified framework for high-dimensional analysis of \(M\)-estimators with decomposable regularizers
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item
• Unnamed Item

This page was built for publication: