Local greedy approximation for nonlinear regression and neural network training

Annals of Statistics

Volumn 28, Issue 5, 2000, Pages 1379-1389

  Jones, L K ^a,b  

^a UNIVERSITY OF MASSACHUSETTS LOWELL   (United States)

^b University of Massachusetts Lowell   (United States)

Author keywords

Greedy approximation; Local training

Indexed keywords

EID: 0034287161     PISSN: 00905364     EISSN: None     Source Type: Journal    
DOI: 10.1214/aos/1015957398     Document Type: Article

References (16)

1. BARRON, A. R. (1993). Universal approximation bounds for superpositions of a sigmoidal function. IEEE Trans. Inform. Theory 40 930-945.
2. BOTTOU, L. and VAPNIK, V. (1992). Local learning algorithms. Neural Computation 4 888-900.
3. SLUM, A. L. and RIVEST, R. L. (1992). Training a 3-Node Neural Network is NP-Complete. Neural Networks 5 117-127.
4. DEVORE, R. A. and TEMLYAKOV, V. N. (1996). Some remarks on greedy algorithms. Adv. Comput. Math 5 173-187.
5. DONOHUE, M. J., GURVITZ, L., DARKEN, C. and SONTAG, E. (1994). Rates of convex approximation in non-Hilbert spaces. Constr. Approx. 13 187-220.
6. FLICK, T. E., JONES, L. K., PRIEST, R. and HERMAN, C. (1990). Projection pursuit classification. Pattern Recognition 23 1367-1376.
7. FRIEDMAN, J. H. (1999). Greedy function approximation: a gradient boosting machine. Technical report, Stanford Univ.
8. FRIEDMAN, J. H. and STUETZLE, W. (1981). Projection pursuit regression. J. Amer. Statist. Assoc. 76 817-823.
9. HUBER, P. J. (1985). Projection pursuit. Ann. Statist. 13 435-475.
10. JONES, L. K. (1987). On a conjuecture of Huber concerning the convergence of projection pursuit regression. Ann. Statist. 15 880-882.
11. JONES, L. K. (1992). A simple lemma on greedy approximation in Hilbert space and convergence rates for projection pursuit regression and neural network training. Ann. Statist. 20 608-613.
12. JONES, L. K. (1994). Good weights and hyperbolic kernels for neural networks, projection pursuit, and pattern classification: Fourier strategies for extracting information from high-dimensional data. IEEE Trans. Inform. Theory 40 439-454.
13. JONES, L. K. (1997). The Computational intractability of training sigmoidal neural networks. IEEE Trans. Inform. Theory 43 167-173.
14. LEE, W. S. and BARTLETT, P. L., and WILLIAMSON, R. C. (1996). Efficient agnostic learning of neural networks with bounded fan-in. IEEE Trans. Inform. Theory 42 2118-2132.
15. REJTO, L. and WALTER, G. G. (1992). Remarks on projection pursuit regression and density estimation. Stochastic Anal. Appl. 10 213-222.
16. VU, V. H. (1998). On the infeasibility of training neural networks with small mean-squared error. IEEE Trans. Inform. Theory 44 2892-2900.