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.
Delusional bias is a fundamental source of error in approximate Q-learning. To date, the only techniques that explicitly address delusion require comprehensive search using tabular value estimates. In this paper, we develop efficient methods to mitigate delusional bias by training Q-approximators with labels that are "consistent" with the underlying greedy policy class. We introduce a simple penalization scheme that encourages Q-labels used across training batches to remain (jointly) consistent with the expressible policy class. We also propose a search framework that allows multiple Q-approximators to be generated and tracked, thus mitigating the effect of premature (implicit) policy commitments. Experimental results demonstrate that these methods can improve the performance of Q-learning in a variety of Atari games, sometimes dramatically.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2002.12399")
get_code_for_paper("2002.12399")
have("2002.12399")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2002.12399.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2002.12399)
Connect an agent — have() is free.