Minimization of Error Functionals over Perceptron Networks | Citedby Results | Neural Computation | MIT Press

Skip to Main Content

Skip Nav Destination

Minimization of Error Functionals over Perceptron Networks

Neural Computation (2008) 20 (1): 252–270.

This article has been cited by the following articles in journals that are participating in Crossref Cited-by Linking.

Lower bounds for artificial neural network approximations: A proof that shallow neural networks fail to overcome the curse of dimensionality

Philipp Grohs
Shokhrukh Ibragimov
Arnulf Jentzen
Sarah Koppensteiner

Journal of Complexity (2023) 77: 101746.

Efficient Approximation of High-Dimensional Functions With Neural Networks

Patrick Cheridito
Arnulf Jentzen
Florian Rossmannek

IEEE Transactions on Neural Networks and Learning Systems (2022) 33 (7): 3079.

Constructive lower bounds on model complexity of shallow perceptron networks

Věra Kůrková

Neural Computing and Applications (2018) 29 (7): 305.

Model complexities of shallow networks representing highly varying functions

Věra Kůrková
Marcello Sanguineti

Neurocomputing (2016) 171: 598.

Dependence of Computational Models on Input Dimension: Tractability of Approximation and Optimization Tasks

Paul C. Kainen
Věra Kurkova
Marcello Sanguineti

IEEE Transactions on Information Theory (2012) 58 (2): 1203.

Complexity estimates based on integral transforms induced by computational units

Věra Kůrková

Neural Networks (2012) 33: 160.

Complexity of Gaussian-radial-basis networks approximating smooth functions

Paul C. Kainen
Věra Kůrková
Marcello Sanguineti

Journal of Complexity (2009) 25 (1): 63.

Simultaneous Approximations of Polynomials and Derivatives and Their Applications to Neural Networks

Yoshifusa Ito

Neural Computation (2008) 20 (11): 2757.