pith. sign in

arxiv: 1606.05312 · v2 · pith:5BWGI6GBnew · submitted 2016-06-16 · 💻 cs.AI

Successor Features for Transfer in Reinforcement Learning

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

Transfer in reinforcement learning refers to the notion that generalization should occur not only within a task but also across tasks. We propose a transfer framework for the scenario where the reward function changes between tasks but the environment's dynamics remain the same. Our approach rests on two key ideas: "successor features", a value function representation that decouples the dynamics of the environment from the rewards, and "generalized policy improvement", a generalization of dynamic programming's policy improvement operation that considers a set of policies rather than a single one. Put together, the two ideas lead to an approach that integrates seamlessly within the reinforcement learning framework and allows the free exchange of information across tasks. The proposed method also provides performance guarantees for the transferred policy even before any learning has taken place. We derive two theorems that set our approach in firm theoretical ground and present experiments that show that it successfully promotes transfer in practice, significantly outperforming alternative methods in a sequence of navigation tasks and in the control of a simulated robotic arm.

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. Finite-Time Analysis of MCTS in Continuous POMDP Planning

    cs.AI 2026-05 unverdicted novelty 5.0

    The paper proves finite-time probabilistic bounds on value estimates for MCTS in both discrete and continuous POMDPs and introduces Voro-POMCPOW with adaptive partitioning for guarantees.

  2. Self-Predictive Representations for Combinatorial Generalization in Behavioral Cloning

    cs.LG 2025-06 unverdicted novelty 5.0

    BYOL-γ uses self-predictive representations to approximate successor representations, improving zero-shot combinatorial generalization in goal-conditioned behavioral cloning.