Language:   Search:   Contact
Zentralblatt MATH has released its new interface!
For an improved author identification, see the new author database of ZBMATH.

# Advanced Search

Query:
Fill in the form and click »Search«...
Format:
Display: entries per page entries
Zbl 1138.62019
Barron, Andrew R.; Cohen, Albert; Dahmen, Wolfgang; DeVore, Ronald A.
Approximation and learning by greedy algorithms.
(English)
[J] Ann. Stat. 36, No. 1, 64-94 (2008). ISSN 0090-5364; ISSN 2168-8966/e

Summary: We consider the problem of approximating a given element $f$ from a Hilbert space $\cal 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 of {\it W. S. Lee} et al. [IEEE Trans. Inf. Theory 42, No. 6, 2118--2132 (1996; Zbl 0874.68253)] 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.
MSC 2000:
*62G08 Nonparametric regression
68T05 Learning and adaptive systems
41A46 Approximation by arbitrary nonlinear expressions
41A63 Multidimensional approximation problems
46N30 Appl. of functional analysis in probability theory and statistics
65C60 Computational problems in statistics

Keywords: statistical learning; convergence rates for greedy algorithms; interpolation spaces; neural networks

Citations: Zbl 0874.68253

Login Username: Password:

Highlights
Master Server

### Zentralblatt MATH Berlin [Germany]

© FIZ Karlsruhe GmbH

Zentralblatt MATH master server is maintained by the Editorial Office in Berlin, Section Mathematics and Computer Science of FIZ Karlsruhe and is updated daily.

Other Mirror Sites

Copyright © 2013 Zentralblatt MATH | European Mathematical Society | FIZ Karlsruhe | Heidelberg Academy of Sciences
Published by Springer-Verlag | Webmaster