Академический Документы
Профессиональный Документы
Культура Документы
Introduction
Figure: A subset of the database
ASSET MANAGEMENT BY
LYXOR
QUANT TOUCH
Introduction
2 / 35
Introduction
LYXOR
QUANT TOUCH
Introduction
3 / 35
Introduction
LYXOR
QUANT TOUCH
Introduction
4 / 35
Outline
LYXOR
QUANT TOUCH
Hedge fund replication: factor selection and the lasso method Nonnegative matrix factorization Learning algorithms Trend forecasting with L1 and L2 lterings Support Vector Machine and nancial applications
5
Outline
5 / 35
ASSET MANAGEMENT BY
LYXOR
QUANT TOUCH
It is principally done using factor-based models: rolling least squares or Kalman ltering algorithms.
HF replication
RtHF =
m X i =1
i ,t Rti + t
RtTracker = +1
i ,t Rti +1
Hedge fund replication 6 / 35
i =1
Hedge fund replication: factor selection and the lasso method
ASSET MANAGEMENT BY
LYXOR
QUANT TOUCH
Considering the problem of factor selection is necessary: the universe of factor selection inuences the trackers performance. A solution: the lasso method. Trackers with dierent universes of factors
7 / 35
It corresponds to a linear regression with regularization of coecient estimates: L1 norm constraint of exposures.
Lasso regression
After the standardization of returns, we have:
= arg min R HF R
m
R HF R
u.c.
i =1
i2
where is the shrinkage measure of the lasso model with respect to the OLS model.
Lasso regression
8 / 35
Ranking of factors
Ranking of the lasso exposures (Feb. 28, 2011)
1. SPX 7. GOLD 2. HY 8. EMBI 3. GSCI 9. RTY 4. UST 10. TPX 5. MSCI EM 11. JPY/USD
ASSET MANAGEMENT BY
LYXOR
QUANT TOUCH 6. EUR/USD 12. SX5E
Empirical results
9 / 35
Cross-validation procedure
LYXOR
QUANT TOUCH
Principle
1 2
We build training and test samples from the lag window p . For one sequence of dierent [0, 1], we estimate the exposures i ,t on the training sample. We compute a statistic of interest on the test sample: performance, TE or MSE. We nd the value of which permits to optimize the statistic of interest.
3 4
Empirical results
10 / 35
LYXOR
QUANT TOUCH
Empirical results
11 / 35
NMF is an alternative approach to decomposition methods like PCA and ICA with the special feature to consider nonnegative matrices:
NMF decomposition
Let A be a nonnegative matrix m p :
A BC
with B and C nonnegative matrices of dimensions m n and n p . Considering a variable/observation storage in A, interpret B as a matrix of
12 / 35
Using the composition at the end of 2010, we compute NMF on the logarithm of the stock prices. Comparison between the EuroStoxx 50 and the rst NMF factor
We may interpret them as a factor of bear market and a factor of bull market.
Nonnegative matrix factorization Factor extraction of an equity universe 14 / 35
QUANT TOUCH
Data: weekly returns of 20 stocks. Period: January 2000 - December 2010. NMF on positive and negative returns (four patterns)
15 / 35
Stock classication
ASSET MANAGEMENT BY
LYXOR
QUANT TOUCH
Some stocks are more sensible to the representative NMF factor than to their corresponding sectors.
Classication of stocks
16 / 35
QUANT TOUCH
Apply the K-means procedure directly on the stocks returns. Results of the cluster analysis
Classication of stocks
17 / 35
ASSET MANAGEMENT BY
Can NMF classiers represent an alternative sector classication? Frequencies of sectors in each cluster
Classication of stocks
18 / 35
Bagging and boosting algorithms are recent powerful techniques which permit to reduce the error of any learning algorithms. These two methods consist in determining several classiers before aggregating them by voting. Dierence between the two algorithms
bagging uses bootstrap samples to construct classiers, boosting adjusts the weights of the training instances considering errors of classication.
Learning algorithms
19 / 35
We work on the improvement of a score used in a stock picking model. We use the current score based on a discrete optimization and a score built with a probit model. Probit score
S = (X + )
with (x ) the cumulative distribution function of the standard normal distribution and (, ) two vectors estimated using the estimator of the maximum likelihood.
Learning algorithms
20 / 35
QUANT TOUCH
The objective of index tilting is to maximize the score of the portfolio compared to the score of a benchmark. This optimization is under constraint of tracking error. Optimization problem x = arg max (x b ) s u.c. 1 x = 1 b = 1 and with: 2 = (x b ) (x b )
where x and b are respectively the portfolio and the benchmark weights, s is
the vector of score, the variance-covariance matrix of stocks and , the constraint of tracking error.
Learning algorithms Application to stock picking 21 / 35
QUANT TOUCH
Learning algorithms
QUANT TOUCH
Learning algorithms
Trend ltering
Noisy signal yt can be decomposed into trend xt and noise zt : yt = xt + zt L2 lter (Hodrick-Prescott lter) detects xt by minimizing: 1 y x 2 with second derivative D :
2 6 6 D=6 4
LYXOR
QUANT TOUCH
2 L2
+ Dx
2 L2
2 1
1 2
3 1 .. . 1 7 7 7 5 2 1
L1 ltering
Minimize the objective function with L1 pernalty: 1 y x 2
2 L2
LYXOR
QUANT TOUCH
+ Dx
L1
where D is discrete form of the rst or second derivative. Similar problems: Lasso regression (Tibshirani, 1996) or the L1 regularized least square problem (Daubechies, 2004) Properties of L1 ltering:
Using L1 norm 2nd derivation of xt must be zero. L1 norm allows xt change the trend without two much cost.
Trade-o between: residual noise and number of breaks. Determine by minimizing prediction error within caliration procedure.
Method Principle
25 / 35
LYXOR
QUANT TOUCH
Signal
150 150
Noisy signal
100
100
50
50
t
150
t HP lter
150
L1 -T lter ( =5285)
( =1217464)
Remarks
L1 lter gives hidden trend Direct trend prediction
100
100
50
50
50
50
500
1000
1500
2000
500
1000
1500
2000
Method Principle
26 / 35
Ornstein-Uhlenbeck process
LYXOR
QUANT TOUCH
Signal
Noisy signal
30 20 10 0 10 20
500
1000
1500
2000
t L1 -C lter
( =483)
t HP lter
( =2949)
30 20 10 0 10 20
Remarks
L1 is better than L2 simple for application
30 20 10 0 10 20
500
1000
1500
2000
500
1000
1500
2000
Method Principle
27 / 35
ASSET MANAGEMENT BY
2 2
+ 1 D1 x 2nd
+ 2 D2 x
1st
Signal
and
derivatives.
Noisy signal
2000 1500 1000 500 0 500 1000 1500 2000
t HP lter
( =43764340)
t
1000
1500
2000
Method Principle
28 / 35
LYXOR
QUANT TOUCH
Validation
Forecasting | T2 Today
-|
T2
Prediction
Scan data by the window T1 Compute the total error e (i ) end for Minimize the error e () to nd the optimal value Run the L1 lter with = end procedure
Method Principle
29 / 35
QUANT TOUCH
30 / 35
History
SVM rst introduced in 1992 as classication method SVM next interpreted as regression technique (Vapnik 1998) SVM applications in various elds: pattern recognition, bioinformation
Financial applications
SVM score: Score Binary classication SVM sector recognition: supervision method to classify stocks SVM ltering: trend extraction
SVM at a glance
31 / 35
i = 1...n
SVM at a glance
32 / 35
ASSET MANAGEMENT BY
Corss validation
Training set: Dene SVM classier Validation set: Minimize predicting error and SVM error SVM score constructed on both Training+Validation
0.9 0.8
P r (S > s|Y = 0)
P r (S > s|Y = 0)
0.7
0.1 0 0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1
P r (S > s)
0.1 0 0 0.1 0.2 0.3 0.4 0.5 0.6 0.7 0.8 0.9 1
P r (S > s)
SVM at a glance
33 / 35
LYXOR
QUANT TOUCH
0.1
0.05
0.05
0.1
|f (xi ) yi |2 + n 2 w
0.15
0.2 0
Remarks
Equivalent to SVM classication.
SVM regression
34 / 35
ASSET MANAGEMENT BY
LYXOR
QUANT TOUCH
SVM regression
35 / 35