Sample Complexity of Asynchronous Q-Learning: Sharper Analysis and Variance Reduction

DOI10.1109/TIT.2021.3120096zbMath1489.90209arXiv2006.03041OpenAlexW3207876914MaRDI QIDQ5030298

Yuejie Chi, Yuting Wei, Yuantao Gu, Gen Li, Yuxin Chen

Publication date: 17 February 2022

Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2006.03041

zbMATH Keywords

Markov decision processQ-functionasynchronous Q-learningoptimal action-value function

Mathematics Subject Classification ID

Artificial neural networks and deep learning (68T07) Markov and semi-Markov decision processes (90C40)

Related Items (3)

A Discrete-Time Switching System Analysis of Q-Learning ⋮ Approximate Q Learning for Controlled Diffusion Processes and Its Near Optimality ⋮ Settling the sample complexity of model-based offline reinforcement learning

This page was built for publication: Sample Complexity of Asynchronous Q-Learning: Sharper Analysis and Variance Reduction