333 citations · 684 across the 37 of their papers we have counts for
9 papers · 1 filter
Optimizing Minimax Regret in Uncertain MDPs with Small Sets of Policies
Sterre Lutz, Daniël Vos, Matthijs T. J. Spaan +1
Sequential decision-making in real-world applications often involves uncertainty about the environment's model. Uncertain Markov decision processes (UMDPs) represent the possible e…
Generalization in offline RL: The structure is more important than the amount of pessimism
Max Weltevrede, Matthijs T. J. Spaan, Wendelin Böhmer
While pessimism counteracts overestimation bias in offline reinforcement learning (RL), being overly conservative has been associated with hindering certain forms of generalization…
COP-Q: Safety-First Reinforcement Learning for Robot Control via Cholesky-Ordered Projection
Guopeng Li, Moritz A. Zanger, Matthijs T. J. Spaan +1
Safe robot control requires maximizing return while satisfying safety constraints. In off-policy safe reinforcement learning, reward and safety Q-values are commonly learned by sep…
AlphaExploitem: Going Beyond the Nash Equilibrium in Poker by Learning to Exploit Suboptimal Play
Vlad Murgoci, Matthijs Spaan, Yaniv Oren
Poker is an imperfect information game that has served as a long-standing benchmark for decision-making under uncertainty. To maximize utility beyond the Nash equilibrium, an agent…
Particle Monte Carlo Tree Search
Yaniv Oren, Viliam Vadocz, Joery A. de Vries +3
Monte Carlo Tree Search (MCTS) is a widely used approach for policy improvement and action selection in Reinforcement Learning. Due to its sequential and deterministic nature, prin…
Off-Policy Safe Reinforcement Learning with Constrained Optimistic Exploration
Guopeng Li, Matthijs T. J. Spaan, Julian F. P. Kooij
When safety is formulated as a limit of cumulative cost, safe reinforcement learning (RL) aims to learn policies that maximize return subject to the cost constraint in data collect…
On the Equivalence of Random Network Distillation, Deep Ensembles, and Bayesian Inference
Moritz A. Zanger, Yijun Wu, Pascal R. Van der Vaart +2
Uncertainty quantification is central to safe and efficient deployments of deep learning models, yet many computationally practical methods lack lacking rigorous theoretical motiva…
Sparse Masked Attention Policies for Reliable Generalization
Caroline Horsch, Laurens Engwegen, Max Weltevrede +2
In reinforcement learning, abstraction methods that remove unnecessary information from the observation are commonly used to learn policies which generalize better to unseen tasks.…
VariBASed: Variational Bayes-Adaptive Sequential Monte-Carlo Planning for Deep Reinforcement Learning
Joery A. de Vries, Jinke He, Yaniv Oren +3
Optimally trading-off exploration and exploitation is the holy grail of reinforcement learning as it promises maximal data-efficiency for solving any task. Bayes-optimal agents ach…