-
Notifications
You must be signed in to change notification settings - Fork 15
/
hopfield_4.py
211 lines (184 loc) · 4.82 KB
/
hopfield_4.py
1
2
3
4
5
6
7
8
9
10
11
12
13
14
15
16
17
18
19
20
21
22
23
24
25
26
27
28
29
30
31
32
33
34
35
36
37
38
39
40
41
42
43
44
45
46
47
48
49
50
51
52
53
54
55
56
57
58
59
60
61
62
63
64
65
66
67
68
69
70
71
72
73
74
75
76
77
78
79
80
81
82
83
84
85
86
87
88
89
90
91
92
93
94
95
96
97
98
99
100
101
102
103
104
105
106
107
108
109
110
111
112
113
114
115
116
117
118
119
120
121
122
123
124
125
126
127
128
129
130
131
132
133
134
135
136
137
138
139
140
141
142
143
144
145
146
147
148
149
150
151
152
153
154
155
156
157
158
159
160
161
162
163
164
165
166
167
168
169
170
171
172
173
174
175
176
177
178
179
180
181
182
183
184
185
186
187
188
189
190
191
192
193
194
195
196
197
198
199
200
201
202
203
204
205
206
207
208
209
210
import numpy as np
import matplotlib.pyplot as plt
def compute_next_state(state, weight):
"""
This implements the syncrhonous update rule in a Hopfield network:
all the units are updated at the same time in one iteration.
Parameters
----------
state: array of shape (N,)
state vector with binary values, coded as +1 or -1
weight: 2d array of shape (N, N)
weight matrix where weight[i, j] is the connection weight between
unit i and unit j (connections are symmetric in a Hopfield network)
Returns
-------
next_state: array of shape (N,)
"""
# Note: '@' is a shorthand for 'np.matmul()'. Numpy automatically promotes
# 1D arrays (vectors) into 2D arrays (matrices) before applying the
# matrix multiplication, turning the right operand (here 'state') into a
# matrix of shape (N, 1). After applying the matrix multiplication,
# numpy then perform the inverse transformation to give back a 1D array.
next_state = np.where(weight @ state >= 0, +1, -1)
return next_state
def compute_final_state(initial_state, weight, max_iter=1000):
"""
Returns
-------
final_state: array of shape (N,)
is_stable: bool
whether the final state is a stable state
n_iter: int
number of iterations of compute_next_state performed
"""
previous_state = initial_state
next_state = compute_next_state(previous_state, weight)
is_stable = np.all(previous_state == next_state)
n_iter = 0
while (not is_stable) and (n_iter <= max_iter):
previous_state = next_state
next_state = compute_next_state(previous_state, weight)
is_stable = np.all(previous_state == next_state)
n_iter += 1
return previous_state, is_stable, n_iter
def weight_to_memorize_states(states):
"""
Parameters
----------
states: sequence of arrays of shape (N,)
the states to be memorized
Returns
-------
weight: 2d array of shape (N, N)
the weight matrix that will memorize the given states
"""
# concatenate into a matrix with each state as one column of this matrix
states_matrix = np.column_stack(states)
# this will compute the sum of the outer products of each column vectors
# in the matrix, which are the given states
weight = states_matrix @ states_matrix.T
# zero out the diagonal (there are no self-recurrent connections in Hopfield
# networks)
np.fill_diagonal(weight, 0)
return weight
def im_from_string(s):
# extract each line which correspond to one row of the image
lines = s.strip().split()
# convert each character into a digit and concatenate them into a 2d array
digits = [[(1 if c == '1' else -1) for c in line] for line in lines]
return np.array(digits)
def state_from_im(im):
return im.reshape((-1,))
def im_from_state(state, width):
return state.reshape((-1, width))
def state_from_string(s):
return state_from_im(im_from_string(s))
str_L = """
1....
1....
1....
1....
11111
"""
str_P = """
11111
1...1
11111
1....
1....
"""
str_S = """
11111
1....
11111
....1
11111
"""
str_X = """
1...1
.1.1.
..1..
.1.1.
1...1
"""
str_L_corrupted = (
"""
1....
1....
1....
1....
11.11
""")
str_L_corrupted_2 = (
"""
1....
1....
11..1
11.11
11.11
""")
str_P_corrupted = (
"""
111.1
1..11
1.11.
1.1..
1....
""")
str_X_corrupted = (
"""
1..11
.1.1.
..1..
.1.1.
11..1
""")
str_X_corrupted_2 = (
"""
1...1
.111.
..1..
.111.
1...1
""")
str_bars = (
"""
1...1
1...1
1...1
1...1
1...1
""")
str_wtf = (
"""
1...1
....1
1...1
....1
1...1
""")
str_zero = (
"""
.....
.....
.....
.....
.....
""")
if __name__ == '__main__':
memory_states = [ state_from_string(s) for s in [str_L, str_P, str_S, str_X]]
weight = weight_to_memorize_states(memory_states)
for s in (str_L_corrupted, str_L_corrupted_2, str_P_corrupted,
str_X_corrupted, str_X_corrupted_2, str_bars, str_wtf, str_zero):
initial_state = state_from_string(s)
final_state, is_stable, n_iter = compute_final_state(initial_state, weight)
print("is_stable, n_iter", is_stable, n_iter)
initial_im = im_from_state(initial_state, 5)
final_im = im_from_state(final_state, 5)
fig, axes = plt.subplots(nrows=1, ncols=2)
axes[0].imshow(initial_im, cmap="binary")
axes[0].set_title("Initial state")
axes[1].imshow(final_im, cmap="binary")
axes[1].set_title("Final state")
plt.show()