IDEAS home Printed from https://ideas.repec.org/a/gam/jmathe/v11y2023i11p2559-d1162981.html
   My bibliography  Save this article

On the Rate of Convergence of Greedy Algorithms

Author

Listed:
  • Vladimir Temlyakov

    (Steklov Mathematical Institute of Russian Academy of Sciences, 117312 Moscow, Russia
    Department of Mechanics and Mathematics, Lomonosov Moscow State University, 119991 Moscow, Russia
    Moscow Center of Fundamental and Applied Mathematics, 119333 Moscow, Russia
    Department of Mathematics, University of South Carolina, Columbia, SC 29208, USA)

Abstract

In this paper, a new criterion for the evaluation of the theoretical efficiency of a greedy algorithm is suggested. Using this criterion, we prove some results on the rate of convergence of greedy algorithms, which provide expansions. We consider both the case of Hilbert spaces and the more general case of Banach spaces. The new component of this paper is that we bound the error of approximation by the product of two norms—the norm of f and the A 1 -norm of f . Typically, only the A 1 -norm of f is used. In particular, we establish that some greedy algorithms (Pure Greedy Algorithm (PGA) and its modifications) are as good as the Orthogonal Greedy Algorithm (OGA) in this new sense of the rate of convergence, while it is known that the PGA is much worse than the OGA in the standard sense. Our new results provide better bounds for the accuracy than known results in the case of small ∥ f ∥ .

Suggested Citation

  • Vladimir Temlyakov, 2023. "On the Rate of Convergence of Greedy Algorithms," Mathematics, MDPI, vol. 11(11), pages 1-15, June.
    • Handle: RePEc:gam:jmathe:v:11:y:2023:i:11:p:2559-:d:1162981
    as

    Download full text from publisher

    File URL: https://www.mdpi.com/2227-7390/11/11/2559/pdf
    Download Restriction: no
    File URL: https://www.mdpi.com/2227-7390/11/11/2559/
    Download Restriction: no
    ---><---

    Corrections

    All material on this site has been provided by the respective publishers and authors. You can help correct errors and omissions. When requesting a correction, please mention this item's handle: RePEc:gam:jmathe:v:11:y:2023:i:11:p:2559-:d:1162981. See general information about how to correct material in RePEc.

    If you have authored this item and are not yet registered with RePEc, we encourage you to do it here. This allows to link your profile to this item. It also allows you to accept potential citations to this item that we are uncertain about.

    We have no bibliographic references for this item. You can help adding them by using this form .

    If you know of missing items citing this one, you can help us creating those links by adding the relevant references in the same way as above, for each refering item. If you are a registered author of this item, you may also want to check the "citations" tab in your RePEc Author Service profile, as there may be some citations waiting for confirmation.

    For technical questions regarding this item, or to correct its authors, title, abstract, bibliographic or download information, contact: MDPI Indexing Manager (email available below). General contact details of provider: https://www.mdpi.com .

    Please note that corrections may take a couple of weeks to filter through the various RePEc services.

    IDEAS is a RePEc service. RePEc uses bibliographic data supplied by the respective publishers.