Cited by 25Reinforcement Learning in RoboticsDomain Adaptation and Few-Shot LearningAI-based Problem Solving and Planning

Generalized Hidden Parameter MDPs:Transferable Model-Based RL in a Handful of Trials

Open access
Perez, Christian, Petroski Such, Felipe, Karaletsos, Theofanis·2020·Proceedings of the AAAI Conference on Artificial Intelligence

Abstract

There is broad interest in creating RL agents that can solve many (related) tasks and adapt to new tasks and environments after initial training. Model-based RL leverages learned surrogate models that describe dynamics and rewards of individual tasks, such that planning in a good surrogate can lead to good control of the true system. Rather than solving each task individually from scratch, hierarchical models can exploit the fact that tasks are often related by (unobserved) causal factors of variation in order to achieve efficient generalization, as in learning how the mass of an item affects the force required to lift it can generalize to previously unobserved masses. We propose Generalized Hidden Parameter MDPs (GHP-MDPs) that describe a family of MDPs where both dynamics and reward can change as a function of hidden parameters that vary across tasks. The GHP-MDP augments model-based RL with latent variables that capture these hidden parameters, facilitating transfer across tasks. We also explore a variant of the model that incorporates explicit latent structure mirroring the causal factors of variation across tasks (for instance: agent properties, environmental factors, and goals). We experimentally demonstrate state-of-the-art performance and sample-efficiency on a new challenging MuJoCo task using reward and dynamics latent spaces, while beating a previous state-of-the-art baseline with > 10× less data. Using test-time inference of the latent variables, our approach generalizes in a single episode to novel combinations of dynamics and reward, and to novel rewards.

Integrity signals

Registry

Crossref · 10.1609/aaai.v34i04.5989

Cites

31 of 31 references verified0 citation errors · 0 not checkable

Statistics

Recomputing p-values needs the paper’s full text.

Claims the paper makes

We couldn’t retrieve this paper’s full text, so its claims and self-check weren’t run. The registry and citation checks still apply.

Claims other papers make about this one

Each is checked against this paper’s own text: does it say what the citing paper says it does?

  • Perez et al. (2020) build on Hi-MDPs to present Generalised Hidden-parameter MDPs (GHP-MDPs), where hidden parameters also control the reward function in addition to the dynamics.

    “Perez et al. (2020) builds on Hi-MDPs to present Generalised Hidden-parameter MDPs (GHP-MDPs), where the hidden parameters now also control the reward function in addition to the dynamics.”

    From A Survey of Zero-shot Generalisation in Deep Reinforcement Learning (2023) · cites this paper as Perez et al. (2020)

Cites

Flagged first, then by citations

2 of the 33 references couldn’t be matched to a known paper.

Cited by

Sorted by citations

Authors
Perez, C., Petroski Such, F., & Karaletsos, T.
Affiliations
Uber AI (United States) (US)
Venue
Proceedings of the AAAI Conference on Artificial Intelligence
Published
2020-04-03
Volume
34
Issue
04
Pages
5403-5411
ISSN
  • 2159-5399 (ISSN-L)
  • 2374-3468
OpenAlex
W2996795455
Cited by
25
References
33
Citations by year
2026: 2 · 2025: 1 · 2024: 5 · 2023: 7 · 2022: 2 · 2021: 3 · 2020: 5
FWCI
1.62
Type
conference paper
Language
en
Open access
Locations
  • Proceedings of the AAAI Conference on Artificial Intelligence (publishedVersion)
  • arXiv (Cornell University) (submittedVersion)
  • AAAI Publications (The Association for the Advancement of Artificial Intelligence (AAAI)) (submittedVersion)
  • arXiv (Cornell University)
Topics
  • Physical Sciences › Computer Science › Artificial Intelligence › Reinforcement Learning in Robotics
  • Physical Sciences › Computer Science › Artificial Intelligence › Domain Adaptation and Few-Shot Learning
  • Physical Sciences › Computer Science › Artificial Intelligence › AI-based Problem Solving and Planning
Keywords
model-based reinforcement learning, latent variables, task transfer, sample efficiency, hierarchical models, MuJoCo

About these checks

Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.

Statistics and arithmetic are recomputed, not judged.

Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.

What counts as a claim ›How we measure confidence ›How we check this ›

Are you an author, or do you see a problem with this page? Request a review