Neural Processing Letters

, Volume 16, Issue 2, pp 137-150

First online:

Learning-Based Complexity Evaluation of Radial Basis Function Networks

  • Kayvan NajarianAffiliated withComputer Science Department, University of North Carolina at Charlotte

Rent the article at a discount

Rent now

* Final gross prices may vary according to local VAT.

Get Access


Recently, the complexity control of dynamic neural models has gained significant attention. The performance of such a process depends highly on the applied definition of ‘model complexity’. On the other hand, the learning theory creates a framework to assess the learning properties of models. These properties include the required size of the training samples as well as the statistical confidence over the model. In this Letter, we apply the learning properties of two families of Radial Basis Function Networks (RBFN's) to introduce new complexity measures that reflect the learning properties of such neural model. Then, based on these complexity terms we define cost functions, which provide a balance between the training and testing performances of the model.

computational complexity computational learning theory empirical risk minimization algorithm Radial Basis Function Networks