Asymmetric Graph Error Control with Low Complexity in Causal Bandits
<|reference_start|>Asymmetric Graph Error Control with Low Complexity in Causal Bandits: In this paper, the causal bandit problem is investigated, in which the objective is to select an optimal sequence of interventions on nodes in a causal graph. It is assumed that the graph is governed by linear structural equations; it is further assumed that both the causal topology and the distribution of interventions are unknown. By exploiting the causal relationships between the nodes whose signals contribute to the reward, interventions are optimized. First, based on the difference between the two types of graph identification errors (false positives and negatives), a causal graph learning method is proposed, which strongly reduces sample complexity relative to the prior art by learning sub-graphs. Under the assumption of Gaussian exogenous inputs and minimum-mean squared error weight estimation, a new uncertainty bound tailored to the causal bandit problem is derived. This uncertainty bound drives an upper confidence bound based intervention selection to optimize the reward. To cope with non-stationary bandits, a sub-graph change detection mechanism is proposed, with high sample efficiency. Numerical results compare the new methodology to existing schemes and show a substantial performance improvement in both stationary and non-stationary settings. Compared to existing approaches, the proposed scheme takes 67% fewer samples to learn the causal structure and achieves an average reward gain of 85%.<|reference_end|>
@article{peng2024asymmetric,
    title={Asymmetric Graph Error Control with Low Complexity in Causal Bandits},
    author={Chen Peng, Di Zhang and Urbashi Mitra},
    journal={arXiv preprint arXiv:2408.11240},
    year={2024},
    archivePrefix={arXiv},
    eprint={2408.11240},
    primaryClass={cs.LG eess.SP}
}