Towards Inverse Reinforcement Learning for Limit Order Book Dynamics
On the map: Offline RL and imitation learning from data → Inverse reinforcement learning
Abstract (arXiv)
Multi-agent learning is a promising method to simulate aggregate competitive behaviour in finance. Learning expert agents' reward functions through their external demonstrations is hence particularly relevant for subsequent design of realistic agent-based simulations. Inverse Reinforcement Learning (IRL) aims at acquiring such reward functions through inference, allowing to generalize the resulting policy to states not observed in the past. This paper investigates whether IRL can infer such rewards from agents within real financial stochastic environments: limit order books (LOB). We introduce a simple one-level LOB, where the interactions of a number of stochastic agents and an expert trading agent are modelled as a Markov decision process. We consider two cases for the expert's reward: either a simple linear function of state features; or a complex, more realistic non-linear function. Given the expert agent's demonstrations, we attempt to discover their strategy by modelling their latent reward function using linear and Gaussian process (GP) regressors from previous literature, and our own approach through Bayesian neural networks (BNN). While the three methods can learn the linear case, only the GP-based and our proposed BNN methods are able to discover the non-linear reward case. Our BNN IRL algorithm outperforms the other two approaches as the number of samples increases. These results illustrate that complex behaviours, induced by non-linear reward functions amid agent-based stochastic scenarios, can be deduced through inference, encouraging the use of inverse reinforcement learning for opponent-modelling in multi-agent systems.
Key facts. Cited by 2 papers in the map (data through 7 Oct 2026). Placed in Inverse reinforcement learning, one of 13 directions in Offline RL and imitation learning from data. Builds on 8 of its 36 references that are in the map. First posted on arXiv 11 Jun 2019.
Builds on
8 of 36 references.
References · 8
- 2015Dropout as a Bayesian Approximation: Representing Model Uncertainty in Deep Learningcited by 4,416
- 2017Reinforcement Learning with Deep Energy-Based Policiescited by 659
- 2017Learning Robust Rewards with Adversarial Inverse Reinforcement Learningcited by 485
- 2015Maximum Entropy Deep Inverse Reinforcement Learningcited by 173
- 2019Open-ended Learning in Symmetric Zero-sum Gamescited by 96
- 2017Learning Deep Mean Field Games for Modeling Large Population Behaviorcited by 8
- 2015Inverse Reinforcement Learning via Deep Gaussian Processcited by 6
- 2017Inferring agent objectives at different scales of a complex adaptive systemcited by 1
Built on by
Citing papers per year: 2024: 1; 2025: 0; 2026: 1.
2 papers.
Similar, not cited
Close in wording, no citation either way
- 2019Adversarial recovery of agent rewards from latent spaces of the limit order book
- 2024Robot See, Robot Do: Imitation Reward for Noisy Financial Environments
- 2022Combining Reinforcement Learning and Inverse Reinforcement Learning for Asset Allocation Recommendations
- 2025Inverse Reinforcement Learning using Revealed Preferences and Passive Stochastic Optimization
- 2018Competitive Multi-agent Inverse Reinforcement Learning with Sub-optimal Demonstrations
- 2026Nonparametric Bayesian Inverse Reinforcement Learning with Data-Parallel Gibbs Sampling
- 2024Bayesian Inverse Reinforcement Learning for Non-Markovian Rewards
- 2026Model-Free Inference of Investor Preferences: A Relative Entropy IRL Approach