Graph Agnostic Causal Bayesian Optimisation

• URL: http://arxiv.org/abs/2411.03028v1
• Date: Tue, 05 Nov 2024 11:49:33 GMT
• Title: Graph Agnostic Causal Bayesian Optimisation
• Authors: Sumantrak Mukherjee, Mengyan Zhang, Seth Flaxman, Sebastian Josef Vollmer,
• Abstract summary: 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.
• Score: 2.624902795082451
• License:
• Abstract: 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. The problem of optimising the target variable associated with a causal graph is formalised as Causal Bayesian Optimisation (CBO). We study the CBO problem under the cumulative regret objective with unknown causal graphs for two settings, namely structural causal models with hard interventions and function networks with soft interventions. We propose Graph Agnostic Causal Bayesian Optimisation (GACBO), an algorithm that actively discovers the causal structure that contributes to achieving optimal rewards. GACBO seeks to balance exploiting the actions that give the best rewards against exploring the causal structures and functions. To the best of our knowledge, our work is the first to study causal Bayesian optimization with cumulative regret objectives in scenarios where the graph is unknown or partially known. We show our proposed algorithm outperforms baselines in simulated experiments and real-world applications.

Related papers

• Decision-focused Graph Neural Networks for Combinatorial Optimization [62.34623670845006]
  An emerging strategy to tackle optimization problems involves the adoption of graph neural networks (GNNs) as an alternative to traditional algorithms. Despite the growing popularity of GNNs and traditional algorithm solvers in the realm of CO, there is limited research on their integrated use and the correlation between them within an end-to-end framework. We introduce a decision-focused framework that utilizes GNNs to address CO problems with auxiliary support.
  arXiv  Detail & Related papers  (2024-06-05T22:52:27Z)
• Optimal Observation-Intervention Trade-Off in Optimisation Problems with Causal Structure [1.724169474984623]
  We show that observation-intervention trade-off can be formulated as a non-myopic optimal stopping problem. We show that our formulation can enhance existing algorithms on real and synthetic benchmarks.
  arXiv  Detail & Related papers  (2023-09-05T14:46:06Z)
• 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)
• 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)
• Graph Signal Sampling for Inductive One-Bit Matrix Completion: a Closed-form Solution [112.3443939502313]
  We propose a unified graph signal sampling framework which enjoys the benefits of graph signal analysis and processing. The key idea is to transform each user's ratings on the items to a function (signal) on the vertices of an item-item graph. For the online setting, we develop a Bayesian extension, i.e., BGS-IMC which considers continuous random Gaussian noise in the graph Fourier domain.
  arXiv  Detail & Related papers  (2023-02-08T08:17:43Z)
• 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)
• Causal Entropy Optimization [12.708838587765307]
  We propose a framework that generalizes Causal Bayesian Optimization (CBO) to account for all sources of uncertainty. CEO incorporates the causal structure uncertainty both in the surrogate models for the causal effects and in the mechanism used to select interventions. CEO achieves faster convergence to the global optimum compared with CBO while also learning the graph.
  arXiv  Detail & Related papers  (2022-08-23T13:58:09Z)
• Optimal Propagation for Graph Neural Networks [51.08426265813481]
  We propose a bi-level optimization approach for learning the optimal graph structure. We also explore a low-rank approximation model for further reducing the time complexity.
  arXiv  Detail & Related papers  (2022-05-06T03:37:00Z)
• Multi-task Learning of Order-Consistent Causal Graphs [59.9575145128345]
  We consider the problem of discovering $K related Gaussian acyclic graphs (DAGs) Under multi-task learning setting, we propose a $l_1/l$-regularized maximum likelihood estimator (MLE) for learning $K$ linear structural equation models. We theoretically show that the joint estimator, by leveraging data across related tasks, can achieve a better sample complexity for recovering the causal order.
  arXiv  Detail & Related papers  (2021-11-03T22:10:18Z)
• 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.