A Three-Threshold Learning Rule Approaches the Maximal Capacity of Recurrent Neural Networks.
Understanding the theoretical foundations of how memories are encoded and retrieved in neural populations is a central challenge in neuroscience. A popular theoretical scenario for modeling memory function is the attractor neural network scenario, whose prototype is the Hopfield model. The model simplicity and the locality of the synaptic update rules come at the cost of a poor storage capacity, compared with the capacity achieved with perceptron learning algorithms. Here, by transforming the perceptron learning rule, we present an online learning rule for a recurrent neural network that achieves near-maximal storage capacity without an explicit supervisory error signal, relying only upon locally accessible information. The fully-connected network consists of excitatory binary neurons with plastic recurrent connections and non-plastic inhibitory feedback stabilizing the network dynamics; the memory patterns to be memorized are presented online as strong afferent currents, producing a bimodal distribution for the neuron synaptic inputs. Synapses corresponding to active inputs are modified as a function of the value of the local fields with respect to three thresholds. Above the highest threshold, and below the lowest threshold, no plasticity occurs. In between these two thresholds, potentiation/depression occurs when the local field is above/below an intermediate threshold. We simulated and analyzed a network of binary neurons implementing this rule and measured its storage capacity for different sizes of the basins of attraction. The storage capacity obtained through numerical simulations is shown to be close to the value predicted by analytical calculations. We also measured the dependence of capacity on the strength of external inputs. Finally, we quantified the statistics of the resulting synaptic connectivity matrix, and found that both the fraction of zero weight synapses and the degree of symmetry of the weight matrix increase with the number of stored patterns.
Human Genetics Foundation (HuGeF), Turin, Italy; DISAT, Politecnico di Torino, Turin, Italy.
Alireza
A
Alemi
Human Genetics Foundation (HuGeF), Turin, Italy; DISAT, Politecnico di Torino, Turin, Italy.
Carlo
C
Baldassi
Departments of Statistics and Neurobiology, University of Chicago, Chicago, Illinois, United States of America.
Nicolas
N
Brunel
Human Genetics Foundation (HuGeF), Turin, Italy; DISAT, Politecnico di Torino, Turin, Italy.
Riccardo
R
Zecchina
D000465:Algorithms; D019295:Computational Biology; D003198:Computer Simulation; D008568:Memory / Q000502:physiology*; D008959:Models, Neurological; D009415:Nerve Net / Q000502:physiology*; D016571:Neural Networks, Computer; D009474:Neurons / Q000502:physiology*