Rishabh Agarwal, Joshua Zitovsky, Daniel De Marchi, Michael Kosorok
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.
Offline model selection (OMS), that is, choosing the best policy from a set of many policies given only logged data, is crucial for applying offline RL in real-world settings. One idea that has been extensively explored is to select policies based on the mean squared Bellman error (MSBE) of the associated Q-functions. However, previous work has struggled to obtain adequate OMS performance with Bellman errors, leading many researchers to abandon the idea. To this end, we elucidate why previous work has seen pessimistic results with Bellman errors and identify conditions under which OMS algorithms based on Bellman errors will perform well. Moreover, we develop a new estimator of the MSBE that is more accurate than prior methods. Our estimator obtains impressive OMS performance on diverse discrete control tasks, including Atari games.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2302.00141")
get_code_for_paper("2302.00141")
have("2302.00141")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2302.00141.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2302.00141)
Connect an agent — have() is free.