Abstract
We study generalized approximate weak greedy algorithms. The main difference of these algorithms from approximate weak greedy algorithms proposed by R. Gribonval and M. Nielsen consists in that errors in the calculation of the coefficients can be prescribed in terms of not only their relative values, but also their absolute values. We present conditions on the parameters of generalized approximate weak greedy algorithms which are sufficient for the expansions resulting from the use of this algorithm to converge to the expanded element. It is shown that these conditions cannot be essentially weakened. We also study some questions of the convergence of generalized approximate weak greedy expansions with respect to orthonormal systems.
This is a preview of subscription content, log in via an institution to check access.
Similar content being viewed by others
REFERENCES
R. Gribonval and M. Nielsen, “Approximate weak greedy algorithms,” Adv. Comput. Math., 14 (2001), no. 4, 361–378.
V. N. Temlyakov, “Weak greedy algorithms,” Adv. Comput. Math., 12 (2000), no. 2–3, 213–227.
J. H. Friedman and W. Stueuzle, “Projection pursuit regression,” J. Amer. Statist. Assoc., 76 (1981), 817–823.
S. Mallat and Z. Zhang, “Matching pursuit with time-frequency dictionaries,” IEEE Trans. Signal Process, 41 (1993), no. 12, 3397–3415.
L. K. Jones, “On a conjecture of Huber concerning the convergence of PP-regression,” Ann. Statist., 15 (1987), 880–882.
L. Jones, “A simple lemma on greedy approximation in Hilbert space and convergence rates for projection pursuit regression and network training,” Ann. Statist., 20 (1992), 608–613.
L. Rejto and G. G. Walter, “Remarks on projection pursuit regression and density estimation,” Stochastic Anal. Appl., 10 (1992), 213–222.
E. D. Livshits and V. N. Temlyakov, “On the convergence of weak greedy algorithms,” Trudy Mat. Inst. Steklov [Proc. Steklov Inst. Math.], 232 (2001), 236–247.
V. N. Temlyakov, “A criterion for convergence of weak greedy algorithms,” in: Preprint at http://www.math.sc.edu/∼imip/00.html.
V. V. Galatenko and E. D. Livshitz (Livshits), “On the convergence of approximate weak greedy algorithms,” East J. Approx., 9 (2003), no. 1, 43–49.
Author information
Authors and Affiliations
Additional information
__________
Translated from Matematicheskie Zametki, vol. 78, no. 2, 2005, pp. 186–201.
Original Russian Text Copyright © 2005 by V. V. Galatenko, E. D. Livshits.
Rights and permissions
About this article
Cite this article
Galatenko, V.V., Livshits, E.D. Generalized Approximate Weak Greedy Algorithms. Math Notes 78, 170–184 (2005). https://doi.org/10.1007/s11006-005-0113-0
Received:
Issue Date:
DOI: https://doi.org/10.1007/s11006-005-0113-0