2 citations · 2 across the 1 of their papers we have counts for
4 papers
Sparse approximation and recovery by greedy algorithms
Eugene Livshitz, Vladimir Temlyakov
We study sparse approximation by greedy algorithms. Our contribution is two-fold. First, we prove exact recovery with high probability of random -sparse signals within $\lceil K…
On efficiency of Orthogonal Matching Pursuit
Eugene Livshitz
We show that if a matrix satisfies the RIP of order with isometry constant $\dt = c K^{-0.2}$ and has coherence less than , then Orthogonal Matchin…
On the optimality of Orthogonal Greedy Algorithm for M-coherent dictionaries
Eugene Livshitz
We show that Orthogonal Greedy Algorithms (Orthogonal Matching Pursuit) provides almost optimal approximation on the first [1/(20M)] steps for M-coherent dictionaries
On Greedy Algorithms with bounded cumulative coherence
Eugene Livshitz
We discuss the upper and lower estimates for the rate of convergence of Pure and Orthogonal Greedy Algorithms for dictionary with bounded cumulative coherence.