Linear Causal Bandits: Unknown Graph and Soft Interventions

Designing causal bandit algorithms depends on two central categories of assumptions: (i) the extent of information about the underlying causal graphs and (ii) the extent of information about interventional statistical models. There have been extensive recent advances in dispensing with assumptions on either category. These include assuming known graphs but unknown interventional distributions, and the converse setting of assuming unknown graphs but access to restrictive hard/operatornamedo interventions, which removes the stochasticity and ancestral dependencies. Nevertheless, the problem in its general form, i.e., unknown graph and unknown stochastic intervention models, remains open. This paper addresses this problem and establishes that in a graph with N nodes, maximum in-degree d and maximum causal path length L, after T interaction rounds the regret upper bound scales as tildeO((cd)^L-frac12√T + d + RN) where c>1 is a constant and R is a measure of intervention power. A universal minimax lower bound is also established, which scales as Omega(d^L-frac32√T). Importantly, the graph size N has a diminishing effect on the regret as T grows. These bounds have matching behavior in T, exponential dependence on L, and polynomial dependence on d (with the gap d ). On the algorithmic aspect, the paper presents a novel way of designing a computationally efficient CB algorithm, addressing a challenge that the existing CB algorithms using soft interventions face.