English

Is Q-Learning Provably Efficient? An Extended Analysis

Machine Learning 2020-09-23 v1 Artificial Intelligence Optimization and Control Machine Learning

Abstract

This work extends the analysis of the theoretical results presented within the paper Is Q-Learning Provably Efficient? by Jin et al. We include a survey of related research to contextualize the need for strengthening the theoretical guarantees related to perhaps the most important threads of model-free reinforcement learning. We also expound upon the reasoning used in the proofs to highlight the critical steps leading to the main result showing that Q-learning with UCB exploration achieves a sample efficiency that matches the optimal regret that can be achieved by any model-based approach.

Keywords

Cite

@article{arxiv.2009.10396,
  title  = {Is Q-Learning Provably Efficient? An Extended Analysis},
  author = {Kushagra Rastogi and Jonathan Lee and Fabrice Harel-Canada and Aditya Joglekar},
  journal= {arXiv preprint arXiv:2009.10396},
  year   = {2020}
}
R2 v1 2026-06-23T18:42:45.337Z