Regret Analysis of Bandit Problems with Causal Background Knowledge
Regret Analysis of Bandit Problems with Causal Background Knowledge
复制标题
带有因果背景知识的土匪问题的遗憾分析
DOI:
--
复制
发表时间:
2019
期刊:
影响因子:
--
通讯作者:
Zhenyu Yan
中科院分区:
文献类型:
--
作者:
Yangyi Lu;A. Meisami;Ambuj Tewari;Zhenyu Yan
We study how to learn optimal interventions sequentially given causal information represented as a causal graph along with associated conditional distributions. Causal modeling is useful in real world problems like online advertisement where complex causal mechanisms underlie the relationship between interventions and outcomes. We propose two algorithms, causal upper confidence bound (C-UCB) and causal Thompson Sampling (C-TS), that enjoy improved cumulative regret bounds compared with algorithms that do not use causal information. We thus resolve an open problem posed by cite{lattimore2016causal}. Further, we extend C-UCB and C-TS to the linear bandit setting and propose causal linear UCB (CL-UCB) and causal linear TS (CL-TS) algorithms. These algorithms enjoy a cumulative regret bound that only scales with the feature dimension. Our experiments show the benefit of using causal information. For example, we observe that even with a few hundreds of iterations, the regret of causal algorithms is less than that of standard algorithms by a factor of three. We also show that under certain causal structures, our algorithms scale better than the standard bandit algorithms as the number of interventions increases.
DOI:
--
发表时间:
2018
期刊:
Advances in Neural Information Processing Systems 31
影响因子:
--
作者:
Lee, Sanghack;Bareinboim, Elias
通讯作者:
Bareinboim, Elias