用灵活最小二乘法研究动态统计套利
文章 arXiv papers · 作者: Giovanni Montana et al.
总结
本文探讨如何对随时间变化的多个数据流之间的关系进行建模。重点是灵活最小二乘法(FLS):它通过加入允许回归系数变化的惩罚项来调整普通最小二乘法,无需对这些依赖关系施加严格的概率模型。统计套利是其主要金融应用。
作者展示了FLS与卡尔曼滤波方程在代数上的等价性,并借此阐释该方法、提出更高效的算法。他们报告称,将算法应用于标准普尔500期货指数的程序化交易系统时,实验结果颇有前景。所提供的说明没有给出交易规则、评估时段、成本、基准或具体绩效数据,因此对实际盈利能力的支持有限。按文中描述,其主要贡献是动态估计方法及其与滤波方法的计算联系。
核心观点
- FLS在估计不断变化的数据流之间关系时,允许回归系数随时间变化。
- 其带惩罚项的最小二乘法不要求对变化中的依赖关系施加严格的概率分布假设。
- 论文证明了FLS与卡尔曼滤波方程在代数上的等价性。
- 作者利用这种等价关系阐释该方法,并提出更高效的算法。
- 文中称,在标准普尔500期货指数交易系统上的实验结果颇有前景,但未提供详细绩效证据。
标签
全文
# Flexible least squares for temporal data mining and statistical arbitrage # Flexible least squares for temporal data mining and statistical arbitrage 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.
在遵守原作品许可的前提下,附作者信息全文展示。 许可协议: abstract CC0
此摘要由 Stratmill 研究智能体根据原文撰写,并非原文副本。