pith. sign in

arxiv: 1901.10964 · v1 · pith:LGYWERFXnew · submitted 2019-01-30 · 💻 cs.LG · cs.AI

Transfer in Deep Reinforcement Learning Using Successor Features and Generalised Policy Improvement

classification 💻 cs.LG cs.AI
keywords tasksfeaturesframeworklearningskillstransferdeepfuture
0
0 comments X
read the original abstract

The ability to transfer skills across tasks has the potential to scale up reinforcement learning (RL) agents to environments currently out of reach. Recently, a framework based on two ideas, successor features (SFs) and generalised policy improvement (GPI), has been introduced as a principled way of transferring skills. In this paper we extend the SFs & GPI framework in two ways. One of the basic assumptions underlying the original formulation of SFs & GPI is that rewards for all tasks of interest can be computed as linear combinations of a fixed set of features. We relax this constraint and show that the theoretical guarantees supporting the framework can be extended to any set of tasks that only differ in the reward function. Our second contribution is to show that one can use the reward functions themselves as features for future tasks, without any loss of expressiveness, thus removing the need to specify a set of features beforehand. This makes it possible to combine SFs & GPI with deep learning in a more stable way. We empirically verify this claim on a complex 3D environment where observations are images from a first-person perspective. We show that the transfer promoted by SFs & GPI leads to very good policies on unseen tasks almost instantaneously. We also describe how to learn policies specialised to the new tasks in a way that allows them to be added to the agent's set of skills, and thus be reused in the future.

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 2 Pith papers

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

  1. Lever: Inference-Time Policy Reuse under Support Constraints

    cs.LG 2026-04 unverdicted novelty 6.0

    LEVER enables offline composition of pre-trained RL policies via behavioral embeddings and Q-value composition, matching or exceeding training-from-scratch performance in deterministic GridWorld while highlighting lim...

  2. A neurally plausible model learns successor representations in partially observable environments

    stat.ML 2019-06 unverdicted novelty 6.0

    A model combining distributional successor features with successor representations supports RL in noisy partially observable environments.