mlsanityData to 7 Oct 2026

Reinforcement Learning for Combining Search Methods in the Calibration of Economic ABMs

arXiv 2302.11835 ↗First posted 23 Feb 2023cs.LG cs.AI cs.MAcited by 5

Not on the map. Why?

Abstract (arXiv)

Calibrating agent-based models (ABMs) in economics and finance typically involves a derivative-free search in a very large parameter space. In this work, we benchmark a number of search methods in the calibration of a well-known macroeconomic ABM on real data, and further assess the performance of "mixed strategies" made by combining different methods. We find that methods based on random-forest surrogates are particularly efficient, and that combining search methods generally increases performance since the biases of any single method are mitigated. Moving from these observations, we propose a reinforcement learning (RL) scheme to automatically select and combine search methods on-the-fly during a calibration run. The RL agent keeps exploiting a specific method only as long as this keeps performing well, but explores new strategies when the specific method reaches a performance plateau. The resulting RL search scheme outperforms any other method or method combination tested, and does not rely on any prior information or trial and error procedure.

Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 8 of its 72 references that are in the map. First posted on arXiv 23 Feb 2023.

Builds on

8 of 72 references.

References · 8

  1. 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,120
  2. 2017Taming Non-stationary Bandits: A Bayesian Approachcited by 30
  3. 2022On learning agent-based models from datacited by 14
  4. 2022Black-box Bayesian inference for economic agent-based modelscited by 13
  5. 2021Towards a fully RL-based Market Simulatorcited by 10
  6. 2022Towards Multi-Agent Reinforcement Learning driven Over-The-Counter Market Simulationscited by 10
  7. 2022Phantom -- A RL-driven multi-agent framework to model complex systemscited by 5
  8. 2016Blackbox: A procedure for parallel optimization of expensive black-box functionscited by 4

Built on by

Cited by year

Citing papers per year: 2024: 2; 2025: 3.

5 papers.