A Novel Algorithmic Trading Strategy using Hidden Markov Model for Kalman Filtering Innovations
Why this work is in the frame
A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.
Bibliographic record
Abstract
The development of algorithmic trading has been one of the most prominent trends in finance and its applications. Hidden Markov Models (HMMs) help enhance the predictive power of statistical models and improve trading strategies for data scientists and algorithmic traders. In recent years there has been growing interest in investigating the pairs trading and multiple trading based on robust Kalman filtering (KF) using data-driven innovation volatility forecasts (DDIVF). KF algorithms were successfully applied in pairs trading with two cointegrated assets using DDIVF as a method for forecasting non-normal innovation volatility. In this paper a novel combined pairwise trading strategy is proposed by combining HMM and DDIVF to further optimize trading signals in different market regimes. The results of the numerical experiments on two cointegrated stocks show that the proposed profitable trading strategy using DDIVF-HMM outperforms the recently studied robust trading strategy using DDIVF alone.
Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.
Full frame distilled prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.
Codex and Gemma teacher scores by category
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.004 | 0.006 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.000 | 0.000 |
| Bibliometrics | 0.000 | 0.002 |
| Science and technology studies | 0.000 | 0.000 |
| Scholarly communication | 0.000 | 0.000 |
| Open science | 0.001 | 0.000 |
| Research integrity | 0.000 | 0.000 |
| Insufficient payload (model declined to judge) | 0.000 | 0.000 |
Machine scores (provisional)
The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.
Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it