Provably adaptive reinforcement learning in metric spaces

NeurIPS 2020

Provably adaptive reinforcement learning in metric spaces

Dec 06, 2020
|
36 views
|
Details
We study reinforcement learning in continuous state and action spaces endowed with a metric. We provide a refined analysis of the algorithm of Sinclair, Banerjee, and Yu (2019) and show that its regret scales with the \emph{zooming dimension} of the instance. This parameter, which originates in the bandit literature, captures the size of the subsets of near optimal actions and is always smaller than the covering dimension used in previous analyses. As such, our results are the first provably adaptive guarantees for reinforcement learning in metric spaces. Speakers: Tongyi Cao, Akshay Krishnamurthy

Comments
loading...