Approximation and Learning by Greedy Algorithms
Approximation and Learning by Greedy Algorithms
About this item
Full title
Author / Creator
Publisher
Hayward, CA: Institute of Mathematical Statistics
Journal title
Language
English
Formats
Publication information
Publisher
Hayward, CA: Institute of Mathematical Statistics
Subjects
More information
Scope and Contents
Contents
We consider the problem of approximating a given element f from a Hilbert space $\scr{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...
Alternative Titles
Full title
Approximation and Learning by Greedy Algorithms
Authors, Artists and Contributors
Author / Creator
Identifiers
Primary Identifiers
Record Identifier
TN_cdi_projecteuclid_primary_oai_CULeuclid_euclid_aos_1201877294
Permalink
https://devfeature-collection.sl.nsw.gov.au/record/TN_cdi_projecteuclid_primary_oai_CULeuclid_euclid_aos_1201877294
Other Identifiers
ISSN
0090-5364
E-ISSN
2168-8966
DOI
10.1214/009053607000000631
