11 citations · 14 across the 4 of their papers we have counts for
4 papers
Is Thompson Sampling Susceptible to Algorithmic Collusion?
Yi Xiong, Ningyuan Chen, Xuefeng Gao
When two players are engaged in a repeated game with unknown payoff matrices, they may use single-agent multi-armed bandit algorithms to choose the actions independent of each othe…
Debiasing Samples from Online Learning Using Bootstrap
Ningyuan Chen, Xuefeng Gao, Yi Xiong
It has been recently shown in the literature that the sample averages from online learning experiments are biased when used to estimate the mean reward. To correct the bias, off-po…
Sublinear Regret for Learning POMDPs
Yi Xiong, Ningyuan Chen, Xuefeng Gao +1
We study the model-based undiscounted reinforcement learning for partially observable Markov decision processes (POMDPs). The oracle we consider is the optimal policy of the POMDP…
Regime Switching Bandits
Xiang Zhou, Yi Xiong, Ningyuan Chen +1
We study a multi-armed bandit problem where the rewards exhibit regime switching. Specifically, the distributions of the random rewards generated from all arms are modulated by a c…