Papers
Topics
Authors
Recent
Gemini 2.5 Flash
Gemini 2.5 Flash
144 tokens/sec
GPT-4o
7 tokens/sec
Gemini 2.5 Pro Pro
46 tokens/sec
o3 Pro
4 tokens/sec
GPT-4.1 Pro
38 tokens/sec
DeepSeek R1 via Azure Pro
28 tokens/sec
2000 character limit reached

Generalized Speedy Q-learning (1911.00397v2)

Published 1 Nov 2019 in cs.LG and cs.AI

Abstract: In this paper, we derive a generalization of the Speedy Q-learning (SQL) algorithm that was proposed in the Reinforcement Learning (RL) literature to handle slow convergence of Watkins' Q-learning. In most RL algorithms such as Q-learning, the BeLLMan equation and the BeLLMan operator play an important role. It is possible to generalize the BeLLMan operator using the technique of successive relaxation. We use the generalized BeLLMan operator to derive a simple and efficient family of algorithms called Generalized Speedy Q-learning (GSQL-w) and analyze its finite time performance. We show that GSQL-w has an improved finite time performance bound compared to SQL for the case when the relaxation parameter w is greater than 1. This improvement is a consequence of the contraction factor of the generalized BeLLMan operator being less than that of the standard BeLLMan operator. Numerical experiments are provided to demonstrate the empirical performance of the GSQL-w algorithm.

Citations (13)

Summary

We haven't generated a summary for this paper yet.