Abstract
A learning algorithm for the two-layered committee machine is proposed. The proof of its convergence in a finite time is given. Its efficiency is compared to the simple exhaustive enumeration of the internal representations of the training set.
| Original language | English |
|---|---|
| Pages (from-to) | 153-156 |
| Number of pages | 4 |
| Journal | International journal of neural systems |
| Volume | 5 |
| Issue number | 2 |
| DOIs | |
| Publication status | Published - 1 Jan 1994 |
Fingerprint
Dive into the research topics of 'A storage algorithm for two-layered neural networks.'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver