statistical arbitrage ms&e 448 midterm presentation...statistical arbitrage ms&e 448 midterm...
TRANSCRIPT
Statistical ArbitrageMS&E 448 Midterm Presentation
Shane Barratt Russell Clarida Mert Esencan Francesco InsullaCole Kiersznowski Andrew Perry1
Stanford University
May 5, 2020
1Authors listed in alphabetical orderShane Barratt, Russell Clarida, Mert Esencan, Francesco Insulla, Cole Kiersznowski, Andrew Perry (Stanford University)Statistical Arbitrage May 5, 2020 1 / 18
Overview
1 Background
2 Data
3 Preliminary Implementation
4 Next Steps
Shane Barratt, Russell Clarida, Mert Esencan, Francesco Insulla, Cole Kiersznowski, Andrew Perry (Stanford University)Statistical Arbitrage May 5, 2020 2 / 18
Background
Background
Statistical arbitrage = short-term trading strategy that bets onmean-reversion of asset baskets (more later)
The intuition of statistical arbitrage is based on the idea that thedifference between what an equities’ price is and what it should be isdriven by idiosyncratic shocks
Statistical arbitrage requires 3 steps:1 Finding asset baskets2 Prediction based on mean-reversion3 Portfolio construction
Shane Barratt, Russell Clarida, Mert Esencan, Francesco Insulla, Cole Kiersznowski, Andrew Perry (Stanford University)Statistical Arbitrage May 5, 2020 3 / 18
Background
Market–Neutral Investments
n assets, with prices pt ∈ Rn+ at time period t = 1, . . . ,T
Assume assets are hedged w.r.t. market, i.e., each asset is actually 1unit of the asset and −β units of the market, where β is thecorrelation of the market returns with the asset returns
Observation: Investing (long or short) in any of these assets ismarket-neutral
Shane Barratt, Russell Clarida, Mert Esencan, Francesco Insulla, Cole Kiersznowski, Andrew Perry (Stanford University)Statistical Arbitrage May 5, 2020 4 / 18
Background
Finding Pairs
For each pair of assets, consider the asset basket where we invest in 1unit of asset i and θ units of asset j
Choose θ as solution to the problem
minimizeT∑i=1
((pt − E[pt ])i + θ(pt − E[pt ])j)2,
with variable θ ∈ R.
Results in n(n − 1)/2 baskets (for S&P 1500, ≈ 1.1 million baskets).
Shane Barratt, Russell Clarida, Mert Esencan, Francesco Insulla, Cole Kiersznowski, Andrew Perry (Stanford University)Statistical Arbitrage May 5, 2020 5 / 18
Background
Example: Finding Pairs
Consider INTC hedged (1 INTC, -1.006 SPY) and IBM hedged (1IBM, -1.014 SPY), in 2015
Solving problem on previous slide gives θ = 0.846, so final assetbasket is (1 INTC, 0.846 IBM, -1.864 SPY)
0 50 100 150 200 250day in 2015
2
1
0
1
2
bask
et p
rice
(nor
mal
ized)
1 INTC, 0.846 IBM, -1.864 SPY
Shane Barratt, Russell Clarida, Mert Esencan, Francesco Insulla, Cole Kiersznowski, Andrew Perry (Stanford University)Statistical Arbitrage May 5, 2020 6 / 18
Background
What Happened in 2016?
0 50 100 150 200 250day in 2016
1.0
0.5
0.0
0.5
1.0
1.5
2.0ba
sket
pric
e (n
orm
alize
d)1 INTC, 0.846 IBM, -1.864 SPY
Shane Barratt, Russell Clarida, Mert Esencan, Francesco Insulla, Cole Kiersznowski, Andrew Perry (Stanford University)Statistical Arbitrage May 5, 2020 7 / 18
Background
Ornstein–Uhlenbeck Process
We model the residual returns as a mean-reverting processes theOrnstein–Uhlenbeck (OU) process [1]
The OU process is given by
dXt = ρ(µ− Xt)dt + σdBt , ρ, σ > 0 (1)
where ρ is the speed of mean reversion, µ is the long run average, σis the instantaneous volatility, and Bt is a standard Brownian motion
We allow for the assumption that over a short trading period that ρ,µ, and σ stay constant
Shane Barratt, Russell Clarida, Mert Esencan, Francesco Insulla, Cole Kiersznowski, Andrew Perry (Stanford University)Statistical Arbitrage May 5, 2020 8 / 18
Background
AR(1) Process
To determine the constants ρ, µ, and σ in the OU process we use anauto-regressive process with a lag of one (AR(1) process)
An AR(1) process is given by
Xt+1 = λ+ φXt + εt (2)
The interpretation of λ, φ, and ε as it relates to the OU process is
λ = µ(1− e−ρδt)φ = e−ρδt
εt ∼ N(
0, σ2
2ρ (1− e−2ρδt) (3)
We fit an AR(1) to all 1 million baskets and select the ones we aremost confident about by using a Dickey - Fuller test
Shane Barratt, Russell Clarida, Mert Esencan, Francesco Insulla, Cole Kiersznowski, Andrew Perry (Stanford University)Statistical Arbitrage May 5, 2020 9 / 18
Background
Trading Signal
Now that we are able to model stocks as an OU process we need adimensionless trading signal
We will use the distance that Xt is from the mean µ by the long - runstandard deviation σ = σ√
2ρ. Giving us the signal
st =Xt − µσ
(4)
We use the signal as follows: given an st � 0 we short S and buy F ,when st > 0 we exit that position. Conversely, when st � 0 we longS and short F , when st < 0 we exit that position.
Shane Barratt, Russell Clarida, Mert Esencan, Francesco Insulla, Cole Kiersznowski, Andrew Perry (Stanford University)Statistical Arbitrage May 5, 2020 10 / 18
Background
Trading Signal
0 50 100 150 200 250day in 2015
2
1
0
1
2
bask
et p
rice
(nor
mal
ized)
1 INTC, 0.846 IBM, -1.864 SPYsellbuy
Figure: Trading Signal for previous example.
Shane Barratt, Russell Clarida, Mert Esencan, Francesco Insulla, Cole Kiersznowski, Andrew Perry (Stanford University)Statistical Arbitrage May 5, 2020 11 / 18
Data
Data
The data we are using comes from CRSP (Center for Research inSecurity Prices) accessed through WRDS (Wharton Research DataServices)
Universe: We decided to use equities that are present in theS&P 1500 every year from 2003 to 2019
Timescale: Currently we are using daily data to create our statisticalarbitrage models, but we will hopefully extend our model to use 30minute price intervals
Shane Barratt, Russell Clarida, Mert Esencan, Francesco Insulla, Cole Kiersznowski, Andrew Perry (Stanford University)Statistical Arbitrage May 5, 2020 12 / 18
Preliminary Implementation
Preliminary Implementation
We constructed a data pipeline that does the following given a selection ofstocks:
Constructs the optimal basketTests the stationarity of the residuals using the AugmentedDickey-Fuller (ADF) test
(a) Log Price (b) Stationary residuals
Figure: Sample basket constructionShane Barratt, Russell Clarida, Mert Esencan, Francesco Insulla, Cole Kiersznowski, Andrew Perry (Stanford University)Statistical Arbitrage May 5, 2020 13 / 18
Next Steps
Next Steps
Determine best thresholds for the trading signal
Extending our model to work with higher frequency data rather thandaily data
Develop various approaches to construct baskets
We already have a Greedy Bottom-Up ADF-based implementation
Produce more residual returns and develop a robust back testingmethod
Shane Barratt, Russell Clarida, Mert Esencan, Francesco Insulla, Cole Kiersznowski, Andrew Perry (Stanford University)Statistical Arbitrage May 5, 2020 14 / 18
Next Steps
Questions
Shane Barratt, Russell Clarida, Mert Esencan, Francesco Insulla, Cole Kiersznowski, Andrew Perry (Stanford University)Statistical Arbitrage May 5, 2020 15 / 18
Next Steps
Thank You
Shane Barratt, Russell Clarida, Mert Esencan, Francesco Insulla, Cole Kiersznowski, Andrew Perry (Stanford University)Statistical Arbitrage May 5, 2020 16 / 18
Next Steps
References
1 Steven Finch. Ornstein-Uhlenbeck Process by Steven R. Finch. pages1–14, 2004.
2 Marco Avellaneda et al. Statistical Arbitrage in the U.S. EquitiesMarket, 2009
Shane Barratt, Russell Clarida, Mert Esencan, Francesco Insulla, Cole Kiersznowski, Andrew Perry (Stanford University)Statistical Arbitrage May 5, 2020 17 / 18
Next Steps
Appendix A: Portfolio Construction
Let Σ be the estimated covariance of our predictions
Basic: Long k baskets with highest µi/Σii , short k baskets with mostnegative µi/Σii
Sophisticated: Convex Markowitz portfolio optimization
maximize µ>x − γ2x>Σx
subject to 1>x = 1
where x ∈ Rm and risk-aversion γ ∈ R+.
All portfolios are (by definition) market neutral
Shane Barratt, Russell Clarida, Mert Esencan, Francesco Insulla, Cole Kiersznowski, Andrew Perry (Stanford University)Statistical Arbitrage May 5, 2020 18 / 18