Minimax-Bayes Reinforcement Learning
Not on the map. Why?
Abstract (arXiv)
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.
Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). Builds on 10 of its 31 references that are in the map. First posted on arXiv 21 Feb 2023.
Builds on
10 of 31 references.
References · 10
- 2018Soft Actor-Critic Algorithms and Applicationscited by 1,179
- 2014Convex Optimization: Algorithms and Complexitycited by 569
- 2016Learning to reinforcement learncited by 369
- 2019On Gradient Descent Ascent for Nonconvex-Concave Minimax Problemscited by 266
- 2021Maximum Entropy RL (Provably) Solves Some Robust RL Problemscited by 169
- 2019An Information-Theoretic Approach to Minimax Regret in Partial Monitoringcited by 41
- 2019Beyond Confidence Regions: Tight Bayesian Ambiguity Sets for Robust MDPscited by 37
- 2020Meta-trained agents implement Bayes-optimal agentscited by 37
- 2019A Bayesian Approach to Robust Reinforcement Learningcited by 32
- 2014Generalised Entropy MDPs and Minimax Regretcited by 1
Built on by
Citing papers per year: 2023: 2; 2024: 3.
5 papers.
- 2024MaxInfoRL: Boosting exploration in reinforcement learning through information gain maximizationcited by 30
- 2023Bayesian Exploration Networkscited by 3
- 2024Information-Theoretic Minimax Regret Bounds for Reinforcement Learning based on Dualitycited by 1
- 2024Isoperimetry is All We Need: Langevin Posterior Sampling for RL with Sublinear Regretcited by 1
- 2023Bayesian Neural Networks: A Min-Max Game Frameworkcited by 0
- 2024Isoperimetry is All We Need: Langevin Posterior Sampling for RL with Sublinear Regret30 Dec 2024
- 2024MaxInfoRL: Boosting exploration in reinforcement learning through information gain maximization16 Dec 2024
- 2024Information-Theoretic Minimax Regret Bounds for Reinforcement Learning based on Duality21 Oct 2024
- 2023Bayesian Neural Networks: A Min-Max Game Framework18 Nov 2023
- 2023Bayesian Exploration Networks24 Aug 2023