Unit 5
Unit 5
13. Consider a Hopfield network with three neurons. The connection weights
are given by the following symmetric weight matrix:
W = 0 1 -1
1 0 1
-1 1 0
If the initial state of the network is {S} = [1, -1, 1], update the network
asynchronously one neuron at a time. Which attractor state does the network
settle into?
14. For a Hopfield network with weights specified as wij = si sj ; Verify using a
Hebbian learning rule that a given pattern p = [1, -1, 1, 1] remains an
attractor.
15. For a Hopfield network with two neurons, the weight matrix is given by:
W=0 3
3 0
i. Find the eigenvalues of this weight matrix.
ii. Using the eigenvalues, determine if the network is likely to have stable
equilibrium points.