pith. sign in

arxiv: 1805.10662 · v3 · pith:3YG6EEYYnew · submitted 2018-05-27 · 💻 cs.LG · cs.AI· stat.ML

Fingerprint Policy Optimisation for Robust Reinforcement Learning

classification 💻 cs.LG cs.AIstat.ML
keywords policyenvironmentlearningoptimisationpoliciesdistributionfingerprintgradient
0
0 comments X
read the original abstract

Policy gradient methods ignore the potential value of adjusting environment variables: unobservable state features that are randomly determined by the environment in a physical setting, but are controllable in a simulator. This can lead to slow learning, or convergence to suboptimal policies, if the environment variable has a large impact on the transition dynamics. In this paper, we present fingerprint policy optimisation (FPO), which finds a policy that is optimal in expectation across the distribution of environment variables. The central idea is to use Bayesian optimisation (BO) to actively select the distribution of the environment variable that maximises the improvement generated by each iteration of the policy gradient method. To make this BO practical, we contribute two easy-to-compute low-dimensional fingerprints of the current policy. Our experiments show that FPO can efficiently learn policies that are robust to significant rare events, which are unlikely to be observable under random sampling, but are key to learning good policies.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Generalizing from a few environments in safety-critical reinforcement learning

    cs.LG 2019-07 unverdicted novelty 6.0

    RL agents fail dangerously on unseen environments; ensembles reduce catastrophes in gridworld but not CoinRun, with uncertainty enabling intervention prediction.