Optimistic Posterior Sampling for Reinforcement Learning: Worst-Case Regret Bounds
提出一种基于后验采样的算法，在通信马尔可夫决策过程中实现了接近最优的最坏情况遗憾上界，与已知下界紧密匹配。
We present an algorithm based on posterior sampling (aka Thompson sampling) that achieves near-optimal worst-case regret bounds when the underlying Markov decision process (MDP) is communicating with a finite, although unknown, diameter. Our main result is a high probability regret upper bound of [Formula: see text] for any communicating MDP with S states, A actions, and diameter D. Here, regret compares the total reward achieved by the algorithm to the total expected reward of an optimal infinite-horizon undiscounted average reward policy in time horizon T. This result closely matches the known lower bound of [Formula: see text]. Our techniques involve proving some novel results about the anti-concentration of Dirichlet distribution, which may be of independent interest. Funding: This work was supported in part by an NSF CAREER award [CMMI 1846792] awarded to author S. Agrawal.