Google Research; Department of Computer Science, University of Illinois Urbana-Champaign; Microsoft Research; Microsoft
Jinglin Chen, Aditya Modi, Akshay Krishnamurthy, Nan Jiang, Alekh Agarwal
Reinforcement learning;reward-free exploration;sample complexity analysis;general non-linear function approximation
On the Statistical Efficiency of Reward-Free Exploration in Non-Linear RL