When is Agnostic Reinforcement Learning Statistically Tractable?

Zeyu Jia, Gene Li, Alexander Rakhlin +2

We study the problem of agnostic PAC reinforcement learning (RL): given a policy class $\Pi$, how many rounds of interaction with an unknown MDP (with a potentially large state and a…