Lower bounds for the rate of convergence of greedy algorithms

DOI10.1070/IM2009v073n06ABEH002478zbMath1185.41015OpenAlexW2059687034MaRDI QIDQ3405544

E. D. Livshits

Publication date: 10 February 2010

Published in: Izvestiya: Mathematics (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1070/im2009v073n06abeh002478

zbMATH Keywords

rate of convergencepure greedy algorithmbest \(n-\)term approximationinterpolation classes

Mathematics Subject Classification ID

Rate of convergence, degree of approximation (41A25) Algorithms for approximation of functions (65D15)

Related Items (8)

Rescaled pure greedy algorithm for Hilbert and Banach spaces ⋮ Uniform approximation rates and metric entropy of shallow neural networks ⋮ The rate of convergence of weak greedy approximations over orthogonal dictionaries ⋮ Comparison of the convergence rate of pure greedy and orthogonal greedy algorithms ⋮ Fully corrective gradient boosting with squared hinge: fast learning rates and early stopping ⋮ Characterization of the variation spaces corresponding to shallow neural networks ⋮ A convergence rate estimate for remotest projections on three subspaces ⋮ Alternating projections, remotest projections, and greedy approximation

This page was built for publication: Lower bounds for the rate of convergence of greedy algorithms