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.
展开▼
