Some remarks on greedy algorithms (Q1923887): Difference between revisions
From MaRDI portal
Removed claims |
ReferenceBot (talk | contribs) Changed an Item |
||
| (2 intermediate revisions by 2 users not shown) | |||
| Property / author | |||
| Property / author: Vladimir N. Temlyakov / rank | |||
Normal rank | |||
| Property / reviewed by | |||
| Property / reviewed by: Antonio López-Carmona / rank | |||
Normal rank | |||
| Property / MaRDI profile type | |||
| Property / MaRDI profile type: MaRDI publication profile / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Universal approximation bounds for superpositions of a sigmoidal function / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Compression of Wavelet Decompositions / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: A simple lemma on greedy approximation in Hilbert space and convergence rates for projection pursuit regression and neural network training / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Adaptive greedy approximations / rank | |||
Normal rank | |||
| Property / cites work | |||
| Property / cites work: Q3229514 / rank | |||
Normal rank | |||
Latest revision as of 14:09, 24 May 2024
scientific article
| Language | Label | Description | Also known as |
|---|---|---|---|
| English | Some remarks on greedy algorithms |
scientific article |
Statements
Some remarks on greedy algorithms (English)
0 references
9 March 1997
0 references
The authors develop estimates for the rate of approximation for certain classes of functions and study certain greedy algorithms. They restrict their study to the case where approximation takes place in a real, separable Hilbert space and study three greedy algorithms: the pure greedy algorithm, an orthogonal greedy algorithm, and a relaxed greedy algorithm.
0 references
rate of approximation
0 references
greedy algorithms
0 references
Hilbert space
0 references
