Self-organization and associative memory: 3rd edition
Self-organization and associative memory: 3rd edition
Neural computation and self-organizing maps: an introduction
Neural computation and self-organizing maps: an introduction
About the Kohonen algorithm: strong or weak self-organization?
Neural Networks
Neural Networks: A Comprehensive Foundation
Neural Networks: A Comprehensive Foundation
| Hi-index | 0.00 |
The goal of most learning processes is to bring a machine into a set of "correct" states. In practice, however, it may be difficult to show that the process enters this target set. We present a condition that ensures that the process visits the target set infinitely often almost surely. This condition is easy to verify and is true for many well-known learning rules. To demonstrate the utility of this method, we apply it to four types of learning processes: the perceptron, learning rules governed by continuous energy functions, the Kohonen rule, and the committee machine.