Yangchen Pan, Martha White, Qingfeng Lan, Alona Fyshe
We have not lifted any functions out of this paper's repositories yet, so there is nothing we have run. The repositories linked to it are listed below.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
Q-learning suffers from overestimation bias, because it approximates the maximum action value using the maximum estimated action value. Algorithms have been proposed to reduce overestimation bias, but we lack an understanding of how bias interacts with performance, and the extent to which existing algorithms mitigate bias. In this paper, we 1) highlight that the effect of overestimation bias on learning efficiency is environment-dependent; 2) propose a generalization of Qlearning, called Maxmin Q-learning, which provides a parameter to flexibly control bias; 3) show theoretically that there exists a parameter choice for Maxmin Q-learning that leads to unbiased estimation with a lower approximation variance than Q-learning; and 4) prove the convergence of our algorithm in the tabular case, as well as convergence of several previous Q-learning variants, using a novel Generalized Q-learning framework. We empirically verify that our algorithm better controls estimation bias in toy environments, and that it achieves superior performance on several benchmark problems. 1
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2002.06487")
get_code_for_paper("2002.06487")
have("2002.06487")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2002.06487.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2002.06487)
Connect an agent — have() is free.