Regularized Q-learning through Robust Averaging

Peter Schmitt-Förster, Tobias Sutter
5/3/2024
math.OCcs.LG

No official code found. Best implementation: 2RAQ/code (0 stars, last commit 2024-07-18).

Abstract

We propose a new Q-learning variant, called 2RA Q-learning, that addresses some weaknesses of existing Q-learning methods in a principled manner. One such weakness is an underlying estimation bias which cannot be controlled and often results in poor performance. We propose a distributionally robust estimator for the maximum expected value term, which allows us to precisely control the level of estimation bias introduced. The distributionally robust estimator admits a closed-form solution such that the proposed algorithm has a computational cost per iteration comparable to Watkins' Q-learning. For the tabular case, we show that 2RA Q-learning converges to the optimal policy and analyze its asymptotic mean-squared error. Lastly, we conduct numerical experiments for various settings, which corroborate our theoretical findings and indicate that 2RA Q-learning often performs better than existing methods.

View on arXivView PDF

Code Implementations(1)

2RAQ/codeCommunity100%
00PythonJan 26, 20242 years ago

Similar Papers

Cite this paper

@article{schmittfrster2024regularized,
  title  = {Regularized Q-learning through Robust Averaging},
  author = {Peter Schmitt-Förster and Tobias Sutter},
  year   = {2024},
  eprint = {2405.02201},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2405.02201v2},
  journal = {ICML 2024 2024}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2405.02201.svg)](https://codeofpaper.com/paper/2405.02201)

Discussion