Skip to main content
Conference Proceedings

Estimates of network complexity and integral representations

Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (2008) 5163 LNCS(PART 1) 31-40
DOI: 10.1007/978-3-540-87536-9_4
2Citations
Citations of this article
1Readers
Mendeley users who have this article in their library.
Get full text

Abstract

Upper bounds on rates of approximation by neural networks are derived for functions representable as integrals in the form of networks with infinitely many units. The bounds are applied to perceptron networks. © Springer-Verlag Berlin Heidelberg 2008.

Cite

CITATION STYLE

APA

Kainen, P. C., & Kůrková, V. (2008). Estimates of network complexity and integral representations. In Lecture Notes in Computer Science (including subseries Lecture Notes in Artificial Intelligence and Lecture Notes in Bioinformatics) (Vol. 5163 LNCS, pp. 31–40). https://doi.org/10.1007/978-3-540-87536-9_4

Register to see more suggestions

Mendeley helps you to discover research relevant for your work.

Already have an account?

Save time finding and organizing research with Mendeley

Sign up for free