-
Notifications
You must be signed in to change notification settings - Fork 83
/
dqn_agent.py
300 lines (223 loc) · 9.95 KB
/
dqn_agent.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
211
212
213
214
215
216
217
218
219
220
221
222
223
224
225
226
227
228
229
230
231
232
233
234
235
236
237
238
239
240
241
242
243
244
245
246
247
248
249
250
251
252
253
254
255
256
257
258
259
260
261
262
263
264
265
266
267
268
269
270
271
272
273
274
275
276
277
278
279
280
281
282
283
284
285
286
287
288
289
290
291
292
293
294
295
296
297
298
299
300
from keras.models import Sequential
from keras.layers import Dense
from keras.optimizers import Adam
import random, copy
import numpy as np
from dialogue_config import rule_requests, agent_actions
import re
# Some of the code based off of https://jaromiru.com/2016/09/27/lets-make-a-dqn-theory/
# Note: In original paper's code the epsilon is not annealed and annealing is not implemented in this code either
class DQNAgent:
"""The DQN agent that interacts with the user."""
def __init__(self, state_size, constants):
"""
The constructor of DQNAgent.
The constructor of DQNAgent which saves constants, sets up neural network graphs, etc.
Parameters:
state_size (int): The state representation size or length of numpy array
constants (dict): Loaded constants in dict
"""
self.C = constants['agent']
self.memory = []
self.memory_index = 0
self.max_memory_size = self.C['max_mem_size']
self.eps = self.C['epsilon_init']
self.vanilla = self.C['vanilla']
self.lr = self.C['learning_rate']
self.gamma = self.C['gamma']
self.batch_size = self.C['batch_size']
self.hidden_size = self.C['dqn_hidden_size']
self.load_weights_file_path = self.C['load_weights_file_path']
self.save_weights_file_path = self.C['save_weights_file_path']
if self.max_memory_size < self.batch_size:
raise ValueError('Max memory size must be at least as great as batch size!')
self.state_size = state_size
self.possible_actions = agent_actions
self.num_actions = len(self.possible_actions)
self.rule_request_set = rule_requests
self.beh_model = self._build_model()
self.tar_model = self._build_model()
self._load_weights()
self.reset()
def _build_model(self):
"""Builds and returns model/graph of neural network."""
model = Sequential()
model.add(Dense(self.hidden_size, input_dim=self.state_size, activation='relu'))
model.add(Dense(self.num_actions, activation='linear'))
model.compile(loss='mse', optimizer=Adam(lr=self.lr))
return model
def reset(self):
"""Resets the rule-based variables."""
self.rule_current_slot_index = 0
self.rule_phase = 'not done'
def get_action(self, state, use_rule=False):
"""
Returns the action of the agent given a state.
Gets the action of the agent given the current state. Either the rule-based policy or the neural networks are
used to respond.
Parameters:
state (numpy.array): The database with format dict(long: dict)
use_rule (bool): Indicates whether or not to use the rule-based policy, which depends on if this was called
in warmup or training. Default: False
Returns:
int: The index of the action in the possible actions
dict: The action/response itself
"""
if self.eps > random.random():
index = random.randint(0, self.num_actions - 1)
action = self._map_index_to_action(index)
return index, action
else:
if use_rule:
return self._rule_action()
else:
return self._dqn_action(state)
def _rule_action(self):
"""
Returns a rule-based policy action.
Selects the next action of a simple rule-based policy.
Returns:
int: The index of the action in the possible actions
dict: The action/response itself
"""
if self.rule_current_slot_index < len(self.rule_request_set):
slot = self.rule_request_set[self.rule_current_slot_index]
self.rule_current_slot_index += 1
rule_response = {'intent': 'request', 'inform_slots': {}, 'request_slots': {slot: 'UNK'}}
elif self.rule_phase == 'not done':
rule_response = {'intent': 'match_found', 'inform_slots': {}, 'request_slots': {}}
self.rule_phase = 'done'
elif self.rule_phase == 'done':
rule_response = {'intent': 'done', 'inform_slots': {}, 'request_slots': {}}
else:
raise Exception('Should not have reached this clause')
index = self._map_action_to_index(rule_response)
return index, rule_response
def _map_action_to_index(self, response):
"""
Maps an action to an index from possible actions.
Parameters:
response (dict)
Returns:
int
"""
for (i, action) in enumerate(self.possible_actions):
if response == action:
return i
raise ValueError('Response: {} not found in possible actions'.format(response))
def _dqn_action(self, state):
"""
Returns a behavior model output given a state.
Parameters:
state (numpy.array)
Returns:
int: The index of the action in the possible actions
dict: The action/response itself
"""
index = np.argmax(self._dqn_predict_one(state))
action = self._map_index_to_action(index)
return index, action
def _map_index_to_action(self, index):
"""
Maps an index to an action in possible actions.
Parameters:
index (int)
Returns:
dict
"""
for (i, action) in enumerate(self.possible_actions):
if index == i:
return copy.deepcopy(action)
raise ValueError('Index: {} not in range of possible actions'.format(index))
def _dqn_predict_one(self, state, target=False):
"""
Returns a model prediction given a state.
Parameters:
state (numpy.array)
target (bool)
Returns:
numpy.array
"""
return self._dqn_predict(state.reshape(1, self.state_size), target=target).flatten()
def _dqn_predict(self, states, target=False):
"""
Returns a model prediction given an array of states.
Parameters:
states (numpy.array)
target (bool)
Returns:
numpy.array
"""
if target:
return self.tar_model.predict(states)
else:
return self.beh_model.predict(states)
def add_experience(self, state, action, reward, next_state, done):
"""
Adds an experience tuple made of the parameters to the memory.
Parameters:
state (numpy.array)
action (int)
reward (int)
next_state (numpy.array)
done (bool)
"""
if len(self.memory) < self.max_memory_size:
self.memory.append(None)
self.memory[self.memory_index] = (state, action, reward, next_state, done)
self.memory_index = (self.memory_index + 1) % self.max_memory_size
def empty_memory(self):
"""Empties the memory and resets the memory index."""
self.memory = []
self.memory_index = 0
def is_memory_full(self):
"""Returns true if the memory is full."""
return len(self.memory) == self.max_memory_size
def train(self):
"""
Trains the agent by improving the behavior model given the memory tuples.
Takes batches of memories from the memory pool and processing them. The processing takes the tuples and stacks
them in the correct format for the neural network and calculates the Bellman equation for Q-Learning.
"""
# Calc. num of batches to run
num_batches = len(self.memory) // self.batch_size
for b in range(num_batches):
batch = random.sample(self.memory, self.batch_size)
states = np.array([sample[0] for sample in batch])
next_states = np.array([sample[3] for sample in batch])
assert states.shape == (self.batch_size, self.state_size), 'States Shape: {}'.format(states.shape)
assert next_states.shape == states.shape
beh_state_preds = self._dqn_predict(states) # For leveling error
if not self.vanilla:
beh_next_states_preds = self._dqn_predict(next_states) # For indexing for DDQN
tar_next_state_preds = self._dqn_predict(next_states, target=True) # For target value for DQN (& DDQN)
inputs = np.zeros((self.batch_size, self.state_size))
targets = np.zeros((self.batch_size, self.num_actions))
for i, (s, a, r, s_, d) in enumerate(batch):
t = beh_state_preds[i]
if not self.vanilla:
t[a] = r + self.gamma * tar_next_state_preds[i][np.argmax(beh_next_states_preds[i])] * (not d)
else:
t[a] = r + self.gamma * np.amax(tar_next_state_preds[i]) * (not d)
inputs[i] = s
targets[i] = t
self.beh_model.fit(inputs, targets, epochs=1, verbose=0)
def copy(self):
"""Copies the behavior model's weights into the target model's weights."""
self.tar_model.set_weights(self.beh_model.get_weights())
def save_weights(self):
"""Saves the weights of both models in two h5 files."""
if not self.save_weights_file_path:
return
beh_save_file_path = re.sub(r'\.h5', r'_beh.h5', self.save_weights_file_path)
self.beh_model.save_weights(beh_save_file_path)
tar_save_file_path = re.sub(r'\.h5', r'_tar.h5', self.save_weights_file_path)
self.tar_model.save_weights(tar_save_file_path)
def _load_weights(self):
"""Loads the weights of both models from two h5 files."""
if not self.load_weights_file_path:
return
beh_load_file_path = re.sub(r'\.h5', r'_beh.h5', self.load_weights_file_path)
self.beh_model.load_weights(beh_load_file_path)
tar_load_file_path = re.sub(r'\.h5', r'_tar.h5', self.load_weights_file_path)
self.tar_model.load_weights(tar_load_file_path)