39 citations · 141 across the 41 of their papers we have counts for
Showing 2020 · cs.LGShow all
3 papers · 2 filters
cs.LG2020★ 11 cited
Restless-UCB, an Efficient and Low-complexity Algorithm for Online Restless Bandits
Siwei Wang, Longbo Huang, John C. S. Lui
We study the online restless bandit problem, where the state of each arm evolves according to a Markov chain, and the reward of pulling an arm depends on both the pulled arm and th…
cs.LG2020
Online Competitive Influence Maximization
Jinhang Zuo, Xutong Liu, Carlee Joe-Wong +2
Online influence maximization has attracted much attention as a way to maximize influence spread through a social network while learning the values of unknown network parameters. M…
cs.LG2020
Combining Offline Causal Inference and Online Bandit Learning for Data Driven Decision
Li Ye, Yishi Lin, Hong Xie +1
A fundamental question for companies with large amount of logged data is: How to use such logged data together with incoming streaming data to make good decisions? Many companies c…