By Topic

Practical near-optimal sparse recovery in the L1 norm

Sign In

Cookies must be enabled to login.After enabling cookies , please use refresh or reload or ctrl+f5 on the browser for the login options.

Formats Non-Member Member
$31 $13
Learn how you can qualify for the best price for this item!
Become an IEEE Member or Subscribe to
IEEE Xplore for exclusive pricing!
close button

puzzle piece

IEEE membership options for an individual and IEEE Xplore subscriptions for an organization offer the most affordable access to essential journal articles, conference papers, standards, eBooks, and eLearning courses.

Learn more about:

IEEE membership

IEEE Xplore subscriptions

3 Author(s)
Berinde, R. ; Dept. of Electr. Eng. & Comput. Sci., MIT, Cambridge, MA ; Indyk, P. ; Ruzic, M.

We consider the approximate sparse recovery problem, where the goal is to (approximately) recover a high-dimensional vector x isin Rn from its lower-dimensional sketch Ax isin Rm. Specifically, we focus on the sparse recovery problem in the l1 norm: for a parameter k, given the sketch Ax, compute an approximation xcirc of x such that the l1 approximation error parx - xcircpar1 is close to minx' parx - x'par1, where x' ranges over all vectors with at most k terms. The sparse recovery problem has been subject to extensive research over the last few years. Many solutions to this problem have been discovered, achieving different trade-offs between various attributes, such as the sketch length, encoding and recovery times.

Published in:

Communication, Control, and Computing, 2008 46th Annual Allerton Conference on

Date of Conference:

23-26 Sept. 2008