Compressed and Privacy-Sensitive Sparse Regression
Zhou, S.
Lafferty, J.
Wasserman, L.
ETH Zurich, Zurich;
This paper appears in: Information Theory, IEEE Transactions on
Publication Date: Feb. 2009
Volume: 55,
Issue: 2
On page(s): 846-866
ISSN: 0018-9448
INSPEC Accession Number: 10471117
Digital Object Identifier: 10.1109/TIT.2008.2009605
Current Version Published: 2009-02-06
Abstract
Recent research has studied the role of sparsity in high-dimensional regression and signal reconstruction, establishing theoretical limits for recovering sparse models. This line of work shows that lscr1 -regularized least squares regression can accurately estimate a sparse linear model from noisy examples in high dimensions. We study a variant of this problem where the original n input variables are compressed by a random linear transformation to m Lt n examples in p dimensions, and establish conditions under which a sparse linear model can be successfully recovered from the compressed data. A primary motivation for this compression procedure is to anonymize the data and preserve privacy by revealing little information about the original data. We characterize the number of projections that are required for lscr1 -regularized compressed regression to identify the nonzero coefficients in the true model with probability approaching one, a property called ldquosparsistence.rdquo We also show that lscr1 -regularized compressed regression asymptotically predicts as well as an oracle linear model, a property called ldquopersistence.rdquo Finally, we characterize the privacy properties of the compression procedure, establishing upper bounds on the mutual information between the compressed and uncompressed data that decay to zero.
Index
Terms
Available to subscribers and IEEE members.
References
Available to subscribers and IEEE members.
Citing Documents
Available to subscribers and IEEE members.
Cart
