Pruning with Replacement on Limited Resource Allocating Networks by F-Projections
Abstract
The principle of F-projection, in sequential function estimation, provides a theoretical foundation for a class of gaussian radial basis function networks known as the resource allocating networks (RAN). The ad hoc rules for adaptively changing the size of RAN architectures can be justified from a geometric growth criterion defined in the function space. In this paper, we show that the same arguments can be used to arrive at a pruning with replacement rule for RAN architectures with a limited number of units. We illustrate the algorithm on the laser time series prediction problem of the Santa Fe competition and show that results similar to those of the winners of the competition can be obtained with pruning and replacement.
Cite
Text
Molina and Niranjan. "Pruning with Replacement on Limited Resource Allocating Networks by F-Projections." Neural Computation, 1996. doi:10.1162/NECO.1996.8.4.855Markdown
[Molina and Niranjan. "Pruning with Replacement on Limited Resource Allocating Networks by F-Projections." Neural Computation, 1996.](https://mlanthology.org/neco/1996/molina1996neco-pruning/) doi:10.1162/NECO.1996.8.4.855BibTeX
@article{molina1996neco-pruning,
title = {{Pruning with Replacement on Limited Resource Allocating Networks by F-Projections}},
author = {Molina, Christophe and Niranjan, Mahesan},
journal = {Neural Computation},
year = {1996},
pages = {855-868},
doi = {10.1162/NECO.1996.8.4.855},
volume = {8},
url = {https://mlanthology.org/neco/1996/molina1996neco-pruning/}
}