Geometric Rates of Approximation by Neural Networks

DOI10.1007/978-3-540-77566-9_47zbMath1132.68565OpenAlexW1586117775MaRDI QIDQ5448680

Vera Kurková, Marcello Sanguineti

Publication date: 7 March 2008

Published in: SOFSEM 2008: Theory and Practice of Computer Science (Search for Journal in Brave)

Full work available at URL: https://doi.org/10.1007/978-3-540-77566-9_47

Mathematics Subject Classification ID

Learning and adaptive systems in artificial intelligence (68T05)

Cites Work

• Unnamed Item
• Unnamed Item
• Unicity subspaces in \(L^ 1\)-approximation
• A simple lemma on greedy approximation in Hilbert space and convergence rates for projection pursuit regression and neural network training
• Random approximants and neural networks
• Estimates of covering numbers of convex sets with slowly decaying orthogonal subsets
• Universal approximation bounds for superpositions of a sigmoidal function
• Bounds on rates of variable-basis and neural-network approximation

This page was built for publication: Geometric Rates of Approximation by Neural Networks