Lower bounds for the rate of convergence of greedy algorithms

DOI10.1070/IM2009V073N06ABEH002478zbMATH Open1185.41015OpenAlexW2059687034MaRDI QIDQ3405544FDOQ3405544

Authors: 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

Recommendations

• On the rate of convergence of a pure greedy algorithm.
• Two lower estimates in greedy approximation
• Optimality of the greedy algorithm for some function classes
• On the rate of convergence of greedy algorithms.
• Comparison of the convergence rate of pure greedy and orthogonal greedy algorithms

zbMATH Keywords

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

Mathematics Subject Classification ID

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

Cited In (16)

• Rate of convergence of thresholding greedy algorithms
• A convergence rate estimate for remotest projections on three subspaces
• On the rate of convergence of a pure greedy algorithm.
• Two lower estimates in greedy approximation
• Alternating projections, remotest projections, and greedy approximation
• Rescaled pure greedy algorithm for Hilbert and Banach spaces
• Fully corrective gradient boosting with squared hinge: fast learning rates and early stopping
• Comparison of the convergence rate of pure greedy and orthogonal greedy algorithms
• Uniform approximation rates and metric entropy of shallow neural networks
• The rate of convergence of weak greedy approximations over orthogonal dictionaries
• On convergence of weak greedy algorithms
• Characterization of the variation spaces corresponding to shallow neural networks
• Weak convergence of a greedy algorithm and the WN-property
• A general lower bound for the asymptotic convergence factor
• Entropy-based convergence rates of greedy algorithms
• A criterion for convergence of weak greedy algorithms

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

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3405544)