Some comparisons of complexity in dictionary-based and linear computational models
From MaRDI portal
Publication:553254
DOI10.1016/j.neunet.2010.10.002zbMath1217.68184WikidataQ51635113 ScholiaQ51635113MaRDI QIDQ553254
Giorgio Gnecco, Marcello Sanguineti, Vera Kurková
Publication date: 26 July 2011
Published in: Neural Networks (Search for Journal in Brave)
Full work available at URL: https://doi.org/10.1016/j.neunet.2010.10.002
neural networks; model complexity; kernel models; linear approximation schemes; variable-basis approximation schemes; worst-case errors
68T05: Learning and adaptive systems in artificial intelligence
92B20: Neural networks for/in biological studies, artificial life and related topics
41A45: Approximation by arbitrary linear expressions
Related Items
A comparison between fixed-basis and variable-basis schemes for function approximation and functional optimization, Accuracy of approximations of solutions to Fredholm equations by kernel methods, Dynamic programming and value-function approximation in sequential decision problems: error analysis and numerical results, Smart sampling and incremental function learning for very large high dimensional data
Cites Work
- Complexity of Gaussian-radial-basis networks approximating smooth functions
- Approximation schemes for functional optimization problems
- A simple lemma on greedy approximation in Hilbert space and convergence rates for projection pursuit regression and neural network training
- Geometry and topology of continuous best and near best approximations
- Random approximants and neural networks
- A Sobolev-type upper bound for rates of approximation by linear combinations of Heaviside plane waves
- On the exponential convergence of matching pursuits in quasi-incoherent dictionaries
- Geometric Upper Bounds on Rates of Variable-Basis Approximation
- Universal approximation bounds for superpositions of a sigmoidal function
- Neural Networks for Combinatorial Optimization: A Review of More Than a Decade of Research
- Negative Theorems in Approximation Theory
- Bounds on rates of variable-basis and neural-network approximation
- Comparison of worst case errors in linear and neural network approximation
- On a Variational Norm Tailored to Variable-Basis Approximation Schemes
- Error Estimates for Approximate Optimization by the Extended Ritz Method
- Continuity of approximation by neural networks in \(L_p\) spaces
- Approximating networks and extended Ritz method for the solution of functional optimization problems
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
- Unnamed Item
