Adaptive genetic algorithm for the binary perceptron problem
- 7 December 1990
- journal article
- Published by IOP Publishing in Journal of Physics A: General Physics
- Vol. 23 (23) , L1265-L1271
- https://doi.org/10.1088/0305-4470/23/23/014
Abstract
For neural networks with J couplings the perceptron problem for random unbiased patterns is considered. An algorithm that uses concepts of the continuous perceptron problem as well as ideas of biological optimization is proposed and investigated. The distribution of local stabilities and the critical storage capacity alpha c are determined. While for N less than 50 the value of alpha c is approximately 0.83, the storage capacity goes down to alpha c=0.7 for N=255.Keywords
This publication has 10 references indexed in Scilit:
- Learning algorithm for a neural network with binary synapsesZeitschrift für Physik B Condensed Matter, 1990
- The AdaTron: An Adaptive Perceptron AlgorithmEurophysics Letters, 1990
- Critical storage capacity of the J = ± 1 neural networkJournal of Physics A: General Physics, 1989
- Storage capacity of memory networks with binary couplingsJournal de Physique, 1989
- Stability-capacity diagram of a neural network with Ising bondsJournal de Physique, 1989
- The space of interactions in neural network modelsJournal of Physics A: General Physics, 1988
- Maximum Storage Capacity in Neural NetworksEurophysics Letters, 1987
- Optimization by simulating molecular evolutionBiological Cybernetics, 1987
- Learning algorithms with optimal stability in neural networksJournal of Physics A: General Physics, 1987
- Storing Infinite Numbers of Patterns in a Spin-Glass Model of Neural NetworksPhysical Review Letters, 1985