Nonlinear function approximation: computing smooth solutions with an adaptive greedy algorithm
DOI10.1016/J.JAT.2006.03.016zbMATH Open1106.41024OpenAlexW2016220370MaRDI QIDQ863343FDOQ863343
Authors: Andreas Hofinger 
Publication date: 26 January 2007
Published in: Journal of Approximation Theory (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.jat.2006.03.016
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
- Publication:4885366
Abstract approximation theory (approximation in normed linear spaces and other abstract spaces) (41A65) Approximation by arbitrary nonlinear expressions; widths and entropy (41A46)
Cites Work
- 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
- On the mathematical foundations of learning
- Title not available (Why is that?)
- On a conjecture of Huber concerning the convergence of projection pursuit regression
- Nonlinear methods of approximation
- Some remarks on greedy algorithms
- Weak greedy algorithms
- Shannon sampling and function reconstruction from point values
- Error bounds for approximation with neural networks
- Optimal nonlinear approximation
- Rates of convex approximation in non-Hilbert spaces
- Efficient agnostic learning of neural networks with bounded fan-in
- Title not available (Why is that?)
- Generalization bounds for function approximation from scattered noisy data
- Regularized greedy algorithms for network training with data noise
- Remarks on projection pursuit regression and density estimation
- Regularized data-driven construction of fuzzy controllers
- Learning a function from noisy samples at a finite sparse set of points
- Local greedy approximation for nonlinear regression and neural network training.
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
- Approximation from noisy data
- Learning a function from noisy samples at a finite sparse set of points
- 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)
