On Greedy Algorithms with bounded cumulative coherence

It provides theoretical convergence guarantees for greedy algorithms in sparse approximation, relevant to researchers in signal processing and approximation theory.

The paper establishes upper and lower bounds on the convergence rate of Pure and Orthogonal Greedy Algorithms for dictionaries with bounded cumulative coherence, providing theoretical guarantees for these methods.