Show simple item record

dc.contributor.authorIndyk, Piotr
dc.contributor.authorDo Ba, Khanh
dc.contributor.authorPrice, Eric C.
dc.contributor.authorWoodruff, David P.
dc.date.accessioned2011-05-10T15:40:10Z
dc.date.available2011-05-10T15:40:10Z
dc.date.issued2010-01
dc.identifier.urihttp://hdl.handle.net/1721.1/62797
dc.description.abstractWe consider the following k-sparse recovery problem: design an m x n matrix A, such that for any signal x, given Ax we can efficiently recover ^x satisfying x|| ^x||1 [less than or equal to] C min[subscript k]-sparse x'||x - x'||1. It is known that there exist matrices A with this property that have only O(k log(n=k)) rows. In this paper we show that this bound is tight. Our bound holds even for the more general random- ized version of the problem, where A is a random variable, and the recovery algorithm is required to work for any fixed x with constant probability (over A).en_US
dc.description.sponsorshipDavid & Lucile Packard Foundationen_US
dc.description.sponsorshipDanish National Research Foundationen_US
dc.description.sponsorshipDanish National Research Foundation (MADALGO (Center for Massive Data Algorithmics))en_US
dc.description.sponsorshipNational Science Foundation (U.S.) (grant CCF-0728645)en_US
dc.description.sponsorshipCisco Community Fellowship Programen_US
dc.language.isoen_US
dc.publisherSociety for Industrial and Applied Mathematicsen_US
dc.relation.isversionofhttp://www.siam.org/proceedings/soda/2010/SODA10_095_dobak.pdfen_US
dc.rightsCreative Commons Attribution-Noncommercial-Share Alike 3.0en_US
dc.rights.urihttp://creativecommons.org/licenses/by-nc-sa/3.0/en_US
dc.sourceMIT web domainen_US
dc.titleLower bounds for sparse recoveryen_US
dc.typeArticleen_US
dc.identifier.citationDo Ba, Khanh et al. "Lower Bounds for Sparse Recovery." in Proceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithms, Session 9A, Jan. 17-19, 2010, Hyatt Regency Austin, Austin, TX.en_US
dc.contributor.departmentMassachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratoryen_US
dc.contributor.departmentMassachusetts Institute of Technology. Department of Electrical Engineering and Computer Scienceen_US
dc.contributor.approverIndyk, Piotr
dc.contributor.mitauthorIndyk, Piotr
dc.contributor.mitauthorDo Ba, Khanh
dc.contributor.mitauthorPrice, Eric C.
dc.relation.journalProceedings of the Twenty-First Annual ACM-SIAM Symposium on Discrete Algorithmsen_US
dc.eprint.versionAuthor's final manuscripten_US
dc.type.urihttp://purl.org/eprint/type/ConferencePaperen_US
dc.identifier.orcidhttps://orcid.org/0000-0002-7983-9524
mit.licenseOPEN_ACCESS_POLICYen_US
mit.metadata.statusComplete


Files in this item

Thumbnail

This item appears in the following Collection(s)

Show simple item record