-
Notifications
You must be signed in to change notification settings - Fork 0
/
U_train_and_test_GM.py
319 lines (284 loc) · 14.8 KB
/
U_train_and_test_GM.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
#!/usr/bin/python
"""
The Greedy Model (GM)
"""
from gensim import models
from copy import deepcopy
from math import ceil, floor
from itertools import permutations
import random
import sys, getopt
import numpy as np
from numpy import exp, dot, log
import h5py
import os
import logging
import glob
import argparse
import time
logger = logging.getLogger(__name__)
logger.setLevel(logging.DEBUG)
fh = logging.FileHandler("compute.log")
fh.setLevel(logging.DEBUG)
ch = logging.StreamHandler()
ch.setLevel(logging.DEBUG)
logger.addHandler(fh)
iter_num = 10
lr = 0.05
train_uw2v = True
def remove_lastN_actions(plan, blank_count):
incomplete_plan = deepcopy(plan)
indices = []
cnt = 0
while cnt < blank_count:
missing_action_index = len(plan)-1-cnt
incomplete_plan[ missing_action_index ] = u'###'
indices.append(missing_action_index)
cnt += 1
return blank_count, indices, incomplete_plan
def remove_conseq_middle_actions(plan, blank_count):
incomplete_plan = deepcopy(plan)
indices = []
cnt = 0
missing_action_init = random.randrange(2, len(plan) - 2 - blank_count)
for i in range(missing_action_init, missing_action_init+blank_count):
incomplete_plan[i] = u'###'
indices.append(i)
cnt += 1
return blank_count, indices, incomplete_plan
def remove_randomN_actions(plan, blank_count):
incomplete_plan = deepcopy(plan)
indices = []
cnt = 0
while cnt < blank_count:
missing_action_index = random.randrange(2, len(plan)-2)
if missing_action_index in indices:
# making sure that the indices generated are unique
continue
else:
incomplete_plan[ missing_action_index ] = u'###'
indices.append(missing_action_index)
cnt += 1
return blank_count, indices, incomplete_plan
def compute_fake_confidence_reliability(old_lambda, blankIndex, confidence):
# confidence = list(confidence)
reduced_lambda = reduce((lambda x, y: x * y), np.take(confidence, blankIndex))
new_confidence = deepcopy(confidence)
mean_confidence = np.mean(np.delete(new_confidence, blankIndex))
confidence[blankIndex] = mean_confidence
# new_lambda = reduce((lambda x, y: x * y), confidence)
new_lambda = old_lambda*mean_confidence**len(blankIndex) / reduced_lambda
return new_lambda, confidence
def EMTesting(weights, winSz, indices, incomplete_plan, blank_count, vocab_size, actions, topk, model, mode, lambda_i=0, confidence=0):
update_flag = True
for iter in range(iter_num):
# save current_words to change update_flag
current_words = []
for index in indices:
current_words.append(incomplete_plan[index])
if update_flag:
predict_words = []
for blank_order in range(blank_count):
tentative_plans = []
blank_index = indices[blank_order]
for vocab_index in range(vocab_size):
incomplete_plan[blank_index] = actions[vocab_index]
# build tmp_plan for compute score
tmp_plan = incomplete_plan[blank_index - winSz:blank_index + winSz + 1]
if mode == 'uw2v':
tmp_conf = confidence[blank_index - winSz:blank_index + winSz + 1]
tentative_plans.append((zip(tmp_plan,tmp_conf), lambda_i))
else: tentative_plans.append(tmp_plan)
# if mode == 'uw2v':
# # # Zip incomplete_plan with confidence and reliability
# # new_tentative_plans = deepcopy(tentative_plans)
# # new_tentative_plans = zip(new_tentative_plans, [confidence[blank_index - winSz:blank_index + winSz + 1] * len(new_tentative_plans)])
# # new_tentative_plans = zip(new_tentative_plans, lambda_i * len(new_tentative_plans))
# scores_uw2v = model_uw2v.score(tentative_plans, mode) # should be a matrix?
# else:
scores = model.score(tentative_plans, mode)
weights[:, blank_order] = scores
# select word that has max score to update blank word
max_index_uw2v = np.argmax(weights[:, blank_order])
predict_word_uw2v = actions[max_index_uw2v]
incomplete_plan[blank_index] = predict_word_uw2v
predict_words.append(predict_word_uw2v)
logger.info("predict words:%s", predict_words)
else:
# no update in the last iteration
logger.info("quit from no update, iteration:%d", iter)
break
if predict_words == current_words:
update_flag = False
else:
update_flag = True
# if iter + 1 == iter_num:
# logger.info("quit from reach max iteration, iteration:%d", iter)
best_plan_args = np.argsort(weights, axis=0)[-1 * topk:][::-1]
return best_plan_args, weights
def compute_blank_count(missing, plan_length):
if missing < 1:
blank_count = int(ceil(plan_length * missing + 0.5))
else: blank_count = int(missing)
return blank_count
def obtain_incomplete_plan(mode, missing, plan, indices = None, blank_count = None):
blank_count = compute_blank_count(missing, len(plan))
if indices == None:
if mode == 'end' and 0 < missing < 1:
blank_count, indices, incomplete_plan = remove_lastN_actions(plan, blank_count) # remove_lastN_actions(plan,1)
indices.reverse()
elif mode == 'end' and missing >= 1:
blank_count, indices, incomplete_plan = remove_lastN_actions(plan, blank_count)
indices.reverse()
elif mode == 'middle_random' and missing >= 1:
blank_count, indices, incomplete_plan = remove_randomN_actions(plan, blank_count)
elif mode == 'middle_cons' and missing >= 1:
blank_count, indices, incomplete_plan = remove_conseq_middle_actions(plan, blank_count)
elif mode == 'middle_random' and 0 < missing < 1:
blank_count, indices, incomplete_plan = remove_randomN_actions(plan, blank_count)
elif mode == 'middle_cons' and 0 < missing < 1:
blank_count, indices, incomplete_plan = remove_conseq_middle_actions(plan, blank_count)
else:
raise NotImplementedError
else:
incomplete_plan = deepcopy(plan)
if type(indices) is int:
incomplete_plan[indices] = u'###'
elif type(indices) is list:
for id in indices:
incomplete_plan[id] = u'###'
return blank_count, indices, incomplete_plan
class GM(object):
def __init__(self, gen_args, folderName, use_hs):
self.folderName = folderName
self.use_hs = use_hs
super(GM, self).__init__()
self.domain, self.shouldTrain, self.cvSplit, self.iter, self.topk, self.mode, self.missing, self.biasWin, self.num_train, self.winSz, self.beam_size, self.distr_sz = gen_args
dir = os.path.dirname(__file__)
folder = os.path.join(dir) + '/' + self.domain + folderName
self.files = glob.glob(folder + '*.h5')
with h5py.File(self.files[0], 'r') as h5file:
self.data_size = len(h5file['UncertainData'])
if self.num_train is None:
self.totalN = np.arange(self.data_size)
else:
self.totalN = np.arange(self.num_train)
def train_and_test_core(self, testing_ids, testing_indices):
if self.use_hs == 0: hs_list = [0]
if self.use_hs == 1: hs_list = [1]
if self.use_hs == 2: hs_list = [0, 1]
train_times = []
test_times = []
acc = []
for use_hs in hs_list:
testing_ids = np.sort(testing_ids)
training_ids = np.delete(self.totalN, testing_ids)
# Train a model based on training data
training_start_time = time.time()
train_sentences_dup = models.uncertainWord2vec.DataLoader(self.domain, self.files, 'certain-observation', self.num_train,
self.beam_size, training_ids, self.distr_sz)
# Get statistics
print "PER: ", train_sentences_dup.get_sequence_PER([2])
model_dup = models.UncertainWord2Vec(uncertSentences=train_sentences_dup, uncertainTrain=False, min_count=1,
sg=1, workers=8, hs=use_hs, negative=0, window=self.winSz, iter=self.iter, sample=0, model=3)
model_dup.save(self.domain + '/naive_model' + '.txt')
train_time = time.time() - training_start_time
# print("--- training model %s needs %.2f seconds ---\n" % (self.__class__.__name__, train_time))
plans = models.uncertainWord2vec.DataLoader(self.domain, self.files, 'model2', self.num_train, self.beam_size,
testing_ids, distr_sz=self.distr_sz) # Testing UDUP
GP = models.uncertainWord2vec.DataLoader(self.domain, self.files, 'ground-truth', self.num_train, self.beam_size,
testing_ids, distr_sz=self.distr_sz)
GdPlans = [q for q in GP]
NP = models.uncertainWord2vec.DataLoader(self.domain, self.files, 'certain-observation', self.num_train, self.beam_size,
testing_ids, distr_sz=self.distr_sz)
NoisyPlans = [p for p in NP]
actions_dup = model_dup.wv.vocab.keys()
vocab_size_dup = len(actions_dup)
correct_dup = 0
total = 0
print "GM Testing : Running on data %s with H-Softmax = %d" % (self.folderName, use_hs)
testing_start_time = time.time()
# for itr, plan_grd in enumerate(GdPlans):
# plan_grd = zip(*plan_grd)[0]
# plan_dup = list(zip(*NoisyPlans[itr])[0])
# blank_count, indices, incomplete_plan_dup = obtain_incomplete_plan(self.mode, self.missing, plan_dup)
# total += blank_count
for itr, plan in enumerate(plans):
# plan_grd = zip(*plan_grd)[0]
plan_grd = zip(*GdPlans[itr])[0]
plan_dup = list(zip(*NoisyPlans[itr])[0])
blank_count, indices, incomplete_plan_dup = obtain_incomplete_plan(self.mode, self.missing, plan, testing_indices[testing_ids[itr]])
total += blank_count
# Testing DUP
weights_dup = np.zeros(vocab_size_dup * blank_count).reshape(vocab_size_dup, blank_count)
random_indices_dup = random.sample(range(vocab_size_dup), blank_count) # random fill the blank word
for order in range(blank_count):
blank_index = indices[order]
random_word_dup = actions_dup[random_indices_dup[order]]
incomplete_plan_dup[blank_index] = random_word_dup
best_plan_args_dup, weights_dup = EMTesting(weights_dup, self.winSz, indices, incomplete_plan_dup, blank_count,
vocab_size_dup, actions_dup, self.topk, model_dup, 'uw2v2')
for blank_order in range(blank_count):
blank_index = indices[blank_order]
for sample_index in best_plan_args_dup[:, blank_order]:
if actions_dup[sample_index] == plan_grd[blank_index]:
correct_dup += 1
break
test_time = time.time() - testing_start_time
train_times.append(np.round(train_time, 2))
test_times.append(np.round(test_time, 2))
acc.append(np.round(float(correct_dup)/total, 4)*100)
total = 0
correct_dup = 0
# print("--- testing model %s needs %.2f seconds ---\n" % (self.__class__.__name__, test_time))
return acc, train_times, test_times
def main():
parser = argparse.ArgumentParser()
parser.add_argument('--train_wv', type=bool, default=1, help='Need to train wordemb or not?')
parser.add_argument('--cv_split', type=int, default=1, help='Number of cross validation blocks')
parser.add_argument('--domain', type=str, default='blocks', help='domain?')
parser.add_argument('--mode', type=str, default='end', help='middle or not')
parser.add_argument('--num_missing', type=float, default=1, help='number of missing actions')
parser.add_argument('--win_bias', type=int, default=0, help='window bias for word embedding')
parser.add_argument('--num_train', type=int, default=0, help='number of training instances, 0 if use all')
parser.add_argument('--beam_size', type=int, default=0, help='beam size, 0 if infinitely large')
parser.add_argument('--iter', type=int, default=20, help='beam size, 0 if infinitely large')
parser.add_argument('--top_k', nargs="+", type=int, help='range of size of candidate predictions: a b')
parser.add_argument('--win_range', nargs="+", type=int, help='range of word2vec window size: a b')
args = parser.parse_args()
#print argv
domain = args.domain
cv_split = args.cv_split
train = args.train_wv
mode = args.mode
num_missing = args.num_missing
iter = args.iter
biasWin = args.win_bias
topkRange = tuple(args.top_k)
winRange = tuple(args.win_range)
num_train = (args.num_train == 0 and [None] or [args.num_train])[0]
# beam_size = (args.beam_size == 0 and [None] or [args.beam_size])[0]
beam_size = (args.beam_size == 0 and [np.inf] or [args.beam_size])[0]
print "\n=== Domain : %s ===\n" % domain
total_unknown_actions = 0
total_correctUW2V_predictions = 0
total_correctDUP_predictions = 0
for topk in range(topkRange[0], topkRange[1] + 1):
for winSz in range(winRange[0], winRange[1] + 1):
gen_args = domain, train, cv_split, iter, topk, mode, num_missing, biasWin, num_train, winSz, beam_size
ua, cv, cp = train_and_test(gen_args)
total_unknown_actions += ua
total_correctUW2V_predictions += cv
total_correctDUP_predictions += cp
print "\n==== FINAL STATISTICS ===="
print "topk: %d" % (topk)
print "window_size: %d" % (winSz)
print "\nTotal unknown actions: %d; Total correct UW2V predictions: %0.2f; Total correct DUP predictions: %0.2f" % (total_unknown_actions, total_correctUW2V_predictions, total_correctDUP_predictions)
print "UW2V ACCURACY: %0.2f%%\n" % (total_correctUW2V_predictions * 100.0 / total_unknown_actions)
print "DUP ACCURACY: %0.2f%%\n" % (total_correctDUP_predictions * 100.0 / total_unknown_actions)
total_unknown_actions = 0
total_correctUW2V_predictions = 0
total_correctDUP_predictions = 0
if __name__ == "__main__":
# print compute_fake_confidence_reliability(0.0015, [1,3], np.array([0.1,0.1, 0.5, 0.3]).astype(float))
main()