Counterfactually-Guided Policy Search

A compelling way to reduce the cost of real experience in reinforcement learning is to learn policies on data synthesised by models. The authors of Woulda, Coulda, Shoulda: Counterfactually-Guided Policy Search propose CF-GPS, an algorithm for learning policies in POMDPs from off-policy experience.

The novelty lies in considering alternative outcomes, which lets the algorithm make better use of the experience it already has. Their empirical evaluation reports improvements in both policy evaluation and policy search on a non-trivial grid-world task.

Two panels. On the left, three separate runs of the world, each with its own scenario u1, u2, u3, leading to three outcomes. On the right, one observed run with scenario u, the scenario inferred from what happened, then replayed under two other actions with the same u to give counterfactual outcomes.
Three answers either cost three runs of the world, each under its own draw of the randomness, or one run whose scenario is inferred and then replayed under other actions. Holding that scenario fixed is what makes the second column counterfactual rather than merely hypothetical.

Buesing et al. introduce the problem through an everyday example: re-evaluating a job offer after having made a regrettable decision.

The appeal is that the method pays for better policies with reasoning rather than with more interaction, which matters in any setting where collecting experience is the expensive part.

Leave a Reply