Nonstationary Continuum-Armed Bandit Strategies for Automated Trading in a Simulated Financial Market
Not on the map. Why?
Abstract (arXiv)
We approach the problem of designing an automated trading strategy that can consistently profit by adapting to changing market conditions. This challenge can be framed as a Nonstationary Continuum-Armed Bandit (NCAB) problem. To solve the NCAB problem, we propose PRBO, a novel trading algorithm that uses Bayesian optimization and a ``bandit-over-bandit'' framework to dynamically adjust strategy parameters in response to market conditions. We use Bristol Stock Exchange (BSE) to simulate financial markets containing heterogeneous populations of automated trading agents and compare PRBO with PRSH, a reference trading strategy that adapts strategy parameters through stochastic hill-climbing. Results show that PRBO generates significantly more profit than PRSH, despite having fewer hyperparameters to tune. The code for PRBO and performing experiments is available online open-source (https://github.com/HarmoniaLeo/PRZI-Bayesian-Optimisation).
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 5 of its 36 references that are in the map. First posted on arXiv 4 Aug 2022.
Builds on
5 of 36 references.
References · 5
- 2019Introduction to Multi-Armed Banditscited by 481
- 2017A Tutorial on Thompson Samplingcited by 433
- 2018BSE: A Minimal Simulation of a Limit-Order-Book Stock Exchangecited by 2
- 2020Finite Continuum-Armed Banditscited by 1
- 2021Parameterised-Response Zero-Intelligence Traderscited by 1
Built on by
Not cited yet.