Compressed and Privacy-Sensitive Sparse Regression

DOI10.1109/TIT.2008.2009605MaRDI QIDQ4975740zbMATH OpenFDO

Authors Shuheng Zhou, John Lafferty, Larry Wasserman

Publication date 8 August 2017

Published in IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL https://doi.org/10.1109/TIT.2008.2009605

Mathematics Subject Classification ID

General nonlinear regression (62J02) Inference from stochastic processes and prediction (62M20) Learning and adaptive systems in artificial intelligence (68T05) Communication theory (94A05) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Cited in

(11)

• On principal components regression, random projections, and column subsampling
• On the asymptotic properties of the group lasso estimator for linear models
• Differential initial-value privacy and observability of linear dynamical systems
• Statistical mechanics of complex neural systems and high dimensional data
• Compressed and Penalized Linear Regression
• Sharp support recovery from noisy random measurements by \(\ell_1\)-minimization
• Compressed classification learning with Markov chain samples
• scientific article; zbMATH DE number 7472350 (Why is no real title available?)
• Privacy aware learning
• Concentration of measure bounds for matrix-variate data with missing values
• Estimates on compressed neural networks regression

This page was built for publication: Compressed and Privacy-Sensitive Sparse Regression

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