Pith. sign in

REVIEW 4 cited by

Learning Actionable Representations with Goal-Conditioned Policies

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 1811.07819 v2 pith:QZUEIJQE submitted 2018-11-19 cs.LG cs.AIstat.ML

Learning Actionable Representations with Goal-Conditioned Policies

classification cs.LG cs.AIstat.ML
keywords learningrepresentationsfactorsobservationrepresentationvariationcapturereinforcement
verification ladder T0 review T1 audit T2 compute T3 formal T4 reserved
0 comments
read the original abstract

Representation learning is a central challenge across a range of machine learning areas. In reinforcement learning, effective and functional representations have the potential to tremendously accelerate learning progress and solve more challenging problems. Most prior work on representation learning has focused on generative approaches, learning representations that capture all underlying factors of variation in the observation space in a more disentangled or well-ordered manner. In this paper, we instead aim to learn functionally salient representations: representations that are not necessarily complete in terms of capturing all factors of variation in the observation space, but rather aim to capture those factors of variation that are important for decision making -- that are "actionable." These representations are aware of the dynamics of the environment, and capture only the elements of the observation that are necessary for decision making rather than all factors of variation, without explicit reconstruction of the observation. We show how these representations can be useful to improve exploration for sparse reward problems, to enable long horizon hierarchical reinforcement learning, and as a state representation for learning policies for downstream tasks. We evaluate our method on a number of simulated environments, and compare it to prior methods for representation learning, exploration, and hierarchical reinforcement learning.

discussion (0)

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

Forward citations

Cited by 4 Pith papers

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

  1. Global Convergence of Sampling-Based Nonconvex Optimization through Diffusion-Style Smoothing

    cs.LG 2026-05 unverdicted novelty 6.0

    Recasts sampling-based nonconvex optimization as smoothed gradient descent to obtain non-asymptotic convergence guarantees and introduces the DIDA annealed algorithm that converges to the global optimum.

  2. Evaluating Actionability in Explainable AI

    cs.HC 2026-01 conditional novelty 6.0

    From 14 interviews in medicine and education, the authors derive a catalog mapping 12 information categories to 60 user actions across three action dimensions.

  3. Learning World Graphs to Accelerate Hierarchical Reinforcement Learning

    cs.LG 2019-07 unverdicted novelty 6.0

    A two-stage framework learns a world graph of pivotal states task-agnostically via joint training of a latent model and curiosity-driven policy, then uses the graph to accelerate hierarchical RL on maze tasks.

  4. Learning to Perceive the World Through Control: Empowerment-Based Representation Learning

    cs.LG 2026-05 unverdicted novelty 5.0

    Empowerment maximization induces forward and backward state representations that are invariant to control-irrelevant features.