Learning-Based Complexity Evaluation of Radial Basis Function Networks

Authors:
Kayvan Najarian
Affiliations:
Computer Science Department, University of North Carolina at Charlotte, 9201 University City Blvd, Charlotte, NC 28223, U.S.A. e-mail: knajaria@uncc.edu
Venue:
Neural Processing Letters
Year:
2002

Citing 4
Cited 1

A theory of the learnable

Communications of the ACM
The nature of statistical learning theory

The nature of statistical learning theory
Application of learning theory in neural modeling of dynamic systems

Application of learning theory in neural modeling of dynamic systems
The sample complexity of pattern classification with neural networks: the size of the weights is more important than the size of the network

IEEE Transactions on Information Theory

A Fixed-Distribution PAC Learning Theory for Neural FIR Models

Journal of Intelligent Information Systems

Quantified Score

Hi-index	0.00

Visualization

Abstract

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.