Pith. sign in

REVIEW 2 cited by

Unsupervised Learning of Goal Spaces for Intrinsically Motivated Goal Exploration

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 1803.00781 v3 pith:YHB6DAON submitted 2018-03-02 cs.LG cs.AI

classification cs.LGcs.AI
keywords algorithmsexplorationgoallearningspacestagedeepengineered
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Intrinsically motivated goal exploration algorithms enable machines to discover repertoires of policies that produce a diversity of effects in complex environments. These exploration algorithms have been shown to allow real world robots to acquire skills such as tool use in high-dimensional continuous state and action spaces. However, they have so far assumed that self-generated goals are sampled in a specifically engineered feature space, limiting their autonomy. In this work, we propose to use deep representation learning algorithms to learn an adequate goal space. This is a developmental 2-stage approach: first, in a perceptual learning stage, deep learning algorithms use passive raw sensor observations of world changes to learn a corresponding latent space; then goal exploration happens in a second stage by sampling goals in this latent space. We present experiments where a simulated robot arm interacts with an object, and we show that exploration algorithms using such learned representations can match the performance obtained using engineered representations.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

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

  1. Expedition & Expansion: Leveraging Semantic Representations for Goal-Directed Exploration in Continuous Cellular Automata

    cs.AI 2025-09 conditional novelty 6.0 of 10

    A hybrid exploration algorithm that alternates semantic novelty search with VLM-generated linguistic goals discovers more diverse Flow Lenia behaviors than novelty search alone.

  2. A Deep Learning Based Method for Fast Registration of Cardiac Magnetic Resonance Images

    eess.IV 2025-06 reject novelty 3.0 of 10

    FLIR is a cascade of lightweight U-Nets for cardiac MRI registration; it beats VoxelMorph dice scores only with 3 to 5 cascades, which run slower than VoxelMorph, so the speed claim is not supported.

Pith tools