Some remarks on greedy algorithms

Advances in Computational Mathematics

Volumn 5, Issue 1, 1996, Pages 173-187

  DeVore, R A ^a   Temlyakov, V N ^a  

^a UNIVERSITY OF SOUTH CAROLINA   (United States)

Author keywords

[No Author keywords available]

Indexed keywords

EID: 0039439070     PISSN: 10197168     EISSN: None     Source Type: Journal    
DOI: 10.1007/bf02124742     Document Type: Article

References (8)

1. A. Barron, Universal approximation bounds for superposition of a sigmoidal function, IEEE Transactions on Information Theory 39 (1993) 930-945.
2. C. Darken, M. Donahue, L. Gurvits and E. Sontag, Rate of approximation results motivated by robust neural network learning, 6th ACM Conference on Computer Learning Theory, ACM, 1993, pp. 303-309.
3. R. DeVore, B. Jawerth and V. Popov, Compression of wavelet decompositions, American Journal of Mathematics 114 (1992) 737-785.
4. L. Jones, A simple lemma on greedy approximation in Hubert space and convergence rates for projection pursuit regression and neural network training, Annals of Statistics 20 (1992) 608-613.
5. G. Davis, S. Mallat and M. Avellaneda, Adaptive nonlinear approximations, Constructure Approximation, to appear.
6. E. Schmidt, Zur Theorie der linearen und nichtlinearen Integralgleichungen. I, Math. Annalen 63 (1906-1907) 433-476.
7. S.B. Stechkin, On absolute convergence of orthogonal series, Dok. Akad. Nauk SSSR 102 (1955) 37-40.
8. G. Pisier, Remarques sur un resultat non publié de B. Maurey, Seminaire d'Analyse Fonctionelle, 1980-81, Ecole Polytechnique Centre de Mathematiques, Palaiseau.