Flexible least squares for temporal data mining and statistical arbitrage
arXiv:0709.3884 · doi:10.1016/j.eswa.2008.01.062
Abstract
A number of recent emerging applications call for studying data streams, potentially infinite flows of information updated in real-time. When multiple co-evolving data streams are observed, an important task is to determine how these streams depend on each other, accounting for dynamic dependence patterns without imposing any restrictive probabilistic law governing this dependence. In this paper we argue that flexible least squares (FLS), a penalized version of ordinary least squares that accommodates for time-varying regression coefficients, can be deployed successfully in this context. Our motivating application is statistical arbitrage, an investment strategy that exploits patterns detected in financial data streams. We demonstrate that FLS is algebraically equivalent to the well-known Kalman filter equations, and take advantage of this equivalence to gain a better understanding of FLS and suggest a more efficient algorithm. Promising experimental results obtained from a FLS-based algorithmic trading system for the S&P 500 Futures Index are reported.
28 pages, 6 figures, submitted to journal
Cited by in corpus (5)
- Real-time covariance estimation for the local level model
- A Variational Bayesian State-Space Approach to Online Passive-Aggressive Regression
- Robust and Adaptive Algorithms for Online Portfolio Selection
- Dynamic modeling of mean-reverting spreads for statistical arbitrage
- Statistical Arbitrage and Optimal Trading with Transaction Costs in Futures Markets