Chronological Causal Bandits
Not on the map. Why?
Abstract (arXiv)
This paper studies an instance of the multi-armed bandit (MAB) problem, specifically where several causal MABs operate chronologically in the same dynamical system. Practically the reward distribution of each bandit is governed by the same non-trivial dependence structure, which is a dynamic causal model. Dynamic because we allow for each causal MAB to depend on the preceding MAB and in doing so are able to transfer information between agents. Our contribution, the Chronological Causal Bandit (CCB), is useful in discrete decision-making settings where the causal effects are changing across time and can be informed by earlier interventions in the same system. In this paper, we present some early findings of the CCB as demonstrated on a toy problem.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 5 of its 25 references that are in the map. First posted on arXiv 3 Dec 2021.
Builds on
5 of 25 references.
References · 5
- 2021Next Generation Reservoir Computingcited by 160
- 2016Causal Bandits: Learning Good Interventions via Causal Inferencecited by 101
- 2020Causal Bayesian Optimizationcited by 39
- 2013Sequential Transfer in Multi-armed Bandit with Finite Set of Modelscited by 38
- 2021Dynamic Causal Bayesian Optimizationcited by 17
Built on by
Not cited yet.