login

An Exactly Solvable Asymmetric Neural Network Model

Europhysics Letters (EPL)Published 15 July 1987Open access
Bernard Derrida, E. Gardner, Alfred Zippelius
Citations552
View PDF

TL;DR

A diluted and nonsymmetric version of the Little-Hopfield model is considered which can be solved exactly and it is shown that even when the system remembers, two different configurations which remain close to the same pattern never become identical.

Abstract

We consider a diluted and nonsymmetric version of the Little-Hopfield model which can be solved exactly. We obtain the analytic expression of the evolution of one configuration having a finite overlap on one stored pattern. We show that even when the system remembers, two different configurations which remain close to the same pattern never become identical. Lastly, we show that when two stored patterns are correlated, there exists a regime for which the system remembers these patterns without being able to distinguish them.

Keywords

Computer ScienceNeuroscience