Contextual Causal Bayesian Optimisation

Abstract

We introduce a unified framework for contextual and causal Bayesian optimisation, which aims to design intervention policies maximising the expectation of a target variable. Our approach leverages both observed contextual information and known causal graph structures to guide the search. Within this framework, we propose a novel algorithm that jointly optimises over policies and the sets of variables on which these policies are defined. This thereby extends and unifies two previously distinct approaches: Causal Bayesian Optimisation and Contextual Bayesian Optimisation, while also addressing their limitations in scenarios that yield suboptimal results. We derive worst-case and instance-dependent high-probability regret bounds for our algorithm. We report experimental results across diverse environments, corroborating that our approach achieves sublinear regret and reduces sample complexity in high-dimensional settings.

Cite

Text

Arsenyan et al. "Contextual Causal Bayesian Optimisation." International Conference on Learning Representations, 2026.

Markdown

[Arsenyan et al. "Contextual Causal Bayesian Optimisation." International Conference on Learning Representations, 2026.](https://mlanthology.org/iclr/2026/arsenyan2026iclr-contextual/)

BibTeX

@inproceedings{arsenyan2026iclr-contextual,
  title     = {{Contextual Causal Bayesian Optimisation}},
  author    = {Arsenyan, Vahan and Grosnit, Antoine and Ammar, Haitham Bou and Dalalyan, Arnak S.},
  booktitle = {International Conference on Learning Representations},
  year      = {2026},
  url       = {https://mlanthology.org/iclr/2026/arsenyan2026iclr-contextual/}
}