UCB Momentum Q-learning: Correcting the bias without forgetting - Inria - Institut national de recherche en sciences et technologies du numérique Access content directly
Conference Papers Year : 2021

UCB Momentum Q-learning: Correcting the bias without forgetting

Abstract

We propose UCBMQ, Upper Confidence Bound Momentum Q-learning, a new algorithm for reinforcement learning in tabular and possibly stagedependent, episodic Markov decision process. UCBMQ is based on Q-learning where we add a momentum term and rely on the principle of optimism in face of uncertainty to deal with exploration. Our new technical ingredient of UCBMQ is the use of momentum to correct the bias that Q-learning suffers while, at the same time, limiting the impact it has on the the second-order term of the regret. For UCBMQ, we are able to guarantee a regret of at most O(√ H 3 SAT + H 4 SA) where H is the length of an episode, S the number of states, A the number of actions, T the number of episodes and ignoring terms in poly log(SAHT). Notably, UCBMQ is the first algorithm that simultaneously matches the lower bound of Ω(√ H 3 SAT) for large enough T and has a second-order term (with respect to the horizon T) that scales only linearly with the number of states S.
Fichier principal
Vignette du fichier
menard2021ucb.pdf (2.63 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03289033 , version 1 (16-07-2021)

Identifiers

  • HAL Id : hal-03289033 , version 1

Cite

Pierre Ménard, Omar Darwiche Domingues, Xuedong Shang, Michal Valko. UCB Momentum Q-learning: Correcting the bias without forgetting. International Conference on Machine Learning, Jul 2021, Vienna / Virtual, Austria. ⟨hal-03289033⟩
92 View
63 Download

Share

Gmail Facebook X LinkedIn More