arXiv · cond-mat/0008162
Storage Capacity of the Tilinglike Learning Algorithm
Abstract
The storage capacity of an incremental learning algorithm for the parity machine, the Tilinglike Learning Algorithm, is analytically determined in the limit of a large number of hidden perceptrons. Different learning rules for the simple perceptron are investigated. The usual Gardner-Derrida one leads to a storage capacity close to the upper bound, which is independent of the learning algorithm considered.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Arnaud Buhot, Mirta B. Gordon. 2000-08-10. Storage Capacity of the Tilinglike Learning Algorithm. https://doi.org/10.1063/1.1358157
Cite the original work for its findings. Save a collection to share your selection of sources.