HOME HELP FEEDBACK SUBSCRIPTIONS ARCHIVE SEARCH TABLE OF CONTENTS		QUICK SEARCH:   [advanced] Author: Keyword(s): Year:  Vol:  Page:

This Article Full Text Full Text (PDF) Alert me when this article is cited Alert me if a correction is posted Services Similar articles in this journal Similar articles in PubMed Alert me to new issues of the journal Download to citation manager Citing Articles Citing Articles via HighWire Citing Articles via Google Scholar Google Scholar Articles by Schmitt, M. Search for Related Content PubMed PubMed Citation Articles by Schmitt, M.

Descartes' Rule of Signs for Radial Basis Function Neural Networks

mschmitt{at}lmi.ruhr-uni-bochum.de, Lehrstuhl Mathematik und Informatik, Fakultät für Mathematik, Ruhr-Universität Bochum, D-44780 Bochum, Germany

We establish versions of Descartes' rule of signs for radial basis function (RBF) neural networks. The RBF rules of signs provide tight bounds for the number of zeros of univariate networks with certain parameter restrictions. Moreover, they can be used to infer that the Vapnik-Chervonenkis (VC) dimension and pseudodimension of these networks are no more than linear. This contrasts with previous work showing that RBF neural networks with two or more input nodes have superlinear VC dimension. The rules also give rise to lower bounds for network sizes, thus demonstrating the relevance of network parameters for the complexity of computing with RBF neural networks.

This article has been cited by other articles:

				M. Schmitt On the Capabilities of Higher-Order Neurons: A Radial Basis Function Approach Neural Comput., March 1, 2005; 17(3): 715 - 729. [Abstract] [Full Text] [PDF]

				J. Sima and P. Orponen General-Purpose Computation with Neural Networks: A Survey of Complexity Theoretic Results Neural Comput., December 1, 2003; 15(12): 2727 - 2778. [Abstract] [Full Text] [PDF]