-
Notifications
You must be signed in to change notification settings - Fork 0
/
Regressors.py
607 lines (425 loc) · 20.1 KB
/
Regressors.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
585
586
587
588
589
590
591
592
593
594
595
596
597
598
599
600
601
602
603
604
605
606
607
# -*- coding: utf-8 -*-
import matplotlib.pyplot as plt
import numpy as np, scipy as sp
from math import sqrt, exp, ceil, floor , isclose
from sklearn import cluster, linear_model, ensemble, preprocessing, svm, kernel_ridge, metrics
###############################
# Tool functions
###############################
# function that looks like a call option profile
def callLike(x,shift=0.0,factor=1.0):
return np.log( 1.0 + np.exp(factor*(x-shift)) ) / factor
# function that looks like a call spread option profile
def callSpreadLike(x,shift=0.0,factor=1.0):
return np.log( 1.0 + np.exp(factor*(x-shift)) ) / factor
# check if a payoff has a cap or a floor, triggers are % of empirical distribution that validate the presence of a limit
def checkPayoffCapFloor( payoff, floorTrigger = 0.0001, capTrigger = 0.0001):
if payoff is None or payoff.shape[0]==0:
return False, None, False, None
nbSamples = payoff.shape[0]
floor = np.amin(payoff)
cap = np.amax(payoff)
floorOccurences = np.sum(np.isclose(payoff,floor)) #/ nbSamples
capOccurences = np.sum(np.isclose(payoff,cap)) #/ nbSamples
checkHasFloor = ( floorOccurences >= 2 )
checkHasCap = ( capOccurences >= 2 )
return checkHasFloor, floor if checkHasFloor else None, checkHasCap, cap if checkHasCap else None
###############################
# Regressor classes
###############################
# Simple logistic classifier
class LogisticClassifier(object):
def __init__(self,C=1.0,d=2):
self.C = C
self.d = d
# initialise the polynomial regressor
self.polynomialTransformer = preprocessing.PolynomialFeatures(self.d,False,False)
self.clf = linear_model.LogisticRegression(C=1.0)
def fit(self,X,y):
data = self.polynomialTransformer.fit_transform(X)
self.clf.fit(data,y)
return self
def predict_proba(self,X):
data = self.polynomialTransformer.fit_transform(X)
return self.clf.predict_proba(data)
###############################
# Combination of projection on factor calls or moments with regression on remainder
###############################
from Payoffs import CallPrice
normalMoments = [0,1,0,3,0,15]
def getFactorMoment(Z,T,d):
if d==1:
return Z
elif d==2:
return Z**2 + T
elif d==3:
return Z**3 + 3.*Z*T
elif d==4:
return Z**4 + 6.*(Z**2)*T + 3.*(T**2)
elif d==5:
return Z**5 + 10.*(Z**3)*T + 15.*Z*(T**2)
elif d==6:
return Z**6 + 15.*(Z**4)*T + 45.*(Z**2)*(T**2) + 15.*(T**3)
else:
raise Exception('Factor moment degree must be between 1 and 6')
def getFactorProjection(projectionType,projectionParams,T,Z):
if projectionParams is None:
return np.zeros((Z.shape[0]))
factorProjectors = None
if projectionType == 'calls':
# compute all the calls on factor + fwd
factorProjectors = np.empty((Z.shape[0],projectionParams['strikes'].shape[1]+1))
factorProjectors[:,0] = Z.reshape((-1))
for idx, strike in enumerate(projectionParams['strikes'][0,:]):
factorProjectors[:,idx+1] = CallPrice(strike,Z.reshape((-1)),T,'n',1.0)
else:
# compute all the moments of factor
factorProjectors = np.empty((Z.shape[0],projectionParams['degree']))
for i in range(projectionParams['degree']):
factorProjectors[:,i] = getFactorMoment(Z.reshape((-1)),T,i+1)
# then use embedded regressor to compute the projection
return projectionParams['decomposition'].predict(factorProjectors)
# Regressor recomposed from factor calls or moments projection and remainder regressor
class ProjectionRegressor(object):
def __init__(self,projectionType,projection,remainderRegressor):
super().__init__()
self.projectionType = projectionType
self.projection = projection
self.remainderRegressor = remainderRegressor
def predict(self,T,Z,X):
prediction = getFactorProjection(self.projectionType,self.projection,T,Z)
if self.remainderRegressor is not None:
prediction += self.remainderRegressor.predict(X)
return prediction
###############################
# Regressor classes
###############################
# Regressor base class
class Regressor(object):
def __init__(self):
return
def fit(self,X,y):
return self
def predict(self,X):
raise Exception('Unhandled predict method')
def getRisks(self,X):
# manual bump and recompute
dx = .0001
fX = self.predict(X)
fXDown = self.predict(X*(1-dx))
fXUp = self.predict(X*(1+dx))
deltas = (fXUp-fXDown) / (2.*X*dx)
gammas = (fXUp-2.*fX+fXDown) / (X*dx)**2
return deltas, gammas
# Regressor wrapper from a function
class FromFunctionRegressor(Regressor):
def __init__(self,f=None):
super().__init__()
self.f = f
def predict(self,X):
return self.f(X).reshape((-1))
# Simple polynomial regressor
class PolynomialRegressor(Regressor):
def __init__(self,alpha=0.0,d=2):
super().__init__()
self.alpha = alpha
self.d = d
# initialise the polynomial regressor
self.polynomialTransformer = preprocessing.PolynomialFeatures(self.d,False,False)
self.regressor = linear_model.Ridge(alpha=self.alpha,fit_intercept=True,normalize=True,solver='cholesky')
def fit(self,X,y,sample_weight=None):
data = self.polynomialTransformer.fit_transform(X)
self.regressor.fit(data,y,sample_weight)
return self
def predict(self,X):
data = self.polynomialTransformer.fit_transform(X)
return self.regressor.predict(data)
# Chebyshev regressor
class ChebyshevRegressor(Regressor):
def __init__(self,d=2):
super().__init__()
self.d = d
self.chebyshevRegressor = None
def fit(self,X,y):
if X.shape[1] > 1:
raise Exception('Chebyshev multivariate not available yet')
# save borders as we will extrapolate flat
self.minAbscissa = np.min(X)
self.maxAbscissa = np.max(X)
self.chebyshevRegressor = np.polynomial.Chebyshev.fit(X.reshape((-1)),y.reshape((-1)),self.d)
self.minAbscissaPrediction = self.chebyshevRegressor(self.minAbscissa)
self.maxAbscissaPrediction = self.chebyshevRegressor(self.maxAbscissa)
return self
def predict(self,X):
if X.shape[1] > 1:
raise Exception('Chebyshev multivariate not available yet')
newX = X.reshape((-1))
# predictions = self.minAbscissaPrediction * (newX<self.minAbscissa) \
# + self.chebyshevRegressor(newX) * (newX>=self.minAbscissa) * (newX<=self.maxAbscissa) \
# + self.maxAbscissaPrediction * (newX>self.maxAbscissa)
predictions = self.chebyshevRegressor(newX)
return predictions
# Regressor inside a region with cap and floor forecast
class CapFloorRegionRegressor(Regressor):
def resetRegion(self):
# floor and cap of the payoff
self.hasFloor = False
self.floor = None
self.hasCap = False
self.cap = None
# check if payoff is constant
self.isCt = False
self.emptyRegressor = False
self.floorRegionIdx = None
self.inBetweenRegionIdx = None
self.capRegionIdx = None
def __init__(self,classifierName='l',classifierParams={},regressorName='p',regressorParams={}):
super().__init__()
self.classifierName = classifierName
self.classifierParams = classifierParams
self.regressorName = regressorName
self.regressorParams = regressorParams
self.resetRegion()
# also initialise the logistic regressor that will find regions projection
self.clf = getClassifier(self.classifierName,self.classifierParams)
# initialise the polynomial regressor
self.regressor = getRegressor(self.regressorName,self.regressorParams)
def transform(self,X):
transformedX = X
# for shift, factor in [(0.0,1.0)]:
# for shift, factor in [(0.0,0.75),(0.0,1.0),(0.0,1.5)]:
# for shift, factor in [(0.0,0.9),(0.0,0.95),(0.0,1.0),(0.0,1.05),(0.0,1.1)]:
# transformedX = np.append(transformedX,callLike(X,shift,factor),axis=1)
return transformedX
def fit(self,X,y):
# check payoff floor / cap
self.resetRegion()
self.hasFloor, self.floor, self.hasCap, self.cap = checkPayoffCapFloor(y)
self.isCt = self.hasFloor and self.hasCap and isclose(self.floor,self.cap)
if self.isCt:
return self
transformedX = self.transform(X)
if self.hasFloor or self.hasCap:
# label payoffs according to the region found (floor=0, inBetween=1, cap=2)
yLabels = np.empty_like(y)
yLabels[y==self.floor] = 0
inBetween = (1-(y==self.cap))*(1-(y==self.floor))==1
yLabels[inBetween] = 1
yLabels[y==self.cap] = 2
#- check for labels idx when forecasting probas
nbInBetween = np.sum(inBetween)
if self.hasFloor:
self.floorRegionIdx = 0
if nbInBetween !=0:
self.inBetweenRegionIdx = 1
self.capRegionIdx = 2 if self.hasCap else None
else:
self.inBetweenRegionIdx = None
self.capRegionIdx = 1 if self.hasCap else None
else:
self.floorRegionIdx = None
if nbInBetween !=0:
self.inBetweenRegionIdx = 0
self.capRegionIdx = 1
else:
self.inBetweenRegionIdx = None
self.capRegionIdx = 0
# train the classifier on these labels
self.clf.fit(transformedX,yLabels)
# train the polynomial regressor only in between floor and cap
if nbInBetween != 0:
self.regressor.fit(transformedX[yLabels==1,:],y[yLabels==1])
else:
# case where we have only caps and floors, nothing in between
self.emptyRegressor = True
else:
self.regressor.fit(transformedX,y)
return self
def predict(self,X):
if self.isCt:
return self.floor * np.ones((X.shape[0]))
transformedX = self.transform(X)
if self.hasFloor or self.hasCap:
regionsProba = self.clf.predict_proba(transformedX)
forecasts = None
if self.emptyRegressor:
forecasts = np.zeros(X.shape[0])
else:
forecasts = self.regressor.predict(transformedX) * regionsProba[:,self.inBetweenRegionIdx]
if self.hasFloor:
forecasts += self.floor * regionsProba[:,self.floorRegionIdx]
if self.hasCap:
forecasts += self.cap * regionsProba[:,self.capRegionIdx]
return forecasts
else:
return self.regressor.predict(transformedX)
# Data points are clustered using kMeans algorithm and a specific regressor is attached to each cluster
class ClusteredRegressor(Regressor):
def __init__(self,nbClusters=5,clusteringFraction=1.0,clusteringFractionRandomSelect=False,smoothing=False,smoothingNbNeighbors=2,smoothingGamma=None,regressorName='p',regressorParams={}):
super().__init__()
self.nbClusters = nbClusters
self.clusteringFraction = clusteringFraction
self.clusteringFractionRandomSelect = clusteringFractionRandomSelect
self.smoothing = smoothing
self.smoothingNbNeighbors = smoothingNbNeighbors
self.smoothingGamma = smoothingGamma
self.regressorName = regressorName
self.regressorParams = regressorParams
self.kMeans = None
self.fitLabels = None
self.regressors = []
self.caps = []
self.floors = []
def fitSet(self):
# returns the centroids and labels of the dataset used that was fit
return self.kMeans.cluster_centers_, self.fitLabels
def fit(self,X,y):
self.regressors = []
# cluster points first
# select a fraction of the incoming dataset for clustering only
nbPointsForClustering = ceil(self.clusteringFraction * X.shape[0])
clusteringDataStart = 0
if self.clusteringFractionRandomSelect:
clusteringDataStart = np.random.randint(0,X.shape[0]-nbPointsForClustering)
# create and fit the clustering algo
clusteringData = X[clusteringDataStart:clusteringDataStart+nbPointsForClustering]
self.kMeans = cluster.KMeans(init=clusteringData[:self.nbClusters], n_clusters=self.nbClusters, n_init=1)
self.kMeans.fit(clusteringData)
# now get labels for all the points in the training dataset
self.fitLabels = self.kMeans.predict(X)
# then regress inside each cluster
centroids = self.kMeans.cluster_centers_
for iCls in range(self.nbClusters):
clusterRegressor = getRegressor(self.regressorName,self.regressorParams)
# check for caps or floors in the payoff
clusterFloor = None
clusterCap = None
clusterHasFloor, clusterFloor, clusterHasCap, clusterCap = checkPayoffCapFloor(y[self.fitLabels==iCls])
self.floors.append(clusterFloor)
self.caps.append(clusterCap)
# reduce data to that cluster
dataCls = X[self.fitLabels==iCls]
yCls = y[self.fitLabels==iCls]
# check if there is actually sthg to regress inside that cluster
if dataCls.shape[0] != 0:
clusterRegressor.fit(dataCls,yCls)
self.regressors.append(clusterRegressor)
# check if we should perform smoothing using a kernel
if self.smoothing:
smoothedRegressors = []
# get prediction using the regressors that have just been fit
smoothingY = self.predict(X)
for iCls in range(self.nbClusters):
clusterRegressor = getRegressor(self.regressorName,self.regressorParams)
# create a gaussian kernel and compute weigths that will be applied to each cluster point
clustersWeights = metrics.pairwise.rbf_kernel(centroids,centroids[iCls].reshape((1,-1)),self.smoothingGamma).reshape((-1))
# just keep k closest clusters
selectedClusters = np.argsort(clustersWeights)[::-1][:self.smoothingNbNeighbors+1]
selectedPoints = np.isin(self.fitLabels,selectedClusters)
# reduce data for that cluster
dataCls = X[selectedPoints]
yCls = smoothingY[selectedPoints]
dataWeights = clustersWeights[self.fitLabels[selectedPoints]]
# run regression
clusterRegressor.fit(dataCls,yCls,dataWeights)
smoothedRegressors.append(clusterRegressor)
self.regressors = smoothedRegressors
return self
def predict(self,X):
# first find clusters the points belong to
labels = self.kMeans.predict(X)
# run predictions for each cluster
predictions = np.zeros(X.shape[0])
for iCls in range(self.nbClusters):
if np.sum(labels==iCls) != 0:
dataCls = X[labels==iCls]
predictions[labels==iCls] = self.regressors[iCls].predict(dataCls)
# if self.caps[iCls] is not None:
# predictions[labels==iCls] = np.minimum(self.caps[iCls],predictions[labels==iCls])
# if self.floors[iCls] is not None:
# predictions[labels==iCls] = np.maximum(self.floors[iCls],predictions[labels==iCls])
return predictions
def getRisks(self,X):
# first find clusters the points belong to
labels = self.kMeans.predict(X)
# get risks for each cluster
deltas = np.zeros(X.shape[0])
gammas = np.zeros(X.shape[0])
for iCls in range(self.nbClusters):
if np.sum(labels==iCls) != 0:
dataCls = X[labels==iCls]
deltas[labels==iCls], gammas[labels==iCls] = self.regressors[iCls].getRisks(dataCls)
return deltas, gammas
# Averaging regression on several sub-training sets
class AveragedRegressor(Regressor):
def __init__(self,subRegressorsSetup):
super().__init__()
self.subRegressorsSetup = subRegressorsSetup
self.nbSubRegressors = len(self.subRegressorsSetup)
def fit(self,X,y):
self.weights = []
self.regressors = []
# train each sub-regressor
self.scaling = .0
for subRegSetup in self.subRegressorsSetup:
weight = subRegSetup.get('regressorWeight',1./self.nbSubRegressors)
self.weights.append(weight)
self.scaling += weight
subRegressor = getRegressor(subRegSetup.get('regressorName','p'),subRegSetup.get('regressorParams',{}))
subRegressor.fit(X,y)
self.regressors.append(subRegressor)
return self
def predict(self,X):
prediction = np.zeros(X.shape[0])
for subRegIdx, subReg in enumerate(self.regressors):
prediction += self.weights[subRegIdx] * subReg.predict(X)
return prediction / self.scaling
def getRisks(self,X):
deltas = np.zeros(X.shape[0])
gammas = np.zeros(X.shape[0])
for subRegIdx, subReg in enumerate(self.regressors):
regDeltas, regGammas = subReg.getRisks(X)
deltas += self.weights[subRegIdx] * regDeltas
gammas += self.weights[subRegIdx] * regGammas
return deltas / self.scaling, gammas / self.scaling
# Factory
# Add test regressors here
def getRegressor( regressorName, regressorParams):
if regressorName == 'p':
return PolynomialRegressor(**regressorParams)
elif regressorName == 'ch':
return ChebyshevRegressor(**regressorParams)
elif regressorName == 'c':
return ClusteredRegressor(**regressorParams)
elif regressorName == 'a':
return AveragedRegressor(**regressorParams)
elif regressorName == 'rf':
return ensemble.RandomForestRegressor(**regressorParams) #(max_depth=5)
elif regressorName == 'cfr':
return CapFloorRegionRegressor(**regressorParams)
elif regressorName == 'svr':
return svm.SVR(**regressorParams)
elif regressorName == 'kr':
return kernel_ridge.KernelRidge(**regressorParams)
else:
raise Exception('Unhandled regression method: ' + regressorName)
def getClassifier( classifierName, classifierParams):
if classifierName == 'l':
return LogisticClassifier(**classifierParams)
else:
raise Exception('Unhandled classification method: ' + classifierName)
regressorNameLabelMapping = {
'p': 'Polynomial Regression',
'ch': 'Chebyshev Regression',
'c': 'Clustered Regression',
'a': 'Averaged Regression',
'rf': 'Random Forest Regression',
'cfr': 'Cap Floor Region Regression',
'svr': 'Support Vector Regression',
'kr': 'Kernel Ridge Regression'
}
def getRegressorLabel(testRegressorName):
if testRegressorName in regressorNameLabelMapping:
return regressorNameLabelMapping[testRegressorName]
else:
return testRegressorName