Non-Asymptotic Best Policy Identification Guarantees in Online Reinforcement Learning
This work provides the first non-asymptotic sample complexity guarantees for NaS, showing that its sample complexity depends not only on the characteristic time, but also on the connectivity of the underlying MDP, the curvature of the optimal characteristic time, and other instance-dependent quantities.