Nonlinear function approximation: computing smooth solutions with an adaptive greedy algorithm
From MaRDI portal
Recommendations
- Adaptive algorithms of nonlinear approximation with finite terms
- scientific article; zbMATH DE number 1264506
- scientific article; zbMATH DE number 3629544
- Best linear and nonlinear approximations for smooth functions
- An optimal adaptive algorithm for the approximation of concave functions
- A smooth approximation method for nonlinear \(l_1\) problem
- scientific article; zbMATH DE number 1541433
- Smoothing approximations to nonsmooth optimization problems
- Greedy algorithm for functions with low mixed smoothness
- scientific article; zbMATH DE number 903752
Cites work
- scientific article; zbMATH DE number 3877692 (Why is no real title available?)
- scientific article; zbMATH DE number 5500983 (Why is no real title available?)
- A simple lemma on greedy approximation in Hilbert space and convergence rates for projection pursuit regression and neural network training
- Efficient agnostic learning of neural networks with bounded fan-in
- Error bounds for approximation with neural networks
- Generalization bounds for function approximation from scattered noisy data
- Learning a function from noisy samples at a finite sparse set of points
- Local greedy approximation for nonlinear regression and neural network training.
- Nonlinear methods of approximation
- On a conjecture of Huber concerning the convergence of projection pursuit regression
- On the mathematical foundations of learning
- Optimal nonlinear approximation
- Rates of convex approximation in non-Hilbert spaces
- Regularized data-driven construction of fuzzy controllers
- Regularized greedy algorithms for network training with data noise
- Remarks on projection pursuit regression and density estimation
- Shannon sampling and function reconstruction from point values
- Some remarks on greedy algorithms
- Universal approximation bounds for superpositions of a sigmoidal function
- Weak greedy algorithms
Cited in
(10)- Greedy algorithm for functions with low mixed smoothness
- Towards a Black Box Algorithm for Nonlinear Function Approximation over High‐Dimensional Domains
- Nonlinear approximation in bounded orthonormal product bases
- Learning a function from noisy samples at a finite sparse set of points
- Approximation from noisy data
- The weight-decay technique in learning from data: an optimization point of view
- Regularized greedy algorithms for network training with data noise
- Local greedy approximation for nonlinear regression and neural network training.
- The greedy ridge algorithm in Gaussian weighted \(L^2\)
- Optimal stable nonlinear approximation
This page was built for publication: Nonlinear function approximation: computing smooth solutions with an adaptive greedy algorithm
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q863343)
