1k citations · 2.2k across the 34 of their papers we have counts for
Showing 2021Show all
2 papers · 1 filter
cs.LG2021
Active Offline Policy Selection
Ksenia Konyushkova, Yutian Chen, Tom Le Paine +5
This paper addresses the problem of policy selection in domains with abundant logged data, but with a restricted interaction budget. Solving this problem would enable safe evaluati…
cs.AI2021
Discovering a set of policies for the worst case reward
Tom Zahavy, Andre Barreto, Daniel J Mankowitz +4
We study the problem of how to construct a set of policies that can be composed together to solve a collection of reinforcement learning tasks. Each task is a different reward func…