Timezone: »

 
Poster
A Finite-Time Analysis of Q-Learning with Neural Network Function Approximation
Pan Xu · Quanquan Gu

Wed Jul 15 11:00 AM -- 11:45 AM & Wed Jul 15 10:00 PM -- 10:45 PM (PDT) @
in Poster Session 25 »
Q-learning with neural network function approximation (neural Q-learning for short) is among the most prevalent deep reinforcement learning algorithms. Despite its empirical success, the non-asymptotic convergence rate of neural Q-learning remains virtually unknown. In this paper, we present a finite-time analysis of a neural Q-learning algorithm, where the data are generated from a Markov decision process, and the action-value function is approximated by a deep ReLU neural network. We prove that neural Q-learning finds the optimal policy with $O(1/\sqrt{T})$ convergence rate if the neural function approximator is sufficiently overparameterized, where $T$ is the number of iterations. To our best knowledge, our result is the first finite-time analysis of neural Q-learning under non-i.i.d. data assumption.
Keywords: Reinforcement Learning · Online Learning / Bandits · Reinforcement Learning - General

Author Information

Pan Xu (University of California, Los Angeles)
Quanquan Gu (University of California, Los Angeles)

More from the Same Authors