On a Data-Driven Optimization Approach to the PID-Based Algorithmic Trading
Bibliographic record
Abstract
This paper proposes an optimal trading algorithm based on a novel application of conventional control engineering (CE). We consider a fundamental CE concept, namely, the feedback control, and apply it to algorithmic trading (AT). The concrete feedback control strategy is designed in a form of the celebrated proportional–integral–derivative (PID) model. The highly fluctuating nature of the modern financial markets has led to the adoption of a model-free realization of the generic PID framework. The control theoretical methodology we propose is combined with the advanced statistics for the historical market data. We obtain a specific log-normal probability distribution function (pdf) associated with the specific quantities associated with the available stock data. The empirical log-normal pdf mentioned above enables the necessary PID gains optimization. For this aim, we apply the data-driven optimization approaches and consider the corresponding Monte Carlo solution procedure. The optimized PID trading algorithm we propose is also studied in the Fourier analysis framework. This equivalent frequency domain representation involves a new concept in financial engineering, namely, the “stock market energy” concept. For the evaluation, we implement the proposed PID optimal trading algorithm and develop a Python-based prototype software. We finally apply the corresponding prototype software to a data set from the Binance BTC/USDT (Bitcoin/Tether) stock market. The experimental result illustrates the implementability of the proposed optimal PID trading scheme and also shows the effectiveness of the proposed CE methods in the modern AT.
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.001 | 0.003 |
| Meta-epidemiology (narrow) | 0.001 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.000 | 0.000 |
| Science and technology studies | 0.000 | 0.001 |
| Scholarly communication | 0.001 | 0.001 |
| Open science | 0.001 | 0.001 |
| Research integrity | 0.001 | 0.001 |
| Insufficient payload (model declined to judge) | 0.002 | 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".