-
Notifications
You must be signed in to change notification settings - Fork 0
Expand file tree
/
Copy pathdataset.py
More file actions
370 lines (295 loc) · 10.7 KB
/
dataset.py
File metadata and controls
370 lines (295 loc) · 10.7 KB
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
from math import floor, ceil
import torch
# from iterstrat.ml_stratifiers import (
# MultilabelStratifiedShuffleSplit,
# MultilabelStratifiedKFold,
# )
from torch.utils.data.dataloader import default_collate
from sklearn.model_selection import GroupKFold, KFold
import numpy as np
import pandas as pd
from torch.utils.data import DataLoader, Dataset
from tqdm import tqdm
def _get_masks(tokens, max_seq_length):
"""Mask for padding"""
if len(tokens) > max_seq_length:
raise IndexError("Token length more than max seq length!")
return [1] * len(tokens) # + [0] * (max_seq_length - len(tokens))
def _get_segments(tokens, max_seq_length):
"""Segments: 0 for the first sequence, 1 for the second"""
if len(tokens) > max_seq_length:
raise IndexError("Token length more than max seq length!")
segments = []
first_sep = True
current_segment_id = 0
for token in tokens:
segments.append(current_segment_id)
if token == "[SEP]":
if first_sep:
first_sep = False
else:
current_segment_id = 1
return segments # + [0] * (max_seq_length - len(tokens))
def _get_ids(tokens, tokenizer, max_seq_length):
"""Token ids from Tokenizer vocab"""
token_ids = tokenizer.convert_tokens_to_ids(tokens)
input_ids = token_ids # + [0] * (max_seq_length - len(token_ids))
return input_ids
def _trim_input(
args,
tokenizer,
title,
question,
answer,
max_sequence_length=290,
t_max_len=30,
q_max_len=128,
a_max_len=128,
):
# SICK THIS IS ALL SEEMS TO BE SICK
t = tokenizer.tokenize(title)
q = tokenizer.tokenize(question)
a = tokenizer.tokenize(answer)
t_len = len(t)
q_len = len(q)
a_len = len(a)
if (t_len + q_len + a_len + 4) > max_sequence_length:
if t_max_len > t_len:
t_new_len = t_len
a_max_len = a_max_len + floor((t_max_len - t_len) / 2)
q_max_len = q_max_len + ceil((t_max_len - t_len) / 2)
else:
t_new_len = t_max_len
if a_max_len > a_len:
a_new_len = a_len
q_new_len = q_max_len + (a_max_len - a_len)
elif q_max_len > q_len:
a_new_len = a_max_len + (q_max_len - q_len)
q_new_len = q_len
else:
a_new_len = a_max_len
q_new_len = q_max_len
if t_new_len + a_new_len + q_new_len + 4 != max_sequence_length:
raise ValueError(
"New sequence length should be %d, but is %d"
% (max_sequence_length, (t_new_len + a_new_len + q_new_len + 4))
)
q_len_head = round(q_new_len / 2)
q_len_tail = -1 * (q_new_len - q_len_head)
a_len_head = round(a_new_len / 2)
a_len_tail = -1 * (a_new_len - a_len_head) ## Head+Tail method .
t = t[:t_new_len]
if args.head_tail:
q = q[:q_len_head] + q[q_len_tail:]
a = a[:a_len_head] + a[a_len_tail:]
else:
q = q[:q_new_len]
a = a[:a_new_len] ## No Head+Tail ,usual processing
return t, q, a
def _convert_to_bert_inputs(
title, question, answer, tokenizer, max_sequence_length
):
"""Converts tokenized input to ids, masks and segments for BERT"""
stoken = (
["[CLS]"]
+ title
+ ["[SEP]"]
+ question
+ ["[SEP]"]
+ answer
+ ["[SEP]"]
)
input_ids = _get_ids(stoken, tokenizer, max_sequence_length)
input_masks = _get_masks(stoken, max_sequence_length)
input_segments = _get_segments(stoken, max_sequence_length)
return [input_ids, input_masks, input_segments]
def _get_stoken_output(title, question, answer, tokenizer, max_sequence_length):
"""Converts tokenized input to ids, masks and segments for BERT"""
stoken = (
["[CLS]"]
+ title
+ ["[SEP]"]
+ question
+ ["[SEP]"]
+ answer
+ ["[SEP]"]
)
return stoken
def compute_input_arays(
args,
df,
columns,
tokenizer,
max_sequence_length,
t_max_len=30,
q_max_len=128,
a_max_len=128,
):
input_ids, input_masks, input_segments = [], [], []
for _, instance in tqdm(
df[columns].iterrows(),
desc="Preparing dataset",
total=len(df),
ncols=80,
):
t, q, a = (
instance.question_title,
instance.question_body,
instance.answer,
)
t, q, a = _trim_input(
args,
tokenizer,
t,
q,
a,
max_sequence_length,
t_max_len,
q_max_len,
a_max_len,
)
ids, masks, segments = _convert_to_bert_inputs(
t, q, a, tokenizer, max_sequence_length
)
input_ids.append(np.array(ids, dtype=np.int64))
input_masks.append(np.array(masks, dtype=np.int64))
input_segments.append(np.array(segments, dtype=np.int64))
return (
input_ids,
input_masks,
input_segments
)
def compute_output_arrays(df, columns):
return np.asarray(df[columns])
class BucketingSampler:
""" 将文本长度值进行排序 的batch处理
现在是计算一个batch中总长度匹配 定义的batch size和length的总长度
"""
def __init__(self, lengths, batch_size, maxlen=500):
self.lengths = lengths
self.batch_size = batch_size
self.maxlen = 500
# print(batch_size)
self.batches = self._make_batches(lengths, batch_size, maxlen)
def _make_batches(self, lengths, batch_size, maxlen):
max_total_length = maxlen * batch_size
ids = np.argsort(lengths) # 照顾长度的取值
current_maxlen = 0
batch = []
batches = []
for id in ids:
current_len = len(batch) * current_maxlen
size = lengths[id]
current_maxlen = max(size, current_maxlen)
new_len = current_maxlen * (len(batch) + 1) # 最大长度匹配,整合成一个batch
if new_len < max_total_length:
batch.append(id)
else:
batches.append(batch)
current_maxlen = size # 最大长度回归到上一个长度值
batch = [id] # 新batch
if batch:
batches.append(batch)
assert (sum(len(batch) for batch in batches)) == len(lengths)
return batches
def __len__(self):
return len(self.batches)
def __iter__(self):
return iter(self.batches)
def make_collate_fn(padding_values={"input_ids": 0, "input_masks": 0, "input_segments": 0}):
"""padding input_ids、input_masks、input_segments"""
def _collate_fn(batch):
for name, padding_value in padding_values.items():
lengths = [len(sample[name]) for sample in batch]
max_length = max(lengths)
for n, size in enumerate(lengths):
p = max_length - size
if p:
# [(0, 34)] + [(0, 0)]*2 = [(0, 34), (0, 0), (0, 0)]
pad_width = [(0, p)] + [(0, 0)] * (batch[n][name].ndim - 1) # 填充维度,如果维度不是一维的话
if padding_value == "edge": # padding value 直接取巧 放在数值数据上
batch[n][name] = np.pad(
batch[n][name], pad_width,
mode="edge")
else:
batch[n][name] = np.pad(
batch[n][name], pad_width,
mode="constant", constant_values=padding_value)
return default_collate(batch)
return _collate_fn
class QuestDataset(torch.utils.data.Dataset):
def __init__(self, inputs, lengths, labels=None):
self.inputs = inputs
self.labels = labels
self.lengths = lengths # 长度还被拿来做权重
@classmethod
def from_frame(cls, args, df, tokenizer, test=False):
# 通过长度控制 title question answer 的输入
inputs = compute_input_arays(
args,
df,
args.input_columns,
tokenizer,
max_sequence_length=args.max_sequence_length,
t_max_len=args.max_title_length,
q_max_len=args.max_question_length,
a_max_len=args.max_answer_length,
)
outputs = None
if not test: # 数据集是否有标准答案
outputs = compute_output_arrays(df, args.target_columns)
outputs = torch.tensor(outputs, dtype=torch.float32)
# lengths = np.argmax(inputs[0] == 0, axis=1)
# lengths[lengths == 0] = inputs[0].shape[1]
lengths = [len(x) for x in inputs[0]] # padding 保留到 dataloader 的collate_fn 上处理
return cls(inputs=inputs, lengths=lengths, labels=outputs)
def __len__(self):
return len(self.inputs[0])
def __getitem__(self, idx):
input_ids = self.inputs[0][idx]
input_masks = self.inputs[1][idx]
input_segments = self.inputs[2][idx]
lengths = self.lengths[idx]
sample = dict( # 以字典形式返回
idx=idx,
input_ids=input_ids,
input_masks=input_masks,
input_segments=input_segments,
lengths=lengths
)
if self.labels is not None: # 数据集是否有标准答案
labels = self.labels[idx]
sample["labels"] = labels
return sample
def cross_validation_split(
args,
train_df,
tokenizer,
ignore_train=False
):
kf = GroupKFold(n_splits=args.folds)
y_train = train_df[args.target_columns].values
for fold, (train_index, val_index) in enumerate(kf.split(
train_df.values, groups=train_df.question_title # 以title作GroupKFold分类
)):
if args.use_folds is not None and fold not in args.use_folds: # 根据 fold 配置来进行处理
continue
if not ignore_train: # 同样考虑是否有测试
train_subdf = train_df.iloc[train_index]
train_dataset = QuestDataset.from_frame(args, train_subdf, tokenizer)
else:
train_dataset = None
valid_dataset = QuestDataset.from_frame(
args, train_df.iloc[val_index], tokenizer
)
yield (
fold,
train_dataset,
valid_dataset,
train_df.iloc[train_index],
train_df.iloc[val_index],
)
def get_pseudo_dataset(args, pseudo_df, tokenizer):
return QuestDataset.from_frame(args, pseudo_df, tokenizer)
def get_test_dataset(args, test_df, tokenizer):
return QuestDataset.from_frame(args, test_df, tokenizer, True)