Answers are grounded in this paper and cite their sources.
An important feature of radial basis function neural networks is the existence of a fast, linear learning algorithm in a network capable of representing complex nonlinear mappings. Satisfactory generalization in these networks requires that the network mapping be sufficiently smooth. We show that a modification to the error functional allows smoothing to be introduced explicitly without significantly affecting the speed of training. A simple example is used to demonstrate the resulting improvement in the generalization properties of the network.
No takes yet. Share an insight, caveat, or question.
Chris Bishop (1991) studied this question.
Synapse has enriched 10 related papers. Consider them for comparative context: