Local greedy approximation for nonlinear regression and neural network training.
From MaRDI portal
Publication:1848831
DOI10.1214/AOS/1015957398zbMATH Open1105.62354OpenAlexW1576937288MaRDI QIDQ1848831FDOQ1848831
Authors: Lee Kenneth Jones
Publication date: 14 November 2002
Published in: The Annals of Statistics (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1214/aos/1015957398
Recommendations
- A simple lemma on greedy approximation in Hilbert space and convergence rates for projection pursuit regression and neural network training
- Local approximation on artificial neural networks
- scientific article; zbMATH DE number 952763
- Regularized greedy algorithms for network training with data noise
- Nonlinear function approximation: computing smooth solutions with an adaptive greedy algorithm
General nonlinear regression (62J02) Estimation in multivariate analysis (62H12) Neural nets and related approaches to inference from stochastic processes (62M45)
Cites Work
- Greedy function approximation: A gradient boosting machine.
- A simple lemma on greedy approximation in Hilbert space and convergence rates for projection pursuit regression and neural network training
- Universal approximation bounds for superpositions of a sigmoidal function
- Projection pursuit
- On a conjecture of Huber concerning the convergence of projection pursuit regression
- Some remarks on greedy algorithms
- Rates of convex approximation in non-Hilbert spaces
- Efficient agnostic learning of neural networks with bounded fan-in
- Remarks on projection pursuit regression and density estimation
- The computational intractability of training sigmoidal neural networks
- On the infeasibility of training neural networks with small mean-squared error
- Good weights and hyperbolic kernels for neural networks, projection pursuit, and pattern classification: Fourier strategies for extracting information from high-dimensional data
Cited In (4)
- Nonlinear function approximation: computing smooth solutions with an adaptive greedy algorithm
- Nonparametric nonlinear regression using polynomial and neural approximators: a numerical comparison
- Greedy training algorithms for neural networks and applications to PDEs
- A simple lemma on greedy approximation in Hilbert space and convergence rates for projection pursuit regression and neural network training
This page was built for publication: Local greedy approximation for nonlinear regression and neural network training.
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q1848831)