Sparse Recovery for Earth Mover Distance
Name
Indyk_Sparse recovery.pdf
Size
265.39 KB
Format
Adobe PDF
Checksum (MD5)
9cbd9702704819d762a58fe58e77fc99
Author(s)
Gupta, Rishi V.
Indyk, Piotr
Price, Eric C.
Date Issued
September 2010
Journal
Proceedings of the Forty-Eighth Annual Allerton Conference on Communication, Control, and Computing, 2010
Publisher
University of Ilinois at Urbana-Champaign
Citation
Gupta, Rishi, Piotr Indyk, and Eric Price. "Sparse Recovery for Earth Mover Distance." Forty-Eighth Annual Allerton Conference on Communication, Control, and Computing Sept 29 - Oct 1, 2010, University of Illinois at Urbana-Champaign, IL, USA
Version
Author's final manuscript
Abstract
We initiate the study of sparse recovery problems under the Earth-Mover Distance (EMD). Specically, we design a distribution over m x n matrices A, for m << n, such that for any x, given Ax, we can recover a k-sparse approximation to x under the EMD distance. We also provide an empirical evaluation of the method that, in some scenarios, shows its advantages over the "usual" recovery in the lp norms.
Description
URL to paper listed on conference site
MIT Department
Massachusetts Institute of Technology. Computer Science and Artificial Intelligence Laboratory
Massachusetts Institute of Technology. Department of Electrical Engineering and Computer Science
Terms of Use
Creative Commons Attribution-Noncommercial-Share Alike 3.0
Persistent DSpace Link
DOI of Published Version
https://conf.papercept.net/conferences/conferences/ALLER10/program/ALLER10_ContentListWeb_3.html#fra6_04
