-
Notifications
You must be signed in to change notification settings - Fork 8
/
CustomXGBoost.py
584 lines (470 loc) · 19 KB
/
CustomXGBoost.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
387
388
389
390
391
392
393
394
395
396
397
398
399
400
401
402
403
404
405
406
407
408
409
410
411
412
413
414
415
416
417
418
419
420
421
422
423
424
425
426
427
428
429
430
431
432
433
434
435
436
437
438
439
440
441
442
443
444
445
446
447
448
449
450
451
452
453
454
455
456
457
458
459
460
461
462
463
464
465
466
467
468
469
470
471
472
473
474
475
476
477
478
479
480
481
482
483
484
485
486
487
488
489
490
491
492
493
494
495
496
497
498
499
500
501
502
503
504
505
506
507
508
509
510
511
512
513
514
515
516
517
518
519
520
521
522
523
524
525
526
527
528
529
530
531
532
533
534
535
536
537
538
539
540
541
542
543
544
545
546
547
548
549
550
551
552
553
554
555
556
557
558
559
560
561
562
563
564
565
566
567
568
569
570
571
572
573
574
575
576
577
578
579
580
581
582
583
584
import numpy as np
import pandas as pd
class Node:
def __init__(self, x, y, grad, hess, depth = 6, gamma = 0, min_child_weight = 1, lambda_ = 1, colsample = 1):
self.x = x
self.y = y
self.grad = grad
self.hess = hess
self.depth = depth
self.gamma = gamma
self.lambda_ = lambda_
self.min_child_weight = min_child_weight
self.colsample = colsample
self.cols = np.random.permutation(x.shape[1])[:round(colsample * x.shape[1])]
self.sim_score = self.similarity_score([True]*x.shape[0])
self.gain = float("-inf")
self.split_col = None
self.split_row = None
self.lhs_tree = None
self.rhs_tree = None
self.pivot = None
self.val = None
# making split
self.split_node()
if self.is_leaf:
self.val = - np.sum(grad) / (np.sum(hess) + lambda_)
def split_node(self):
self.find_split()
# checking whether it's a leaf or not
if self.is_leaf:
return
x = self.x[:, self.split_col]
lhs = x <= x[self.split_row]
rhs = x > x[self.split_row]
# creating further nodes recursivly
self.lhs_tree = Node(
self.x[lhs],
self.y[lhs],
self.grad[lhs],
self.hess[lhs],
depth = self.depth - 1,
gamma = self.gamma,
min_child_weight = self.min_child_weight,
lambda_ = self.lambda_,
colsample = self.colsample
)
self.rhs_tree = Node(
self.x[rhs],
self.y[rhs],
self.grad[rhs],
self.hess[rhs],
depth = self.depth - 1,
gamma = self.gamma,
min_child_weight = self.min_child_weight,
lambda_ = self.lambda_,
colsample = self.colsample
)
def find_split(self):
# iterate through every feature and row
for c in self.cols:
x = self.x[:, c]
for row in range(self.x.shape[0]):
pivot= x[row]
lhs = x <= pivot
rhs = x > pivot
sim_lhs = self.similarity_score(lhs)
sim_rhs = self.similarity_score(rhs)
gain = sim_lhs + sim_rhs - self.sim_score - self.gamma
if gain < 0 or self.not_valid_split(lhs) or self.not_valid_split(rhs):
continue
if gain > self.gain:
self.split_col = c
self.split_row = row
self.pivot = pivot
self.gain = gain
def not_valid_split(self, masks):
if np.sum(self.hess[masks]) < self.min_child_weight:
return True
return False
@property
def is_leaf(self):
if self.depth < 0 or self.gain == float("-inf"):
return True
return False
def similarity_score(self, masks):
return np.sum(self.grad[masks]) ** 2 / ( np.sum(self.hess[masks]) + self.lambda_ )
def predict(self, x):
return np.array([self.predict_single_val(row) for row in x])
def predict_single_val(self, x):
if self.is_leaf:
return self.val
return self.lhs_tree.predict_single_val(x) if x[self.split_col] <= self.pivot else self.rhs_tree.predict_single_val(x)
class XGBTree:
def __init__(self, x, y, grad, hess, depth = 6, gamma = 0, min_child_weight = 1, lambda_ = 1, colsample = 1, subsample = 1):
indices = np.random.permutation(x.shape[0])[:round(subsample * x.shape[0])]
self.tree = Node(
x[indices],
y[indices],
grad[indices],
hess[indices],
depth = depth,
gamma = gamma,
min_child_weight = min_child_weight,
lambda_ = lambda_,
colsample = colsample,
)
def predict(self, x):
return self.tree.predict(x)
class XGBRegressor:
def __init__(self, eta = 0.3, n_estimators = 100, max_depth = 6, gamma = 0, min_child_weight = 1, lambda_ = 1, colsample = 1, subsample = 1):
self.eta = eta
self.n_estimators = n_estimators
self.max_depth = max_depth
self.gamma = gamma
self.min_child_weight = min_child_weight
self.lambda_ = lambda_
self.colsample = colsample
self.subsample = subsample
self.history = {
"train" : list(),
"test" : list()
}
# list of all weak learners
self.trees = list()
self.base_pred = None
def fit(self, x, y, eval_set = None):
# checking Datatypes
if isinstance(x, pd.DataFrame) or isinstance(x, pd.Series):
x = x.values
if not isinstance(x, np.ndarray):
raise TypeError("Input should be pandas Dataframe/Series or numpy array.")
if isinstance(y, pd.DataFrame) or isinstance(y, pd.Series):
y = y.values
if not isinstance(y, np.ndarray):
raise TypeError("Input should be pandas Dataframe/Series or numpy array.")
base_pred = np.full(y.shape, np.mean(y)).astype("float64")
self.base_pred = np.mean(y)
for n in range(self.n_estimators):
grad = self.grad(y, base_pred)
hess = self.hess(y, base_pred)
estimator = XGBTree(
x,
y,
grad,
hess,
depth = self.max_depth,
gamma = self.gamma,
min_child_weight = self.min_child_weight,
lambda_ = self.lambda_,
colsample = self.colsample,
subsample = self.subsample
)
base_pred = base_pred + self.eta * estimator.predict(x)
self.trees.append(estimator)
if eval_set:
X = eval_set[0]
Y = eval_set[1]
cost = np.sqrt(np.mean(self.loss(Y, self.predict(X))))
self.history["test"].append(cost)
print(f"[{n}] validation_set-rmse : {cost}", end="\t")
cost = np.sqrt(np.mean(self.loss(y, base_pred)))
self.history["train"].append(cost)
print(f"[{n}] train_set-rmse : {cost}")
def predict(self, x):
base_pred = np.full((x.shape[0],), self.base_pred).astype("float64")
for tree in self.trees:
base_pred += self.eta * tree.predict(x)
return base_pred
def loss(self, y, a):
return (y - a)**2
def grad(self, y, a):
# for 0.5 * (y - a)**2
return a - y
def hess(self, y, a):
# for 0.5 * (y - a)**2
return np.full((y.shape), 1)
class XGBClassifierBase:
def __init__(self, eta = 0.3, n_estimators = 100, max_depth = 6, gamma = 0, min_child_weight = 1, lambda_ = 1, colsample = 1, subsample = 1):
self.eta = eta
self.n_estimators = n_estimators
self.max_depth = max_depth
self.gamma = gamma
self.min_child_weight = min_child_weight
self.lambda_ = lambda_
self.colsample = colsample
self.subsample = subsample
# list of all weak learners
self.trees = list()
self.base_pred = None
def fit(self, x, y):
# checking Datatypes
if isinstance(x, pd.DataFrame) or isinstance(x, pd.Series):
x = x.values
if not isinstance(x, np.ndarray):
raise TypeError("Input should be pandas Dataframe/Series or numpy array.")
if isinstance(y, pd.DataFrame) or isinstance(y, pd.Series):
y = y.values
if not isinstance(y, np.ndarray):
raise TypeError("Input should be pandas Dataframe/Series or numpy array.")
base_pred = np.full(y.shape, np.mean(y)).astype("float64")
self.base_pred = np.mean(y)
for n in range(self.n_estimators):
grad = self.grad(y, base_pred)
hess = self.hess(y, base_pred)
estimator = XGBTree(
x,
y,
grad,
hess,
depth = self.max_depth,
gamma = self.gamma,
min_child_weight = self.min_child_weight,
lambda_ = self.lambda_,
colsample = self.colsample,
subsample = self.subsample
)
base_pred = base_pred + self.eta * estimator.predict(x)
self.trees.append(estimator)
def predict(self, x, prob=True):
base_pred = np.full((x.shape[0],), self.base_pred).astype("float64")
for tree in self.trees:
base_pred += self.eta * tree.predict(x)
pred_prob = self.sigmoid(base_pred)
if prob: return pred_prob
return np.where(pred_prob > 0.5, 1, 0)
@staticmethod
def sigmoid(x):
return 1 / (1 + np.exp(-x))
def loss(self, y, a):
return - (y * np.log(a) + (1 - y) * np.log(1 - a))
def grad(self, y, a):
a_prob = self.sigmoid(a)
return a_prob - y
def hess(self, y, a):
a_prob = self.sigmoid(a)
return a_prob * (1 - a_prob)
class XGBClassifier:
def __init__(self, n_classes, eta = 0.3, n_estimators = 100, max_depth = 6, gamma = 0, min_child_weight = 1, lambda_ = 1, colsample = 1, subsample = 1):
self.n_classes = n_classes
self.eta = eta
self.n_estimators = n_estimators
self.max_depth = max_depth
self.gamma = gamma
self.min_child_weight = min_child_weight
self.lambda_ = lambda_
self.colsample = colsample
self.subsample = subsample
self.history = {
"train" : list(),
"test" : list()
}
# list of all binary classifiers learners
self.trees = list()
for n in range(n_classes):
tree = XGBClassifierBase(
eta = eta,
n_estimators = n_estimators,
max_depth = max_depth,
gamma = gamma,
min_child_weight = min_child_weight,
lambda_ = lambda_,
colsample = colsample,
subsample = subsample
)
self.trees.append(tree)
def fit(self, x, y, eval_set = None):
# checking Datatypes
if isinstance(x, pd.DataFrame) or isinstance(x, pd.Series):
x = x.values
if not isinstance(x, np.ndarray):
raise TypeError("Input should be pandas Dataframe/Series or numpy array.")
if isinstance(y, pd.DataFrame) or isinstance(y, pd.Series):
y = y.values
if not isinstance(y, np.ndarray):
raise TypeError("Input should be pandas Dataframe/Series or numpy array.")
one_hot_y = self.get_one_hot(y, self.n_classes)
for n in range(self.n_classes):
print(f"tree{n+1}")
y = one_hot_y[:, n]
tree = self.trees[n]
tree.fit(x, y)
def predict(self, x):
y = self.trees[0].predict(x).reshape(-1, 1)
for i in range(1, self.n_classes):
y = np.concatenate((y, self.trees[i].predict(x).reshape(-1, 1)), axis = 1)
return y.argmax(axis=1)
def loss(self, y, a):
return (y - a)**2
@staticmethod
def get_one_hot(target, nb_classes):
one_hot = np.zeros((target.shape[0], nb_classes))
rows = np.arange(target.shape[0])
one_hot[rows, target] = 1
return one_hot
class XGBRegressorAdam:
def __init__(self, eta = 0.3, n_estimators = 100, max_depth = 6, gamma = 0, min_child_weight = 1, lambda_ = 1, colsample = 1, subsample = 1):
self.eta = eta
self.n_estimators = n_estimators
self.max_depth = max_depth
self.gamma = gamma
self.min_child_weight = min_child_weight
self.lambda_ = lambda_
self.colsample = colsample
self.subsample = subsample
self.history = {
"train" : list(),
"test" : list()
}
# list of all weak learners
self.trees = list()
self.base_pred = None
# adam params
self.b1 = 0.9
self.b2 =0.999
self.epsilon = 1e-7
def fit(self, x, y, eval_set = None):
# checking Datatypes
if isinstance(x, pd.DataFrame) or isinstance(x, pd.Series):
x = x.values
if not isinstance(x, np.ndarray):
raise TypeError("Input should be pandas Dataframe/Series or numpy array.")
if isinstance(y, pd.DataFrame) or isinstance(y, pd.Series):
y = y.values
if not isinstance(y, np.ndarray):
raise TypeError("Input should be pandas Dataframe/Series or numpy array.")
base_pred = np.full(y.shape, np.mean(y)).astype("float64")
self.base_pred = np.mean(y)
vd = np.full(y.shape, 0).astype("float64")
sd = np.full(y.shape, 0).astype("float64")
for n in range(self.n_estimators):
grad = self.grad(y, base_pred)
hess = self.hess(y, base_pred)
estimator = XGBTree(
x,
y,
grad,
hess,
depth = self.max_depth,
gamma = self.gamma,
min_child_weight = self.min_child_weight,
lambda_ = self.lambda_,
colsample = self.colsample,
subsample = self.subsample
)
dw = estimator.predict(x)
#####
vd = self.b1 * vd + (1 - self.b1) * dw
sd = self.b2 * sd + (1 - self.b2) * (dw**2)
lr = self.eta #np.sqrt(1 - self.b2**(n+1)) / (1 - self.b1**(n+1))
#####
base_pred = base_pred + lr * vd / (np.sqrt(sd) + self.epsilon)
self.trees.append(estimator)
if eval_set:
X = eval_set[0]
Y = eval_set[1]
cost = np.sqrt(np.mean(self.loss(Y, self.predict(X))))
self.history["test"].append(cost)
print(f"[{n}] validation_set-rmse : {cost}", end="\t")
cost = np.sqrt(np.mean(self.loss(y, base_pred)))
self.history["train"].append(cost)
print(f"[{n}] train_set-rmse : {cost}")
def predict(self, x):
vd = np.full((x.shape[0],), 0).astype("float64")
sd = np.full((x.shape[0],), 0).astype("float64")
base_pred = np.full((x.shape[0],), self.base_pred).astype("float64")
n = 1
for tree in self.trees:
dw = tree.predict(x)
#####
vd = self.b1 * vd + (1 - self.b1) * dw
sd = self.b2 * sd + (1 - self.b2) * (dw**2)
lr = self.eta #np.sqrt(1 - self.b2**(n+1)) / (1 - self.b1**(n+1))
n += 1
#####
base_pred += lr * vd / (np.sqrt(sd) + self.epsilon)
return base_pred
def loss(self, y, a):
return (y - a)**2
def grad(self, y, a):
# for 0.5 * (y - a)**2
return a - y
def hess(self, y, a):
# for 0.5 * (y - a)**2
return np.full((y.shape), 1)
class XGBRegressorRMS:
def __init__(self, eta = 0.3, n_estimators = 100, max_depth = 6, gamma = 0, min_child_weight = 1, lambda_ = 1, colsample = 1, subsample = 1):
self.eta = eta
self.n_estimators = n_estimators
self.max_depth = max_depth
self.gamma = gamma
self.min_child_weight = min_child_weight
self.lambda_ = lambda_
self.colsample = colsample
self.subsample = subsample
self.history = {
"train" : list(),
"test" : list()
}
# list of all weak learners
self.trees = list()
self.base_pred = None
# adam params
self.b1 = 0.9
self.b2 =0.999
self.epsilon = 1e-7
def fit(self, x, y, eval_set = None):
# checking Datatypes
if isinstance(x, pd.DataFrame) or isinstance(x, pd.Series):
x = x.values
if not isinstance(x, np.ndarray):
raise TypeError("Input should be pandas Dataframe/Series or numpy array.")
if isinstance(y, pd.DataFrame) or isinstance(y, pd.Series):
y = y.values
if not isinstance(y, np.ndarray):
raise TypeError("Input should be pandas Dataframe/Series or numpy array.")
base_pred = np.full(y.shape, np.mean(y)).astype("float64")
self.base_pred = np.mean(y)
sd = np.full(y.shape, 0).astype("float64")
for n in range(self.n_estimators):
grad = self.grad(y, base_pred)
hess = self.hess(y, base_pred)
estimator = XGBTree(
x,
y,
grad,
hess,
depth = self.max_depth,
gamma = self.gamma,
min_child_weight = self.min_child_weight,
lambda_ = self.lambda_,
colsample = self.colsample,
subsample = self.subsample
)
dw = estimator.predict(x)
#####
sd = self.b2 * sd + (1 - self.b2) * (dw**2)
#sd = sd / np.sqrt(1 - self.b2**(n+1))
#####
base_pred = base_pred + self.eta * dw / (np.sqrt(sd) + self.epsilon)
self.trees.append(estimator)
if eval_set:
X = eval_set[0]
Y = eval_set[1]
cost = np.sqrt(np.mean(self.loss(Y, self.predict(X))))
self.history["test"].append(cost)
print(f"[{n}] validation_set-rmse : {cost}", end="\t")
cost = np.sqrt(np.mean(self.loss(y, base_pred)))
self.history["train"].append(cost)
print(f"[{n}] train_set-rmse : {cost}")
def predict(self, x):
sd = np.full((x.shape[0],), 0).astype("float64")
base_pred = np.full((x.shape[0],), self.base_pred).astype("float64")
n = 1
for tree in self.trees:
dw = tree.predict(x)
#####
sd = self.b2 * sd + (1 - self.b2) * (dw**2)
#sd = sd / np.sqrt(1 - self.b2**(n+1))
n += 1
#####
base_pred += self.eta * dw / (np.sqrt(sd) + self.epsilon)
return base_pred
def loss(self, y, a):
return (y - a)**2
def grad(self, y, a):
# for 0.5 * (y - a)**2
return a - y
def hess(self, y, a):
# for 0.5 * (y - a)**2
return np.full((y.shape), 1)