Local greedy approximation for nonlinear regression and neural network training.
type: Item
instance of: scholarly article
title: Local greedy approximation for nonlinear regression and neural network training.
zbMATH Open document ID: 1105.62354
author: Lee Kenneth Jones
published in: The Annals of Statistics
publication date: 2002-11-14T00:00:00Z
Mathematics Subject Classification ID: 62J02
Mathematics Subject Classification ID: 62H12
Mathematics Subject Classification ID: 62M45
zbMATH DE Number: 1828987
MaRDI profile type: Publication
full work available at URL: https://doi.org/10.1214/aos/1015957398
OpenAlex ID: W1576937288
cites work: Universal approximation bounds for superpositions of a sigmoidal function
cites work: Some remarks on greedy algorithms
cites work: Rates of convex approximation in non-Hilbert spaces
cites work: Greedy function approximation: A gradient boosting machine.
cites work: Projection pursuit
cites work: On a conjecture of Huber concerning the convergence of projection pursuit regression
cites work: A simple lemma on greedy approximation in Hilbert space and convergence rates for projection pursuit regression and neural network training
cites work: Good weights and hyperbolic kernels for neural networks, projection pursuit, and pattern classification: Fourier strategies for extracting information from high-dimensional data
cites work: The computational intractability of training sigmoidal neural networks
cites work: Efficient agnostic learning of neural networks with bounded fan-in
cites work: Remarks on projection pursuit regression and density estimation
cites work: On the infeasibility of training neural networks with small mean-squared error
DOI: 10.1214/AOS/1015957398
description: scientific article; zbMATH DE number 1828987