Causal Bayesian Optimization with Unknown Graphs

• URL: http://arxiv.org/abs/2503.19554v1
• Date: Tue, 25 Mar 2025 11:14:37 GMT
• Title: Causal Bayesian Optimization with Unknown Graphs
• Authors: Jean Durand, Yashas Annadani, Stefan Bauer, Sonali Parbhoo,
• Abstract summary: Causal Bayesian Optimization (CBO) is a methodology designed to optimize an outcome variable by leveraging known causal relationships through targeted interventions.<n>Traditional CBO methods require a fully and accurately specified causal graph, which is a limitation in many real-world scenarios where such graphs are unknown.<n>We propose a new method for the CBO framework that operates without prior knowledge of the causal graph.
• Score: 17.871251114630827
• License: http://creativecommons.org/licenses/by-sa/4.0/
• Abstract: Causal Bayesian Optimization (CBO) is a methodology designed to optimize an outcome variable by leveraging known causal relationships through targeted interventions. Traditional CBO methods require a fully and accurately specified causal graph, which is a limitation in many real-world scenarios where such graphs are unknown. To address this, we propose a new method for the CBO framework that operates without prior knowledge of the causal graph. Consistent with causal bandit theory, we demonstrate through theoretical analysis and that focusing on the direct causal parents of the target variable is sufficient for optimization, and provide empirical validation in the context of CBO. Furthermore we introduce a new method that learns a Bayesian posterior over the direct parents of the target variable. This allows us to optimize the outcome variable while simultaneously learning the causal structure. Our contributions include a derivation of the closed-form posterior distribution for the linear case. In the nonlinear case where the posterior is not tractable, we present a Gaussian Process (GP) approximation that still enables CBO by inferring the parents of the outcome variable. The proposed method performs competitively with existing benchmarks and scales well to larger graphs, making it a practical tool for real-world applications where causal information is incomplete.

Related papers

• Graph Agnostic Causal Bayesian Optimisation [2.624902795082451]
  We study the problem of globally optimising a target variable of an unknown causal graph on which a sequence of soft or hard interventions can be performed. We propose Graph Agnostic Causal Bayesian optimisation (GACBO), an algorithm that actively discovers the causal structure that contributes to achieving optimal rewards. We show our proposed algorithm outperforms baselines in simulated experiments and real-world applications.
  arXiv  Detail & Related papers  (2024-11-05T11:49:33Z)
• AcceleratedLiNGAM: Learning Causal DAGs at the speed of GPUs [57.12929098407975]
  We show that by efficiently parallelizing existing causal discovery methods, we can scale them to thousands of dimensions. Specifically, we focus on the causal ordering subprocedure in DirectLiNGAM and implement GPU kernels to accelerate it. This allows us to apply DirectLiNGAM to causal inference on large-scale gene expression data with genetic interventions yielding competitive results.
  arXiv  Detail & Related papers  (2024-03-06T15:06:11Z)
• Causal Bayesian Optimization via Exogenous Distribution Learning [15.8362578568708]
  Existing Causal Bayesian Optimization(CBO) methods rely on hard interventions that alter the causal structure to maximize the reward.<n>We develop a new CBO method by leveraging the learned endogenous distribution.<n>Experiments on different datasets and applications show the benefits of our proposed method.
  arXiv  Detail & Related papers  (2024-02-03T22:14:54Z)
• Exploiting Causal Graph Priors with Posterior Sampling for Reinforcement Learning [86.22660674919746]
  Posterior sampling allows exploitation of prior knowledge on the environment's transition dynamics. We propose a novel posterior sampling approach in which the prior is given as a causal graph over the environment's variables.
  arXiv  Detail & Related papers  (2023-10-11T14:16:04Z)
• Model-based Causal Bayesian Optimization [74.78486244786083]
  We introduce the first algorithm for Causal Bayesian Optimization with Multiplicative Weights (CBO-MW) We derive regret bounds for CBO-MW that naturally depend on graph-related quantities. Our experiments include a realistic demonstration of how CBO-MW can be used to learn users' demand patterns in a shared mobility system.
  arXiv  Detail & Related papers  (2023-07-31T13:02:36Z)
• Provably Efficient Bayesian Optimization with Unknown Gaussian Process Hyperparameter Estimation [44.53678257757108]
  We propose a new BO method that can sub-linearly converge to the objective function's global optimum. Our method uses a multi-armed bandit technique (EXP3) to add random data points to the BO process. We demonstrate empirically that our method outperforms existing approaches on various synthetic and real-world problems.
  arXiv  Detail & Related papers  (2023-06-12T03:35:45Z)
• Constrained Causal Bayesian Optimization [9.409281517596396]
  cCBO first reduces the search space by exploiting the graph structure and, if available, an observational dataset. We evaluate cCBO on artificial and real-world causal graphs showing successful trade off between fast convergence and percentage of feasible interventions.
  arXiv  Detail & Related papers  (2023-05-31T16:34:58Z)
• Model-based Causal Bayesian Optimization [78.120734120667]
  We propose model-based causal Bayesian optimization (MCBO) MCBO learns a full system model instead of only modeling intervention-reward pairs. Unlike in standard Bayesian optimization, our acquisition function cannot be evaluated in closed form.
  arXiv  Detail & Related papers  (2022-11-18T14:28:21Z)
• BCD Nets: Scalable Variational Approaches for Bayesian Causal Discovery [97.79015388276483]
  A structural equation model (SEM) is an effective framework to reason over causal relationships represented via a directed acyclic graph (DAG) Recent advances enabled effective maximum-likelihood point estimation of DAGs from observational data. We propose BCD Nets, a variational framework for estimating a distribution over DAGs characterizing a linear-Gaussian SEM.
  arXiv  Detail & Related papers  (2021-12-06T03:35:21Z)
• Variational Causal Networks: Approximate Bayesian Inference over Causal Structures [132.74509389517203]
  We introduce a parametric variational family modelled by an autoregressive distribution over the space of discrete DAGs. In experiments, we demonstrate that the proposed variational posterior is able to provide a good approximation of the true posterior.
  arXiv  Detail & Related papers  (2021-06-14T17:52:49Z)
• Causal Bayesian Optimization [8.958125394444679]
  We study the problem of globally optimizing a variable of interest that is part of a causal model in which a sequence of interventions can be performed. Our approach combines ideas from causal inference, uncertainty quantification and sequential decision making. We show how knowing the causal graph significantly improves the ability to reason about optimal decision making strategies.
  arXiv  Detail & Related papers  (2020-05-24T13:20:50Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.