Storage Capacity of the Tilinglike Learning Algorithm

Details Storage Capacity of the Tilinglike Learning Algorithm Storage Capacity of the Tilinglike Learning Algorithm

2000-08-10

arxiv.org/abs/cond-mat/0008162v1

Physics

Condensed Matter

Disordered Systems and Neural Networks

Proceedings of the Conference Disordered and Complex Systems, King's College, London, July 2000. 6 pages, 1 figure, uses aippr

Scientific paper

10.1063/1.1358157

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.

Affiliated with

Also associated with

No associations

Rating

Storage Capacity of the Tilinglike Learning Algorithm does not yet have a rating. At this time, there are no reviews or comments for this scientific paper.

If you have personal experience with Storage Capacity of the Tilinglike Learning Algorithm, we encourage you to share that experience with our LandOfFree.com community. Your opinion is very important and Storage Capacity of the Tilinglike Learning Algorithm will most certainly appreciate the feedback.

Rate now

Comments { 0 }

Profile ID: LFWR-SCP-O-536009