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.
While the Bayesian decision-theoretic framework offers an elegant solution to the problem of decision making under uncertainty, one question is how to appropriately select the prior distribution. One idea is to employ a worst-case prior. However, this is not as easy to specify in sequential decision making as in simple statistical estimation problems. This paper studies (sometimes approximate) minimax-Bayes solutions for various reinforcement learning problems to gain insights into the properties of the corresponding priors and policies. We find that while the worst-case prior depends on the setting, the corresponding minimax policies are more robust than those that assume a standard (i.e. uniform) prior.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2302.10831")
get_code_for_paper("2302.10831")
have("2302.10831")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2302.10831.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2302.10831)
Connect an agent — have() is free.