Causal Bandits with Unknown Graph Structure

by   Yangyi Lu, et al.

In causal bandit problems, the action set consists of interventions on variables of a causal graph. Several researchers have recently studied such bandit problems and pointed out their practical applications. However, all existing works rely on a restrictive and impractical assumption that the learner is given full knowledge of the causal graph structure upfront. In this paper, we develop novel causal bandit algorithms without knowing the causal graph. Our algorithms work well for causal trees, causal forests and a general class of causal graphs. The regret guarantees of our algorithms greatly improve upon those of standard multi-armed bandit (MAB) algorithms under mild conditions. Lastly, we prove our mild conditions are necessary: without them one cannot do better than standard MAB bandit algorithms.


page 1

page 2

page 3

page 4


Causal Bandits with Propagating Inference

Bandit is a framework for designing sequential experiments. In each expe...

Chronological Causal Bandits

This paper studies an instance of the multi-armed bandit (MAB) problem, ...

Causal Discovery for Causal Bandits utilizing Separating Sets

The Causal Bandit is a variant of the classic Bandit problem where an ag...

Adaptively Exploiting d-Separators with Causal Bandits

Multi-armed bandit problems provide a framework to identify the optimal ...

Causal Bandits for Linear Structural Equation Models

This paper studies the problem of designing an optimal sequence of inter...

Hierarchical Causal Bandit

Causal bandit is a nascent learning model where an agent sequentially ex...

Pure Exploration of Causal Bandits

Causal bandit problem integrates causal inference with multi-armed bandi...