The DOI matches its Crossref record; 16 of the 16 references it cites were found in a registry or an index.
Approximation and learning by greedy algorithms
Open accessAbstract
We consider the problem of approximating a given element f from a Hilbert space $\mathcal{H}$ by means of greedy algorithms and the application of such procedures to the regression problem in statistical learning theory. We improve on the existing theory of convergence rates for both the orthogonal greedy algorithm and the relaxed greedy algorithm, as well as for the forward stepwise projection algorithm. For all these algorithms, we prove convergence results for a variety of function classes and not simply those that are related to the convex hull of the dictionary. We then show how these bounds for convergence rates lead to a new theory for the performance of greedy algorithms in learning. In particular, we build upon the results in [IEEE Trans. Inform. Theory 42 (1996) 2118–2132] to construct learning algorithms based on greedy approximations which are universally consistent and provide provable convergence rates for large classes of functions. The use of greedy algorithms in the context of learning is very appealing since it greatly reduces the computational burden when compared with standard model selection using general dictionaries.
Overview
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Run the check — free, no account needed. It reads the open-access text and checks the sources it cites.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Regression shrinkage and selection via the lasso
Tibshirani, R. (1996) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1996.tb02080.x · Cited by 51,482
The Elements of Statistical Learning
Hastie, T., Friedman, J., & Tibshirani, R. (2001) · Springer Series in Statistics · doi:10.1007/978-0-387-21606-5 · Cited by 24,162
Efron, B., Hastie, T., Johnstone, I., & Tibshirani, R. (2004) · The Annals of Statistics · doi:10.1214/009053604000000067 · Cited by 9,357
Universal approximation bounds for superpositions of a sigmoidal function
Barron, A. R. (1993) · IEEE Transactions on Information Theory · doi:10.1109/18.256500 · Cited by 2,804
Self-citationWavelet Shrinkage: Asymptopia?
Donoho, D. L., Johnstone, I. M., Kerkyacharian, G., & Picard, D. (1995) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.2517-6161.1995.tb02032.x · Cited by 1,749
A Distribution-Free Theory of Nonparametric Regression
Györfi, L., Kohler, M., Krzyżak, A., & Walk, H. (2002) · Springer Series in Statistics · doi:10.1007/b97848 · Cited by 1,738
Adaptive greedy approximations
Davis, G., Mallat, S., & Avellaneda, M. (1997) · Constructive Approximation · doi:10.1007/bf02678430 · Cited by 1,166
Minimax estimation via wavelet shrinkage
Donoho, D. L., & Johnstone, I. M. (1998) · The Annals of Statistics · doi:10.1214/aos/1024691081 · Cited by 1,005
DeVore, R. A. (1998) · Acta Numerica · doi:10.1017/s0962492900002816 · Cited by 877
Self-citationSome remarks on greedy algorithms
DeVore, R., & Temlyakov, V. N. (1996) · Advances in Computational Mathematics · doi:10.1007/bf02124742 · Cited by 573
Self-citation
Cited by
Sure Independence Screening for Ultrahigh Dimensional Feature Space
Fan, J., & Lv, J. (2008) · Journal of the Royal Statistical Society Series B: Statistical Methodology · doi:10.1111/j.1467-9868.2008.00674.x · Cited by 2,711
From Sparse Solutions of Systems of Equations to Sparse Modeling of Signals and Images
Bruckstein, A. M., Donoho, D. L., & Elad, M. (2009) · SIAM Review · doi:10.1137/060657704 · Cited by 2,183
Orthogonal Matching Pursuit for Sparse Signal Recovery With Noise
Cai, T. T., & Wang, L. (2011) · IEEE Transactions on Information Theory · doi:10.1109/tit.2011.2146090 · Cited by 1,265
Computational Methods for Sparse Solution of Linear Inverse Problems
Tropp, J. A., & Wright, S. J. (2010) · Proceedings of the IEEE · doi:10.1109/jproc.2010.2044010 · Cited by 1,046
High-dimensional variable selection
Wasserman, L., & Roeder, K. (2009) · The Annals of Statistics · doi:10.1214/08-aos646 · Cited by 373
Metadata
- Authors
- Barron, A. R., Cohen, A., Dahmen, W., & DeVore, R. A.
- Venue
- The Annals of Statistics
- Publisher
- Institute of Mathematical Statistics
- Published
- 2008-02-01
- Volume
- 36
- Issue
- 1
- Pages
- 64-94
- ISSN
- 0090-5364 (ISSN-L)
- OpenAlex
- W2037842665
- Cited by
- 305
- References
- 16
- FWCI
- 17.07
- Type
- journal article
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
How to cite
Cite CoChat for the checks on this page, and the paper for its own findings.
- This page
- CoChat. (2026). Citation check: Approximation and learning by greedy algorithms. https://app.cochat.ai/papers/10.1214/009053607000000631
- The paper
- Barron, A. R., Cohen, A., Dahmen, W., & DeVore, R. A. (2008). Approximation and learning by greedy algorithms. The Annals of Statistics. https://doi.org/10.1214/009053607000000631
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.