48 citations · 191 across the 37 of their papers we have counts for
Showing 2013Show all
3 papers · 1 filter
stat.ML2013★ 5 cited
Chebushev Greedy Algorithm in convex optimization
Vladimir Temlyakov
Chebyshev Greedy Algorithm is a generalization of the well known Orthogonal Matching Pursuit defined in a Hilbert space to the case of Banach spaces. We apply this algorithm for co…
math.NA2013★ 2 cited
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…
math.MG2013★ 2 cited
A remark on covering
Vladimir Temlyakov
We discuss construction of coverings of the unit ball of a finite dimensional Banach space. The well known technique of comparing volumes gives upper and lower bounds on covering n…