arXiv · cond-mat/9809135
Statistical Features in Learning
Abstract
We study some features of learning models based on "delayed" and undifferentiated reinforcement and realized by simple algorithms which may be considered of a very elementary nature. We show that a modification of the Hebb-rule works well for this problem in a neural network realization and study numerically its convergence properties. An illustration for a more "concrete" situation is provided.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Ion-Olimpiu Stamatescu. 1998-09-30. Statistical Features in Learning. https://arxiv.org/abs/cond-mat/9809135
Cite the original work for its findings. Save a collection to share your selection of sources.