Hopfield network explained

A Hopfield network (associative memory or Ising–Lenz–Little model or Nakano-Amari-Hopfield network) is a spin glass system used to model neural networks, based on Ernst Ising's work with Wilhelm Lenz on the Ising model of magnetic materials.^[1] Hopfield networks were first described with respect to recurrent neural networks independently by Kaoru Nakano in 1971 ^{[2] [3]} and Shun'ichi Amari in 1972,^{[4] [5]} and with respect to biological neural networks by William Little in 1974,^[6] and were popularised by John Hopfield in 1982.^[7] Hopfield networks serve as content-addressable ("associative") memory systems with binary threshold nodes, or with continuous variables. Hopfield networks also provide a model for understanding human memory.^{[8] [9]}

History

The Ising model itself was published in 1920s as a model of magnetism, however it studied at the thermal equilibrium, which does not change with time. Glauber in 1963 studied the Ising model evolving in time, as a process towards thermal equilibrium (Glauber dynamics), adding in the component of time.^[10]

The second component to be added was adaptation to stimulus. Shun'ichi Amari in 1972 proposed to modify the weights of an Ising model by Hebbian learning rule as a model of associative memory. The same idea was published by in 1974, who was acknowledged by Hopfield in his 1982 paper. The Sherrington–Kirkpatrick model of spin glass, published in 1975, is the Hopfield network with random initialization. Sherrington and Kirkpatrick found that it is highly likely for the energy function of the SK model to have many local minima.

Networks with continuous dynamics were developed by Hopfield in his 1984 paper. A major advance in memory storage capacity was developed by Krotov and Hopfield in 2016 through a change in network dynamics and energy function. This idea was further extended by Demircigil and collaborators in 2017. The continuous dynamics of large memory capacity models was developed in a series of papers between 2016 and 2020. Large memory storage capacity Hopfield Networks are now called Dense Associative Memories or modern Hopfield networks.

Structure

The units in Hopfield nets are binary threshold units, i.e. the units only take on two different values for their states, and the value is determined by whether or not the unit's input exceeds its threshold

U _{i} . Discrete Hopfield nets describe relationships between binary (firing or not-firing) neurons 1 , 2 ,\ldots,i,j,\ldots,N . At a certain time, the state of the neural net is described by a vector V , which records which neurons are firing in a binary word of N bits.

The interactions

w _{ij} between neurons have units that usually take on values of 1 or −1, and this convention will be used throughout this article. However, other literature might use units that take values of 0 and 1. These interactions are "learned" via Hebb's law of association, such that, for a certain state V ^{s} and distinct nodes i,j w _{ij} = V ^{s} _{i} V ^{s} _{j}

but

w _{ii} = 0 .

(Note that the Hebbian learning rule takes the form

w _{ij} = ( 2 V ^{s} _{i} - 1 )( 2 V ^{s} _{j} -1 ) when the units assume values in \{ 0 , 1 \} .)

Once the network is trained,

w _{ij} no longer evolve. If a new state of neurons V ^{s'} is introduced to the neural network, the net acts on neurons such thatV ^{s'} _{i} → 1 if \sum _{j} w _{ij} V ^{s'} _{j} > U _{i} V ^{s'} _{i} → -1 if \sum _{j} w _{ij} V ^{s'} _{j} < U _{i}

where

U _{i} is the threshold value of the i'th neuron (often taken to be 0).^[11] In this way, Hopfield networks have the ability to "remember" states stored in the interaction matrix, because if a new state V ^{s'} is subjected to the interaction matrix, each neuron will change until it matches the original state V ^{s} (see the Updates section below).

The connections in a Hopfield net typically have the following restrictions:

w _{ii} =0 , \forall i (no unit has a connection with itself)w _{ij} = w _{ji} , \forall i,j (connections are symmetric)

The constraint that weights are symmetric guarantees that the energy function decreases monotonically while following the activation rules.^[12] A network with asymmetric weights may exhibit some periodic or chaotic behaviour; however, Hopfield found that this behavior is confined to relatively small parts of the phase space and does not impair the network's ability to act as a content-addressable associative memory system.

Hopfield also modeled neural nets for continuous values, in which the electric output of each neuron is not binary but some value between 0 and 1.^[13] He found that this type of network was also able to store and reproduce memorized states.

Notice that every pair of units i and j in a Hopfield network has a connection that is described by the connectivity weight

w _{ij} . In this sense, the Hopfield network can be formally described as a complete undirected graph G = \langle V, f\rangle , where V is a set of McCulloch–Pitts neurons and f:V ^{2} → R is a function that links pairs of units to a real value, the connectivity weight.

Updating

Updating one unit (node in the graph simulating the artificial neuron) in the Hopfield network is performed using the following rule:

