Pith. sign in

REVIEW 3 cited by

Universal Successor Representations for Transfer Reinforcement Learning

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1804.03758 v1 pith:55DC4IM6 submitted 2018-04-11 cs.AI cs.LGstat.ML

classification cs.AIcs.LGstat.ML
keywords taskstransferlearninguniversalfunctionknowledgereinforcementrepresentations
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

The objective of transfer reinforcement learning is to generalize from a set of previous tasks to unseen new tasks. In this work, we focus on the transfer scenario where the dynamics among tasks are the same, but their goals differ. Although general value function (Sutton et al., 2011) has been shown to be useful for knowledge transfer, learning a universal value function can be challenging in practice. To attack this, we propose (1) to use universal successor representations (USR) to represent the transferable knowledge and (2) a USR approximator (USRA) that can be trained by interacting with the environment. Our experiments show that USR can be effectively applied to new tasks, and the agent initialized by the trained USRA can achieve the goal considerably faster than random initialization.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

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

  1. Is Conditional Generative Modeling all you need for Decision-Making?

    cs.LG 2022-11 unverdicted novelty 6.0 of 10

    Return-conditional diffusion models for policies outperform offline RL on benchmarks by circumventing dynamic programming and enable constraint or skill composition.

  2. Learning Action-Transferable Policy with Action Embedding

    cs.LG 2019-09 conditional novelty 6.0 of 10

    TRACE learns action embeddings from a transition model and transfers policies across reinforcement learning tasks with different state and action spaces, improving sample efficiency in experiments.

  3. VUSFA:Variational Universal Successor Features Approximator to Improve Transfer DRL for Target Driven Visual Navigation

    cs.LG 2019-08 conditional novelty 6.0 of 10

    VUSFA combines universal successor features, a successor-feature-dependent policy, and a variational information bottleneck to improve target-driven visual navigation transfer in the AI2THOR simulator.

Pith tools