A New Bound on Approximate Support Recovery
Information Theory
2020-12-14 v1 math.IT
Abstract
Orthogonal matching pursuit (OMP) is a greedy algorithm popularly being used for the recovery of sparse signals. In this paper, we study the performance of OMP for support recovery of sparse signal under noise. Our analysis shows that under mild constraint on the minimum-to-average ratio of nonzero entries in the sparse signal and the signal-to-noise ratio, the OMP algorithm can recover the support of signal with an error rate that can be arbitrarily small. Our result offers an affirmative answer to the conjecture of [Wang, TSP 2015] that the error rate of support recovery via OMP has no dependence on the maximum element of the signal.
Cite
@article{arxiv.2012.06205,
title = {A New Bound on Approximate Support Recovery},
author = {Hengkuan Lu and Jian Wang},
journal= {arXiv preprint arXiv:2012.06205},
year = {2020}
}
Comments
2 figures