Abstract
Starting from a sample path of a multivariate stochastic process, we study several techniques to isolate linear combinations of the variables with a maximal amount of mean reversion, while constraining the variance of the combination to be larger than a given threshold. We show that many of the optimization problems arising in this context can be solved exactly using semidefinite programming and a variant of the S-lemma. In finance, these methods can be used to isolate statistical arbitrage opportunities, i.e. mean reverting baskets with enough variance to overcome market friction. In a more general setting, mean reversion and its generalizations can also be used as a proxy for stationarity, while variance simply measures signal strength.
| Original language | English |
|---|---|
| Pages | 1308-1316 |
| Number of pages | 9 |
| Publication status | Published - 1 Jan 2013 |
| Externally published | Yes |
| Event | 30th International Conference on Machine Learning, ICML 2013 - Atlanta, GA, United States Duration: 16 Jun 2013 → 21 Jun 2013 |
Conference
| Conference | 30th International Conference on Machine Learning, ICML 2013 |
|---|---|
| Country/Territory | United States |
| City | Atlanta, GA |
| Period | 16/06/13 → 21/06/13 |
Fingerprint
Dive into the research topics of 'Mean reversion with a variance threshold'. Together they form a unique fingerprint.Cite this
- APA
- Author
- BIBTEX
- Harvard
- Standard
- RIS
- Vancouver