Algorithm-Based Low-Frequency Trading Using a Stochastic Oscillator, Williams%R, and Trading Volume for the S&P 500
Bibliographic record
Abstract
Recent research in algorithmic trading has primarily focused on ultra-high-frequency strategies and index estimation. In response to the need for a low-frequency, real-world trading model, we developed an enhanced algorithm that builds on existing models with high hit ratios and low maximum drawdowns. We utilized established price indicators, including the stochastic oscillator and Williams %R, while introducing a volume factor to improve the model’s robustness and performance. The refined algorithm achieved superior returns while maintaining its high hit ratio and low maximum drawdown. Specifically, we leveraged 2X and 3X signals, incorporating volume data, the 52-week average, standard deviation, and other variables. The dataset comprised SPY ETF price and volume data spanning from 2010 to 2023, over 13 years. Our enhanced algorithmic model outperformed both the benchmark and previous iterations, achieving a hit rate of over 90%, a maximum drawdown of less than 1%, an average of 1.5 trades per year, a total return of 519.3%, and an annualized return (AnnR) of 15.1%. This analysis demonstrates that the model’s simplicity, ease of use, and interpretability provide valuable tools for investors, although it is important to note that past performance does not guarantee future returns.
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.
How this classification was reachedexpand
Full frame machine prediction
Teacher imitationNot calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.002 | 0.011 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.001 | 0.001 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.002 | 0.002 |
| Open science | 0.002 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.001 | 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 itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".