s _{i} \leftarrow \left\{\begin{array}{ll} +1 & if \sum _{j} {w _{ij} s _{j}\geq\theta} _{i,} \\ -1 & otherwise. \end{array}\right.

where:

w _{ij} is the strength of the connection weight from unit j to unit i (the weight of the connection).s _{i} is the state of unit i.\theta _{i} is the threshold of unit i.

Updates in the Hopfield network can be performed in two different ways:

• Asynchronous: Only one unit is updated at a time. This unit can be picked at random, or a pre-defined order can be imposed from the very beginning.
• Synchronous: All units are updated at the same time. This requires a central clock to the system in order to maintain synchronization. This method is viewed by some as less realistic, based on an absence of observed global clock influencing analogous biological or physical systems of interest.

Neurons "attract or repel each other" in state space

The weight between two units has a powerful impact upon the values of the neurons. Consider the connection weight

w _{ij} between two neurons i and j. If w _{ij} > 0 , the updating rule implies that:

• when

s _{j} = 1 , the contribution of j in the weighted sum is positive. Thus, s _{i} is pulled by j towards its value s _{i} = 1

• when

s _{j} = -1 , the contribution of j in the weighted sum is negative. Then again, s _{i} is pushed by j towards its value s _{i} = -1

Thus, the values of neurons i and j will converge if the weight between them is positive. Similarly, they will diverge if the weight is negative.

Working principles of discrete and continuous Hopfield networks

Bruck shed light on the behavior of a neuron in the discrete Hopfield network when proving its convergence in his paper in 1990.^[14]   A subsequent paper further investigated the behavior of any neuron in both discrete-time and continuous-time Hopfield networks when the corresponding energy function is minimized during an optimization process. Bruck shows^[14] that neuron j changes its state if and only if it further decreases the following biased pseudo-cut. The discrete Hopfield network minimizes the following biased pseudo-cut for the synaptic weight matrix of the Hopfield net.

J _{pseudo-cut} (k) = \sum _{i \in C _{1(k)}} \sum _{j \in C _{2(k)}} w _{ij} + \sum _{j \in C _{1(k)}} {\theta _{j}}

where

C _{1(k)} and C _{2(k)} represents the set of neurons which are −1 and +1, respectively, at time k . For further details, see the recent paper.

The discrete-time Hopfield Network always minimizes exactly the following pseudo-cut

U(k) = \sum ^{N} _{i =1} \sum ^{N} _{j =1} w _{ij} ( s _{i(k)} - s _{j(k)} ) ^{2} + 2 \sum ^{N} _{j =1} \theta _{j} s _{j(k)}

The continuous-time Hopfield network always minimizes an upper bound to the following weighted cut

V(t) = \sum ^{N} _{i =1} \sum ^{N} _{j =1} w _{ij} ( f(s _{i(t))} - f(s _{j(t)} ) ^{2} + 2 \sum ^{N} _{j =1} \theta _{j} f(s _{j(t))}

where

f( ⋅ ) is a zero-centered sigmoid function.

The complex Hopfield network, on the other hand, generally tends to minimize the so-called shadow-cut of the complex weight matrix of the net.^[15]

Energy

Hopfield nets have a scalar value associated with each state of the network, referred to as the "energy", E, of the network, where:

E =- (12 \sum)/(_{i,j}) w _{ij} s _{i} s _{j} - \sum _{i} \theta _{i} s _{i}

This quantity is called "energy" because it either decreases or stays the same upon network units being updated. Furthermore, under repeated updating the network will eventually converge to a state which is a local minimum in the energy function (which is considered to be a Lyapunov function). Thus, if a state is a local minimum in the energy function it is a stable state for the network. Note that this energy function belongs to a general class of models in physics under the name of Ising models; these in turn are a special case of Markov networks, since the associated probability measure, the Gibbs measure, has the Markov property.

Hopfield network in optimization

Hopfield and Tank presented the Hopfield network application in solving the classical traveling-salesman problem in 1985.^[16] Since then, the Hopfield network has been widely used for optimization. The idea of using the Hopfield network in optimization problems is straightforward: If a constrained/unconstrained cost function can be written in the form of the Hopfield energy function E, then there exists a Hopfield network whose equilibrium points represent solutions to the constrained/unconstrained optimization problem.  Minimizing the Hopfield energy function both minimizes the objective function and satisfies the constraints also as the constraints are “embedded” into the synaptic weights of the network. Although including the optimization constraints into the synaptic weights in the best possible way is a challenging task, many difficult optimization problems with constraints in different disciplines have been converted to the Hopfield energy function: Associative memory systems, Analog-to-Digital conversion, job-shop scheduling problem, quadratic assignment and other related NP-complete problems, channel allocation problem in wireless networks, mobile ad-hoc network routing problem, image restoration, system identification, combinatorial optimization, etc, just to name a few. Further details can be found in e.g. the paper.^[17]

Initialization and running

Initialization of the Hopfield networks is done by setting the values of the units to the desired start pattern. Repeated updates are then performed until the network converges to an attractor pattern. Convergence is generally assured, as Hopfield proved that the attractors of this nonlinear dynamical system are stable, not periodic or chaotic as in some other systems. Therefore, in the context of Hopfield networks, an attractor pattern is a final stable state, a pattern that cannot change any value within it under updating.

Training

Training a Hopfield net involves lowering the energy of states that the net should "remember". This allows the net to serve as a content addressable memory system, that is to say, the network will converge to a "remembered" state if it is given only part of the state. The net can be used to recover from a distorted input to the trained state that is most similar to that input. This is called associative memory because it recovers memories on the basis of similarity. For example, if we train a Hopfield net with five units so that the state (1, −1, 1, −1, 1) is an energy minimum, and we give the network the state (1, −1, −1, −1, 1) it will converge to (1, −1, 1, −1, 1). Thus, the network is properly trained when the energy of states which the network should remember are local minima. Note that, in contrast to Perceptron training, the thresholds of the neurons are never updated.

Learning rules

There are various different learning rules that can be used to store information in the memory of the Hopfield network. It is desirable for a learning rule to have both of the following two properties:

• Local: A learning rule is local if each weight is updated using information available to neurons on either side of the connection that is associated with that particular weight.
• Incremental: New patterns can be learned without using information from the old patterns that have been also used for training. That is, when a new pattern is used for training, the new values for the weights only depend on the old values and on the new pattern.

These properties are desirable, since a learning rule satisfying them is more biologically plausible. For example, since the human brain is always learning new concepts, one can reason that human learning is incremental. A learning system that was not incremental would generally be trained only once, with a huge batch of training data.

Hebbian learning rule for Hopfield networks

Hebbian theory was introduced by Donald Hebb in 1949 in order to explain "associative learning," in which simultaneous activation of neuron cells leads to pronounced increases in synaptic strength between those cells. It is often summarized as "Neurons that fire together wire together. Neurons that fire out of sync fail to link".

The Hebbian rule is both local and incremental. For the Hopfield networks, it is implemented in the following manner when learning

n binary patterns:w _{ij} = (1)/(n) \sum ^{n} _{\mu =1} \epsilon ^{\mu} _{i} \epsilon ^{\mu} _{j}

where

\epsilon ^{\mu} _{i} represents bit i from pattern \mu .

If the bits corresponding to neurons i and j are equal in pattern

\mu , then the product \epsilon ^{\mu} _{i} \epsilon ^{\mu} _{j} will be positive. This would, in turn, have a positive effect on the weight w _{ij} and the values of i and j will tend to become equal. The opposite happens if the bits corresponding to neurons i and j are different.

Storkey learning rule

This rule was introduced by Amos Storkey in 1997 and is both local and incremental. Storkey also showed that a Hopfield network trained using this rule has a greater capacity than a corresponding network trained using the Hebbian rule.^[18] The weight matrix of an attractor neural network is said to follow the Storkey learning rule if it obeys:

w ^{\nu} _{ij} = w ^{\nu -1} _{ij} + (1)/(n) \epsilon ^{\nu} _{i} \epsilon ^{\nu} _{j} - (1)/(n) \epsilon ^{\nu} _{i} h ^{\nu} _{ji} - (1)/(n) \epsilon ^{\nu} _{j} h ^{\nu} _{ij}

where

h ^{\nu} _{ij} = \sum ^{n} _{k =1 ~:~i ≠ k ≠ j} w ^{\nu -1} _{ik} \epsilon ^{\nu} _{k} is a form of local field^[19] at neuron i. This learning rule is local, since the synapses take into account only neurons at their sides. The rule makes use of more information from the patterns and weights than the generalized Hebbian rule, due to the effect of the local field.

Spurious patterns

Patterns that the network uses for training (called retrieval states) become attractors of the system. Repeated updates would eventually lead to convergence to one of the retrieval states. However, sometimes the network will converge to spurious patterns (different from the training patterns). The energy in these spurious patterns is also a local minimum. For each stored pattern x, the negation -x is also a spurious pattern.

A spurious state can also be a linear combination of an odd number of retrieval states. For example, when using 3 patterns

\mu _{1,} \mu _{2,} \mu _{3} , one can get the following spurious state:\epsilon ^{\rm{mix} _{i} } = \pm \sgn(\pm \epsilon_^ \pm \epsilon_^ \pm \epsilon_^)

Spurious patterns that have an even number of states cannot exist, since they might sum up to zero

Capacity

The Network capacity of the Hopfield network model is determined by neuron amounts and connections within a given network. Therefore, the number of memories that are able to be stored is dependent on neurons and connections. Furthermore, it was shown that the recall accuracy between vectors and nodes was 0.138 (approximately 138 vectors can be recalled from storage for every 1000 nodes) (Hertz et al., 1991). Therefore, it is evident that many mistakes will occur if one tries to store a large number of vectors. When the Hopfield model does not recall the right pattern, it is possible that an intrusion has taken place, since semantically related items tend to confuse the individual, and recollection of the wrong pattern occurs. Therefore, the Hopfield network model is shown to confuse one stored item with that of another upon retrieval. Perfect recalls and high capacity, >0.14, can be loaded in the network by Storkey learning method; ETAM,^{[20] [21]} ETAM experiments also in.^[22] Ulterior models inspired by the Hopfield network were later devised to raise the storage limit and reduce the retrieval error rate, with some being capable of one-shot learning.^[23]

The storage capacity can be given as

C \cong (n)/(2log _{2n}) where n is the number of neurons in the net.

Human memory

The Hopfield model accounts for associative memory through the incorporation of memory vectors. Memory vectors can be slightly used, and this would spark the retrieval of the most similar vector in the network. However, we will find out that due to this process, intrusions can occur. In associative memory for the Hopfield network, there are two types of operations: auto-association and hetero-association. The first being when a vector is associated with itself, and the latter being when two different vectors are associated in storage. Furthermore, both types of operations are possible to store within a single memory matrix, but only if that given representation matrix is not one or the other of the operations, but rather the combination (auto-associative and hetero-associative) of the two.

Hopfield's network model utilizes the same learning rule as Hebb's (1949) learning rule, which characterised learning as being a result of the strengthening of the weights in cases of neuronal activity.

Rizzuto and Kahana (2001) were able to show that the neural network model can account for repetition on recall accuracy by incorporating a probabilistic-learning algorithm. During the retrieval process, no learning occurs. As a result, the weights of the network remain fixed, showing that the model is able to switch from a learning stage to a recall stage. By adding contextual drift they were able to show the rapid forgetting that occurs in a Hopfield model during a cued-recall task. The entire network contributes to the change in the activation of any single node.

McCulloch and Pitts' (1943) dynamical rule, which describes the behavior of neurons, does so in a way that shows how the activations of multiple neurons map onto the activation of a new neuron's firing rate, and how the weights of the neurons strengthen the synaptic connections between the new activated neuron (and those that activated it). Hopfield would use McCulloch–Pitts's dynamical rule in order to show how retrieval is possible in the Hopfield network. However, Hopfield would do so in a repetitious fashion. Hopfield would use a nonlinear activation function, instead of using a linear function. This would therefore create the Hopfield dynamical rule and with this, Hopfield was able to show that with the nonlinear activation function, the dynamical rule will always modify the values of the state vector in the direction of one of the stored patterns.

Dense associative memory or modern Hopfield network

Hopfield networks are recurrent neural networks with dynamical trajectories converging to fixed point attractor states and described by an energy function. The state of each model neuron $i$ is defined by a time-dependent variable

V _{i} , which can be chosen to be either discrete or continuous. A complete model describes the mathematics of how the future state of activity of each neuron depends on the known present or previous activity of all the neurons.

In the original Hopfield model of associative memory, the variables were binary, and the dynamics were described by a one-at-a-time update of the state of the neurons. An energy function quadratic in the

V _{i} was defined, and the dynamics consisted of changing the activity of each single neuron i only if doing so would lower the total energy of the system. This same idea was extended to the case of V _{i} being a continuous variable representing the output of neuron i , and V _{i} being a monotonic function of an input current. The dynamics became expressed as a set of first-order differential equations for which the "energy" of the system always decreased.  The energy in the continuous case has one term which is quadratic in the V _{i} (as in the binary model), and a second term which depends on the gain function (neuron's activation function). While having many desirable properties of associative memory, both of these classical systems suffer from a small memory storage capacity, which scales linearly with the number of input features. In contrast, by increasing the number of parameters in the model so that there are not just pair-wise but also higher-order interactions between the neurons, one can increase the memory storage capacity. ^{[24] [25]}

Dense Associative Memories^[26] (also known as the modern Hopfield networks^[27]) are generalizations of the classical Hopfield Networks that break the linear scaling relationship between the number of input features and the number of stored memories. This is achieved by introducing stronger non-linearities (either in the energy function or neurons’ activation functions) leading to super-linear (even an exponential^[28]) memory storage capacity as a function of the number of feature neurons, in effect increasing the order of interactions between the neurons. The network still requires a sufficient number of hidden neurons.^[29]

The key theoretical idea behind dense associative memory networks is to use an energy function and an update rule that is more sharply peaked around the stored memories in the space of neuron’s configurations compared to the classical model, as demonstrated when the higher-order interactions and subsequent energy landscapes are explicitly modelled.

Discrete variables

V _{i} that represent the active V _{i=+1} and inactive V _{i=-1} state of the model neuron i .$$E\; =\; -\; \backslash sum\backslash limits\_^\; F\backslash Big(\backslash sum\backslash limits\_^\backslash xi\_\; V\_i\backslash Big)$$In this formula the weights $\backslash xi\_$ represent the matrix of memory vectors (index \mu = 1 ...N _{mem} enumerates different memories, and index i =1 ...N _{f} enumerates the content of each memory corresponding to the i -th feature neuron), and the function F(x) is a rapidly growing non-linear function. The update rule for individual neurons (in the asynchronous case) can be written in the following form $$V^\_i\; =\; Sign\backslash bigg[\backslash sum\backslash limits\_\{\backslash mu=1\}^\{N\_\backslash text\{mem\}\}\; \backslash bigg(F\backslash Big(\backslash xi\_\{\backslash mu\; i\}\; +\; \backslash sum\backslash limits\_\{j\backslash neq\; i\}\backslash xi\_\{\backslash mu\; j\}\; V^\{(t)\}\_j\backslash Big)\; -\; F\backslash Big(-\backslash xi\_\{\backslash mu\; i\}\; +\; \backslash sum\backslash limits\_\{j\backslash neq\; i\}\backslash xi\_\{\backslash mu\; j\}\; V^\{(t)\}\_j\backslash Big)\; \backslash bigg)\backslash bigg]$$which states that in order to calculate the updated state of the $i$-th neuron the network compares two energies: the energy of the network with the i -th neuron in the ON state and the energy of the network with the i -th neuron in the OFF state, given the states of the remaining neuron. The updated state of the i -th neuron selects the state that has the lowest of the two energies.

In the limiting case when the non-linear energy function is quadratic

F(x) = x ^{2} these equations reduce to the familiar energy function and the update rule for the classical binary Hopfield Network.

The memory storage capacity of these networks can be calculated for random binary patterns. For the power energy function

F(x) = x ^{n} the maximal number of memories that can be stored and retrieved from this network without errors is given by$$N^\_\backslash approx\; \backslash frac\; \backslash frac$$For an exponential energy function $F(x)=e^x$ the memory storage capacity is exponential in the number of feature neurons$$N^\_\backslash approx\; 2^$$

Continuous variables

Modern Hopfield networks or dense associative memories can be best understood in continuous variables and continuous time. Consider the network architecture, shown in Fig.1, and the equations for neuron's states evolutionwhere the currents of the feature neurons are denoted by $x\_i$, and the currents of the memory neurons are denoted by

h _{\mu} (h stands for hidden neurons). There are no synaptic connections among the feature neurons or the memory neurons. A matrix \xi _{\mu} denotes the strength of synapses from a feature neuron i to the memory neuron \mu . The synapses are assumed to be symmetric, so that the same value characterizes a different physical synapse from the memory neuron \mu to the feature neuron i . The outputs of the memory neurons and the feature neurons are denoted by f _{\mu} and g _{i} , which are non-linear functions of the corresponding currents. In general these outputs can depend on the currents of all the neurons in that layer so that f _{\mu} = f(\{h _{\mu\})} and $g\_i\; =\; g(\backslash )$. It is convenient to define these activation functions as derivatives of the Lagrangian functions for the two groups of neuronsThis way the specific form of the equations for neuron's states is completely defined once the Lagrangian functions are specified. Finally, the time constants for the two groups of neurons are denoted by \tau _{f} and \tau _{h} , I _{i} is the input current to the network that can be driven by the presented data.  General systems of non-linear differential equations can have many complicated behaviors that can depend on the choice of the non-linearities and the initial conditions. For Hopfield Networks, however, this is not the case - the dynamical trajectories always converge to a fixed point attractor state. This property is achieved because these equations are specifically engineered so that they have an underlying energy function The terms grouped into square brackets represent a Legendre transform of the Lagrangian function with respect to the states of the neurons. If the Hessian matrices of the Lagrangian functions are positive semi-definite, the energy function is guaranteed to decrease on the dynamical trajectory This property makes it possible to prove that the system of dynamical equations describing temporal evolution of neurons' activities will eventually reach a fixed point attractor state.

In certain situations one can assume that the dynamics of hidden neurons equilibrates at a much faster time scale compared to the feature neurons, $\backslash tau\_h\backslash ll\backslash tau\_f$. In this case the steady state solution of the second equation in the system can be used to express the currents of the hidden units through the outputs of the feature neurons. This makes it possible to reduce the general theory to an effective theory for feature neurons only. The resulting effective update rules and the energies for various common choices of the Lagrangian functions are shown in Fig.2. In the case of log-sum-exponential Lagrangian function the update rule (if applied once) for the states of the feature neurons is the attention mechanism commonly used in many modern AI systems (see Ref. for the derivation of this result from the continuous time formulation).

Relationship to classical Hopfield network with continuous variables

Classical formulation of continuous Hopfield Networks can be understood as a special limiting case of the modern Hopfield networks with one hidden layer. Continuous Hopfield Networks for neurons with graded response are typically described by the dynamical equations and the energy function where $V\_i\; =\; g(x\_i)$, and

g ^{-1} (z) is the inverse of the activation function g(x) . This model is a special limit of the class of models that is called models A, with the following choice of the Lagrangian functions that, according to the definition, leads to the activation functions If we integrate out the hidden neurons the system of equations reduces to the equations on the feature neurons with T _{ij} = \sum\limits ^{N _{h}} _{\mu =1} \xi _{\mu} \xi _{\mu} , and the general expression for the energy reduces to the effective energy While the first two terms in equation are the same as those in equation, the third terms look superficially different. In equation it is a Legendre transform of the Lagrangian for the feature neurons, while in the third term is an integral of the inverse activation function. Nevertheless, these two expressions are in fact equivalent, since the derivatives of a function and its Legendre transform are inverse functions of each other. The easiest way to see that these two terms are equal explicitly is to differentiate each one with respect to x _{i} . The results of these differentiations for both expressions are equal to x _{i} g(x _{i)'} . Thus, the two expressions are equal up to an additive constant. This completes the proof that the classical Hopfield Network with continuous states is a special limiting case of the modern Hopfield network with energy .

General formulation of the modern Hopfield network

Biological neural networks have a large degree of heterogeneity in terms of different cell types. This section describes a mathematical model of a fully connected modern Hopfield network assuming the extreme degree of heterogeneity: every single neuron is different. Specifically, an energy function and the corresponding dynamical equations are described assuming that each neuron has its own activation function and kinetic time scale.  The network is assumed to be fully connected, so that every neuron is connected to every other neuron using a symmetric matrix of weights

W _{IJ} , indices I and J enumerate different neurons in the network, see Fig.3. The easiest way to mathematically formulate this problem is to define the architecture through a Lagrangian function L(\{x _{I\})} that depends on the activities of all the neurons in the network. The activation function for each neuron is defined as a partial derivative of the Lagrangian  with respect to that neuron's activity From the biological perspective one can think about g _{I} as an axonal output of the neuron I . In the simplest case, when the Lagrangian is additive for different neurons, this definition results in the activation that is a non-linear function of that neuron's activity. For non-additive Lagrangians this activation function can depend on the activities of a group of neurons. For instance, it can contain contrastive (softmax) or divisive normalization. The dynamical equations describing temporal evolution of a given neuron are given by This equation belongs to the class of models called firing rate models in neuroscience. Each neuron I collects the axonal outputs g _{J} from all the neurons, weights them with the synaptic coefficients W _{IJ} and produces its own time-dependent activity x _{I} . The temporal evolution has a time constant \tau _{I} , which in general can be different for every neuron. This network has a global energy function where the first two terms represent the Legendre transform of the Lagrangian function with respect to the neurons' currents x _{I} . The temporal derivative of this energy function can be computed on the dynamical trajectories leading to (see ^[30] for details) The last inequality sign holds provided that the matrix M _{IK} (or its symmetric part) is positive semi-definite. If, in addition to this, the energy function is bounded from below the non-linear dynamical equations are guaranteed to converge to a fixed point attractor state. The advantage of formulating this network in terms of the Lagrangian functions is that it makes it possible to easily experiment with different choices of the activation functions and different architectural arrangements of neurons. For all those flexible choices the conditions of convergence are determined by the properties of the matrix M _{IJ} and the existence of the lower bound on the energy function.

Hierarchical associative memory network

The neurons can be organized in layers so that every neuron in a given layer has the same activation function and the same dynamic time scale. If we assume that there are no horizontal connections between the neurons within the layer (lateral connections) and there are no skip-layer connections, the general fully connected network, reduces to the architecture shown in Fig.4. It has

N _{layer} layers of recurrently connected neurons with the states described by continuous variables x ^{A} _{i} and the activation functions g ^{A} _{i} , index A enumerates the layers of the network, and index i enumerates individual neurons in that layer. The activation functions can depend on the activities of all the neurons in the layer. Every layer can have a different number of neurons N _{A} . These neurons are recurrently connected with the neurons in the preceding and the subsequent layers. The matrices of weights that connect neurons in layers A and B are denoted by \xi ^{(A,B)} _{ij} (the order of the upper indices for weights is the same as the order of the lower indices, in the example above this means that the index i enumerates neurons in the layer A , and index j enumerates neurons in the layer B ). The feedforward weights and the feedback weights are equal. The dynamical equations for the neurons' states can be written as with boundary conditions The main difference between these equations and those from the conventional feedforward networks is the presence of the second term, which is responsible for the feedback from higher layers. These top-down signals help neurons in lower layers to decide on their response to the presented stimuli. Following the general recipe it is convenient to introduce a Lagrangian function L ^{A(\{x} ^{A} ^{i\})} for the A -th hidden layer, which depends on the activities of all the neurons in that layer. The activation functions in that layer can be defined as partial derivatives of the Lagrangian With these definitions the energy (Lyapunov) function is given by If the Lagrangian functions, or equivalently the activation functions, are chosen in such a way that the Hessians for each layer are positive semi-definite and the overall energy is bounded from below, this system is guaranteed to converge to a fixed point attractor state. The temporal derivative of this energy function is given by Thus, the hierarchical layered network is indeed an attractor network with the global energy function. This network is described by a hierarchical set of synaptic weights that can be learned for each specific problem.

See also

• Associative memory (disambiguation)
• Autoassociative memory
• Boltzmann machine – like a Hopfield net but uses annealed Gibbs sampling instead of gradient descent
• Dynamical systems model of cognition
• Ising model
• Hebbian theory

References

• Book: Hebb, D.O. . The Organization of Behavior: A Neuropsychological Theory . 2005 . Psychology Press . 978-1-135-63190-1 . 1949 . .
• Book: Hertz, John A. . Introduction To The Theory Of Neural Computation . 2018 . CRC Press . 978-0-429-96821-1 . 1991 . .
• McCulloch . W.S. . Pitts . W.H. . 1943 . A logical calculus of the ideas immanent in nervous activity . Bulletin of Mathematical Biophysics . 5 . 4. 115–133 . 10.1007/BF02478259 .
• Polyn . S.M. . Kahana . M.J. . 2008 . Memory search and the neural representation of context . Trends in Cognitive Sciences . 12 . 1. 24–30 . 10.1016/j.tics.2007.10.010. 18069046 . 2839453 .
• Rizzuto . D.S. . Kahana . M.J. . 7675117 . 2001 . An autoassociative neural network model of paired-associate learning . Neural Computation . 13 . 9. 2075–2092 . 10.1162/089976601750399317. 11516358 . 10.1.1.45.7929 .
• Book: Rudolf . Kruse . Christian . Borgelt . Frank . Klawonn . Christian . Moewes . Matthias . Steinbrecher . Pascal . Held . Computational Intelligence: A Methodological Introduction . 2013 . Springer . 978-1-4471-5013-8.

External links

• Book: Rojas, Raul . http://page.mi.fu-berlin.de/rojas/neural/chapter/K13.pdf . 13. The Hopfield model . Neural Networks – A Systematic Introduction . 12 July 1996 . Springer . 978-3-540-60505-8.
• Hopfield Network Javascript
• The Travelling Salesman Problem – Hopfield Neural Network JAVA Applet
• Scholarpedia . Hopfield network . John . Hopfield. 2007 . 2 . 5 . 1977 . 10.4249/scholarpedia.1977 . 2007SchpJ...2.1977H . free .
• Web site: Hopfield Network Learning Using Deterministic Latent Variables . Tutorial . Tristan . Fletcher. https://web.archive.org/web/20111005202201/http://www.tristanfletcher.co.uk/DLVHopfield.pdf . 2011-10-05 .

Notes and References

1. 10.1103/RevModPhys.39.883. History of the Lenz-Ising Model. 1967. Brush. Stephen G.. Reviews of Modern Physics. 39. 4. 883–893. 1967RvMP...39..883B.
2. Nakano . Kaoru . Learning Process in a Model of Associative Memory . Pattern Recognition and Machine Learning . 1971. 172–186 . 10.1007/978-1-4615-7566-5_15 . 978-1-4615-7568-9 .
3. Nakano . Kaoru . Associatron-A Model of Associative Memory. IEEE Transactions on Systems, Man, and Cybernetics . 1972 . SMC-2 . 3. 380–388 . 10.1109/TSMC.1972.4309133 .
4. Amari . Shun-Ichi . Learning patterns and pattern sequences by self-organizing nets of threshold elements. IEEE Transactions . 1972 . C . 21 . 1197–1206 .
5. Schmidhuber. Juergen. 2022. Annotated History of Modern AI and Deep Learning . cs.NE. 2212.11279.
6. W. A. . Little . The Existence of Persistent States in the Brain . Mathematical Biosciences . 19 . 1–2 . 1974 . 101–120 . 10.1016/0025-5564(74)90031-5 .
7. Hopfield . J. J. . Neural networks and physical systems with emergent collective computational abilities . Proceedings of the National Academy of Sciences. 1982 . 79 . 8 . 2554–2558 . 10.1073/pnas.79.8.2554 . 6953413 . 346238 . 1982PNAS...79.2554H . free .
8. Book: D.J. . Amit . Modeling Brain Function: The World of Attractor Neural Networks . 1992 . Cambridge University Press . 978-0-521-42124-9.
9. Book: Rolls, Edmund T. . Cerebral Cortex: Principles of Operation . 2016 . Oxford University Press . 978-0-19-878485-2.
10. Glauber . Roy J. . February 1963 . Roy J. Glauber "Time-Dependent Statistics of the Ising Model" . Journal of Mathematical Physics . en-US . 4 . 2 . 294–307 . 10.1063/1.1703954 . 2021-03-21.
11. Hopfield . J. J. . Neural networks and physical systems with emergent collective computational abilities . Proceedings of the National Academy of Sciences. 1982 . 79 . 8 . 2554–2558 . 10.1073/pnas.79.8.2554 . 6953413 . 346238 . 1982PNAS...79.2554H . free .
12. Book: MacKay, David J. C.. David J.C. MacKay. Information Theory, Inference and Learning Algorithms. limited. 42. Hopfield Networks. 2003. Cambridge University Press. 508. This convergence proof depends crucially on the fact that the Hopfield network's connections are symmetric. It also depends on the updates being made asynchronously.. 978-0521642989.
13. Hopfield . J. J. . Neurons with graded response have collective computational properties like those of two-state neurons . Proceedings of the National Academy of Sciences. 1984 . 81 . 10 . 3088–3092 . 10.1073/pnas.81.10.3088 . 6587342 . 345226 . 1984PNAS...81.3088H . free .
14. J. . Bruck . On the convergence properties of the Hopfield model . Proc. IEEE . 78 . 10 . 1579–85 . October 1990 . 10.1109/5.58341 .
15. Z. . Uykan . Shadow-Cuts Minimization/Maximization and Complex Hopfield Neural Networks . IEEE Transactions on Neural Networks and Learning Systems . 32 . 3 . 1096–1109 . March 2021 . 10.1109/TNNLS.2020.2980237 . 32310787 . 216047831 . free .
16. J.J. . Hopfield . D.W. . Tank . Neural computation of decisions in optimization problems . Biological Cybernetics . 52 . 141–6 . 1985 . 3 . 10.1007/BF00339943 . 4027280 . 36483354 .
17. Z. . Uykan . On the Working Principle of the Hopfield Neural Networks and its Equivalence to the GADIA in Optimization . IEEE Transactions on Neural Networks and Learning Systems . 31 . 9 . 3294–3304 . September 2020 . 10.1109/TNNLS.2019.2940920 . 31603804 . 204331533 .
18. Book: Storkey, Amos . Increasing the capacity of a Hopfield network without sacrificing functionality . Artificial Neural Networks – ICANN'97 . 1997 . 10.1.1.33.103 . 451–6 . 10.1007/BFb0020196 . Springer . Lecture Notes in Computer Science . 1327 . 978-3-540-69620-9.
19. Storkey . A.J. . R. . Valabregue . The basins of attraction of a new Hopfield learning rule . Neural Networks . 12 . 6 . 869–876 . 1999 . 10.1016/S0893-6080(99)00038-6 . 12662662 . 10.1.1.19.4681.
20. Liou . C.-Y. . Lin . S.-L. . 35025761 . Finite memory loading in hairy neurons . Natural Computing . 5 . 1 . 15–42 . 2006 . 10.1007/s11047-004-5490-x .
21. Liou . C.-Y. . Yuan . S.-K. . 6168346 . Error Tolerant Associative Memory . Biological Cybernetics . 81 . 4 . 331–342 . 1999 . 10.1007/s004220050566 . 10541936 .
22. Yuan . S.-K. . Expanding basins of attraction of the associative memory . National Taiwan University . Master . 991010725609704786 . June 1997 .
23. Book: ABOUDIB . Ala . GRIPON . Vincent . JIANG . Xiaoran . A study of retrieval algorithms of sparse messages in networks of neural cliques . COGNITIVE 2014 : The 6th International Conference on Advanced Cognitive Technologies and Applications . 2014 . 140–6 . 1308.4506 . 2013arXiv1308.4506A . https://hal.archives-ouvertes.fr/hal-01058303/.
24. Horn. D. Usher. M. 1988. Capacities of multiconnected memory models. J. Phys. France. 49. 3. 389–395. 10.1051/jphys:01988004903038900.
25. Burns. Thomas. Fukai. Tomoki. 2023. Simplicial Hopfield networks. 2305.05179. International Conference on Learning Representations. 11.
26. Krotov. Dmitry. Hopfield. John. 2016. Dense Associative Memory for Pattern Recognition. 1606.01164. Neural Information Processing Systems. 29. 1172–1180.
27. Ramsauer. Hubert. Schäfl. Bernhard. 1. 2021. Hopfield Networks is All You Need. 2008.02217. International Conference on Learning Representations.
28. Mete. Demircigil. Heusel. Judith. 1. 2017. On a model of associative memory with huge storage capacity.. Journal of Statistical Physics. 168. 2. 288–299. 10.1007/s10955-017-1806-y. 1702.01929. 2017JSP...168..288D . 119317128.
29. Krotov. Dmitry. Hopfield. John. 2021. Large associative memory problem in neurobiology and machine learning. 2008.06996. International Conference on Learning Representations.
30. Krotov. Dmitry. 2021. Hierarchical Associative Memory. cs.NE. 2107.06446.