On the optimality of Orthogonal Greedy Algorithm for M-coherent dictionaries
Numerical Analysis
2010-03-30 v1
Abstract
We show that Orthogonal Greedy Algorithms (Orthogonal Matching Pursuit) provides almost optimal approximation on the first [1/(20M)] steps for M-coherent dictionaries
Keywords
Cite
@article{arxiv.1003.5349,
title = {On the optimality of Orthogonal Greedy Algorithm for M-coherent dictionaries},
author = {Eugene Livshitz},
journal= {arXiv preprint arXiv:1003.5349},
year = {2010}
}