-
Notifications
You must be signed in to change notification settings - Fork 0
/
train.py
389 lines (306 loc) · 14.1 KB
/
train.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
301
302
303
304
305
306
307
308
309
310
311
312
313
314
315
316
317
318
319
320
321
322
323
324
325
326
327
328
329
330
331
332
333
334
335
336
337
338
339
340
341
342
343
344
345
346
347
348
349
350
351
352
353
354
355
356
357
358
359
360
361
362
363
364
365
366
367
368
369
370
371
372
373
374
375
376
377
378
379
380
381
382
383
384
385
386
import numpy as np
from util.gen_util import *
from util.math_util import *
from util.dtree_util import *
from rnn.adagrad import Adagrad
import rnn.propagation as prop
#from classify.learn_classifiers import validate
import cPickle, time, argparse
from multiprocessing import Pool
from sklearn.cross_validation import train_test_split
# splits the training data into minibatches
# multi-core parallelization
#def par_objective(num_proc, data, params, d, len_voc, rel_list, lambdas):
def par_objective(data, params, d, c, len_voc, rel_list1, rel_list2, lambdas):
#pool = Pool(processes=num_proc)
# non-data params
#oparams = [params, d, len_voc, rel_list]
oparams = [params, d, c, len_voc, rel_list1, rel_list2]
"""
# chunk size
n = len(data) / num_proc
split_data = [data[i:i+n] for i in range(0, len(data), n)]
to_map = []
for item in split_data:
to_map.append( (oparams, item) )
result = pool.map(objective_and_grad, to_map)
pool.close() # no more processes accepted by this pool
pool.join() # wait until all processes are finished
"""
param_data = []
param_data.append(oparams)
param_data.append(data)
#return (error_sum, grad, tree_size)
result = objective_and_grad(param_data)
"""
total_err = 0.0
all_nodes = 0.0
total_grad = None
for (err, grad, num_nodes) in result:
total_err += err
if total_grad is None:
total_grad = grad
else:
total_grad += grad
all_nodes += num_nodes
"""
[total_err, total_grad, all_nodes] = result
# add L2 regularization
#params = unroll_params(params, d, len_voc, rel_list)
params = unroll_params(params, d, c, len_voc, rel_list1, rel_list2)
#(rel_dict, Wv, b, L) = params
(rel_dict1, rel_dict2, Wv_1, Wv_2, Wc, b_1, b_2, b_c, L) = params
#grads = unroll_params(total_grad, d, len_voc, rel_list)
grads = unroll_params(total_grad, d, c, len_voc, rel_list1, rel_list2)
#[lambda_W, lambda_L] = lambdas
[lambda_W, lambda_L, lambda_C] = lambdas
reg_cost = 0.0
for key in rel_list1:
reg_cost += 0.5 * lambda_W * sum(rel_dict1[key] ** 2)
grads[0][key] = grads[0][key] / all_nodes
grads[0][key] += lambda_W * rel_dict1[key]
for key in rel_list2:
reg_cost += 0.5 * lambda_W * sum(rel_dict2[key] ** 2)
grads[1][key] = grads[1][key] / all_nodes
grads[1][key] += lambda_W * rel_dict2[key]
reg_cost += 0.5 * lambda_W * sum(Wv_1 ** 2)
grads[2] = grads[2] / all_nodes
grads[2] += lambda_W * Wv_1
reg_cost += 0.5 * lambda_W * sum(Wv_2 ** 2)
grads[3] = grads[3] / all_nodes
grads[3] += lambda_W * Wv_2
#Wc
reg_cost += 0.5 * lambda_C * sum(Wc ** 2)
grads[4] = grads[4] / all_nodes
grads[4] += lambda_C * Wc
#grads[2] = grads[2] / all_nodes
grads[5] = grads[5] / all_nodes
grads[6] = grads[6] / all_nodes
#b_c
grads[7] = grads[7] / all_nodes
reg_cost += 0.5 * lambda_L * sum(L ** 2)
#grads[3] = grads[3] / all_nodes
#grads[3] += lambda_L * L
grads[8] = grads[8] / all_nodes
grads[8] += lambda_L * L
cost = total_err / all_nodes + reg_cost
grad = roll_params(grads, rel_list1, rel_list2)
return cost, grad
# this function computes the objective / grad for each minibatch
def objective_and_grad(par_data):
#params, d, len_voc, rel_list = par_data[0]
params, d, c, len_voc, rel_list1, rel_list2 = par_data[0]
data = par_data[1]
#params = unroll_params(params, d, len_voc, rel_list)
#return [rel_dict, Wv, Wc, b, b_c, We]
params = unroll_params(params, d, c, len_voc, rel_list1, rel_list2)
# returns list of zero gradients which backprop modifies
#grads = init_dtrnn_grads(rel_list, d, len_voc)
grads = init_dtrnn_grads(rel_list1, rel_list2, d, c, len_voc)
#(rel_dict, Wv, b, L) = params
(rel_dict1, rel_dict2, Wv_1, Wv_2, Wc, b_1, b_2, b_c, L) = params
error_sum = 0.0
num_nodes = 0
tree_size = 0
# compute error and gradient for each tree in minibatch
# also keep track of total number of nodes in minibatch
for index, tree in enumerate(data):
nodes = tree.get_nodes()
for node in nodes:
node.vec = L[:, node.ind].reshape( (d, 1) )
#tree.ans_vec = L[:, tree.ans_ind].reshape( (d, 1))
#prop.forward_prop(params, tree, d)
prop.forward_prop(params, tree, d, c)
error_sum += tree.error()
tree_size += len(nodes)
#prop.backprop(params[:-1], tree, d, len_voc, grads)
prop.backprop(params[:-1], tree, d, c, len_voc, grads)
grad = roll_params(grads, rel_list1, rel_list2)
return (error_sum, grad, tree_size)
# train qanta and save model
if __name__ == '__main__':
# command line arguments
parser = argparse.ArgumentParser(description='QANTA: a question answering neural network \
with trans-sentential aggregation')
parser.add_argument('-data', help='location of dataset', default='util/data_semEval/final_input_res')
parser.add_argument('-We', help='location of word embeddings', default='util/data_semEval/word_embeddings_res')
parser.add_argument('-We_mixed', help='location of word embeddings mixed', default='util/data_semEval/word_embeddings_mixed_res')
parser.add_argument('-d', help='word embedding dimension', type=int, default=100)
# no of classes
parser.add_argument('-c', help='number of classes', type=int, default=3)
parser.add_argument('-np', '--num_proc', help='number of cores to parallelize over', type=int, \
default=2)
parser.add_argument('-lW', '--lambda_W', help='regularization weight for composition matrices', \
type=float, default=0.001)
parser.add_argument('-lWe', '--lambda_We', help='regularization weight for word embeddings', \
type=float, default=0.001)
# regularization for classification matrix
parser.add_argument('-lWc', '--lambda_Wc', help='regularization weight for classification matrix', \
type=float, default=0.001)
parser.add_argument('-b', '--batch_size', help='adagrad minibatch size (ideal: 25 minibatches \
per epoch). for provided datasets, 272 for history and 341 for lit', type=int,\
default=27)
parser.add_argument('-ep', '--num_epochs', help='number of training epochs, can also determine \
dynamically via validate method', type=int, default=5)
parser.add_argument('-agr', '--adagrad_reset', help='reset sum of squared gradients after this many\
epochs', type=int, default=30)
"""
parser.add_argument('-v', '--do_val', help='check performance on dev set after this many\
epochs', type=int, default=4)
"""
parser.add_argument('-o', '--output', help='desired location of output model', \
default='models/trainingResBidir_params')
parser.add_argument('-op', help='use mixed word vector or not', default = False)
parser.add_argument('-len', help='training vector length', default = 50)
args = vars(parser.parse_args())
## load data
vocab, rel_list, tree_dict = \
cPickle.load(open(args['data'], 'rb'))
# four total folds in this dataset: train, test, dev, and devtest
#train_trees, val_trees = train_test_split(tree_dict, test_size = 0.1)
train_trees = tree_dict
# - since the dataset that we were able to release is fairly small, the
# test, dev, and devtest folds are tiny. feel free to validate over another
# combination of these folds if you wish.
#val_trees = tree_dict['dev']
#ans_list = array([vocab.index(ans) for ans in ans_list])
# NOTE: it significantly helps both accuracy and training time to initialize
# word embeddings using something like Word2Vec. we have provided word2vec
# embeddings for both datasets. for other data, we strongly recommend
# using a similar smart initialization. you can also randomly initalize, although
# this generally results in slower convergence to a worse local minima
if args['op']:
orig_We = cPickle.load(open(args['We_mixed'], 'rb'))
else:
orig_We = cPickle.load(open(args['We'], 'rb'))
# orig_We = gen_rand_we(len(vocab), d)
# regularization lambdas
#lambdas = [args['lambda_W'], args['lambda_We']]
lambdas = [args['lambda_W'], args['lambda_We'], args['lambda_Wc']]
# output log and parameter file destinations
# "training_param"
param_file = args['output']
# "training_log"
log_file = param_file.split('_')[0] + '_log'
print 'number of training sentences:', len(train_trees)
#print 'number of validation sentences:', len(val_trees)
rel_list.remove('root')
print 'number of dependency relations:', len(rel_list)
# number of classes
print 'number of classes:', args['c']
## remove incorrectly parsed sentences from data
# print 'removing bad trees train...'
bad_trees = []
for ind, tree in enumerate(train_trees):
#add condition when the tree is empty
if tree.get_nodes() == []:
bad_trees.append(ind)
elif tree.get(0).is_word == 0:
print tree.get_words(), ind
bad_trees.append(ind)
# pop bad trees, higher indices first
# print 'removed ', len(bad_trees)
for ind in bad_trees[::-1]:
#train_trees.pop(ind)
train_trees = np.delete(train_trees, ind)
# print 'removing bad trees val...'
"""
bad_trees = []
for ind, tree in enumerate(val_trees):
if tree.get(0).is_word == 0:
# print tree.get_words(), ind
bad_trees.append(ind)
# pop bad trees, higher indices first
# print 'removed ', len(bad_trees)
for ind in bad_trees[::-1]:
val_trees.pop(ind)
"""
# add vocab lookup to leaves / answer
"""
print 'adding lookup'
for tree in train_trees:
tree.ans_list = ans_list[ans_list != tree.ans_ind]
"""
# generate params / We
# d = word embedding dimension
# Returns (dict{rels:[mat]}, Wv, Wc, b, b_c)
#params = gen_dtrnn_params(args['d'], rel_list)
if (args['op']):
params = gen_dtrnn_params(args['d'] + args['len'], args['c'], rel_list)
else:
params = gen_dtrnn_params(args['d'], args['c'], rel_list)
rel_list1 = params[0].keys()
rel_list2 = params[1].keys()
# add We matrix to params
#(dict{rels:[mat]}, Wv, Wc, b, b_c, We)
params += (orig_We, )
# r is 1-D param vector
r = roll_params(params, rel_list1, rel_list2)
dim = r.shape[0]
print 'parameter vector dimensionality:', dim
log = open(log_file, 'w')
paramfile = open( param_file, 'wb')
# minibatch adagrad training
ag = Adagrad(r.shape)
for tdata in [train_trees]:
min_error = float('inf')
for epoch in range(0, args['num_epochs']):
lstring = ''
# create mini-batches
random.shuffle(tdata)
batches = [tdata[x : x + args['batch_size']] for x in xrange(0, len(tdata),
args['batch_size'])]
epoch_error = 0.0
for batch_ind, batch in enumerate(batches):
now = time.time()
"""
err, grad = par_objective(args['num_proc'], batch, r, args['d'], len(vocab), \
rel_list, lambdas)
"""
# return cost, grad
if args['op']:
err, grad = par_objective(batch, r, args['d'] + args['len'], args['c'], len(vocab), \
rel_list1, rel_list2, lambdas)
else:
err, grad = par_objective(batch, r, args['d'], args['c'], len(vocab), \
rel_list1, rel_list2, lambdas)
update = ag.rescale_update(grad)
r = r - update
lstring = 'epoch: ' + str(epoch) + ' batch_ind: ' + str(batch_ind) + \
' error, ' + str(err) + ' time = '+ str(time.time()-now) + ' sec'
print lstring
log.write(lstring + '\n')
log.flush()
epoch_error += err
# done with epoch
print 'done with epoch ', epoch, ' epoch error = ', epoch_error, ' min error = ', min_error
lstring = 'done with epoch ' + str(epoch) + ' epoch error = ' + str(epoch_error) \
+ ' min error = ' + str(min_error) + '\n\n'
log.write(lstring)
log.flush()
# save parameters if the current model is better than previous best model
if epoch_error < min_error:
min_error = epoch_error
print 'saving model...'
#params = unroll_params(r, args['d'], len(vocab), rel_list)
if (args['op']):
params = unroll_params(r, args['d'] + args['len'], args['c'], len(vocab), rel_list1, rel_list2)
else:
params = unroll_params(r, args['d'], args['c'], len(vocab), rel_list1, rel_list2)
cPickle.dump( ( params, vocab, rel_list1, rel_list2), paramfile)
# reset adagrad weights
if epoch % args['adagrad_reset'] == 0 and epoch != 0:
ag.reset_weights()
# check accuracy on validation set
"""
if epoch % args['do_val'] == 0 and epoch != 0:
print 'validating...'
params = unroll_params(r, args['d'], args['c'], len(vocab), rel_list)
train_acc, val_acc = validate([train_trees, val_trees], params, args['d'])
lstring = 'train acc = ' + str(train_acc) + ', val acc = ' + str(val_acc) + '\n\n\n'
print lstring
log.write(lstring)
log.flush()
"""
log.close()
paramfile.close()