Convergence analysis of convex incremental neural networks
From MaRDI portal
Publication:1029589
DOI10.1007/S10472-008-9097-2zbMath1176.68156OpenAlexW1974787906MaRDI QIDQ1029589
Publication date: 13 July 2009
Published in: Annals of Mathematics and Artificial Intelligence (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1007/s10472-008-9097-2
Learning and adaptive systems in artificial intelligence (68T05) Asymptotic approximations, asymptotic expansions (steepest descent, etc.) (41A60)
Uses Software
Cites Work
- Unnamed Item
- A simple lemma on greedy approximation in Hilbert space and convergence rates for projection pursuit regression and neural network training
- On the near optimality of the stochastic approximation of smooth functions by neural networks
- A Sequential Learning Scheme for Function Approximation Using Minimal Radial Basis Function Neural Networks
- Universal approximation bounds for superpositions of a sigmoidal function
- Asymptotic distribution of the errors in scalar and vector quantizers
This page was built for publication: Convergence analysis of convex incremental neural networks