arXiv · 2103.11893
Thresholding Greedy Pursuit for Sparse Recovery Problems
Abstract
We study here sparse recovery problems in the presence of additive noise. We analyze a thresholding version of the CoSaMP algorithm, named Thresholding Greedy Pursuit (TGP). We demonstrate that an appropriate choice of thresholding parameter, even without the knowledge of sparsity level of the signal and strength of the noise, can result in exact recovery with no false discoveries as the dimension of the data increases to infinity.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Hai Le, Alexei Novikov. 2021-03-17. Thresholding Greedy Pursuit for Sparse Recovery Problems. https://arxiv.org/abs/2103.11893
Cite the original work for its findings. Save a collection to share your selection of sources.