Minimization of Error Functionals over Perceptron Networks
From MaRDI portal
Recommendations
Cites work
- A better approximation for balls
- A simple lemma on greedy approximation in Hilbert space and convergence rates for projection pursuit regression and neural network training
- A Sobolev-type upper bound for rates of approximation by linear combinations of Heaviside plane waves
- Approximation by superposition of sigmoidal and radial basis functions
- Approximation by superpositions of a sigmoidal function
- Best approximation by linear combinations of characteristic functions of half-spaces.
- Geometry and topology of continuous best and near best approximations
- Multilayer feedforward networks are universal approximators
- On the bent Boolean functions that are symmetric
- On the mathematical foundations of learning
- Quasiorthogonal dimension of Euclidean spaces
- Random approximants and neural networks
- Uniform approximation by neural networks
- Universal approximation bounds for superpositions of a sigmoidal function
Cited in
(7)- Training multilayer perceptrons via minimization of sum of ridge functions
- Complexity estimates based on integral transforms induced by computational units
- Simultaneous Approximations of Polynomials and Derivatives and Their Applications to Neural Networks
- Estimates of Data Complexity in Neural-Network Learning
- Saturated perceptrons for maximum margin and minimum misclassification error
- Lower bounds for artificial neural network approximations: a proof that shallow neural networks fail to overcome the curse of dimensionality
- Complexity of Gaussian-radial-basis networks approximating smooth functions
This page was built for publication: Minimization of Error Functionals over Perceptron Networks
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q3539962)
