A Resource-Allocating Network for Function Interpolation
John C. Platt · Neural Computation · 1991
We have created a network that allocates a new computational unit whenever an unusual pattern is presented to the network. This network forms compact representations, yet learns easily and rapidly. The network can be used at any time in the learning process and the learning patterns do not have to be repeated. The units in this network respond to only a local region of the space of input values. The network learns by allocating new units and adjusting the parameters of existing units. If the network performs poorly on a presented pattern, then a new unit is allocated that corrects the response to the presented pattern. If the network performs well on a presented pattern, then the network parameters are updated using standard LMS gradient descent. We have obtained good results with our resource-allocating network (RAN). For predicting the Mackey-Glass chaotic time series, RAN learns much faster than do those using backpropagation networks and uses a comparable number of synapses.
Cited by 1,354 works. doi:10.1162/neco.1991.3.2.213
Authors
References
- Some methods for classification and analysis of multivariate observations
- ADAPTIVE SWITCHING CIRCUITS
- Least squares quantization in PCM
- Fast Learning in Networks of Locally-Tuned Processing Units
- Radial basis functions for multivariable interpolation: a review
- Regularization Algorithms for Learning That Are Equivalent to Multilayer Networks
- Fast Learning in Multi-Resolution Hierarchies
- On the complexity of loading shallow neural networks
- A Proposal for More Powerful Learning Algorithms
- Some extensions of radial basis functions and their applications in artificial intelligence