The reviewed record of science sign in
Pith

arxiv: 2202.00161 · v3 · pith:LEMK5LPS · submitted 2022-02-01 · cs.LG · cs.AI

CIC: Contrastive Intrinsic Control for Unsupervised Skill Discovery

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:LEMK5LPSrecord.jsonopen to challenge →

classification cs.LG cs.AI
keywords skillunsupervisedalgorithmcontrastivediscoveryintrinsicadaptationcontrol
0
0 comments X
read the original abstract

We introduce Contrastive Intrinsic Control (CIC), an algorithm for unsupervised skill discovery that maximizes the mutual information between state-transitions and latent skill vectors. CIC utilizes contrastive learning between state-transitions and skills to learn behavior embeddings and maximizes the entropy of these embeddings as an intrinsic reward to encourage behavioral diversity. We evaluate our algorithm on the Unsupervised Reinforcement Learning Benchmark, which consists of a long reward-free pre-training phase followed by a short adaptation phase to downstream tasks with extrinsic rewards. CIC substantially improves over prior methods in terms of adaptation efficiency, outperforming prior unsupervised skill discovery methods by 1.79x and the next leading overall exploration algorithm by 1.18x.

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 6 Pith papers

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

  1. Unifying Goal-Conditioned RL and Unsupervised Skill Learning via Control-Maximization

    cs.LG 2026-05 unverdicted novelty 8.0

    GCRL and MISL are unified as control maximization, with three inequivalent GCRL formulations each matched to a MISL objective via bounds on goal-sensitivity.

  2. Goal Sets, Not Goal States: Queryable Robot Goals through Goal-Set Hindsight Relabeling

    cs.RO 2026-06 unverdicted novelty 7.0

    GS-HER generalizes hindsight relabeling to query-defined goal sets, enabling inference-time goal predicates for offline goal-conditioned RL while improving performance on tasks bottlenecked by nuisance state dimensions.

  3. Manifold Sampling via Entropy Maximization

    cs.LG 2026-05 conditional novelty 7.0

    MASEM samples constrained manifolds with unknown disconnected components via entropy-maximizing k-NN resampling, achieving exponential mean-field KL reduction and order-of-magnitude Sinkhorn improvement on benchmarks.

  4. One Policy, Infinite NPCs: Persona-Traceable Shared RL Policies for Scalable Game Agents

    cs.AI 2026-05 unverdicted novelty 6.0

    pcsp is a shared RL policy using LLM persona embeddings, low-rank projection, and PPO+InfoNCE+KL training that delivers 17x above-chance zero-shot persona identification and 22x faster inference on a 300-persona benchmark.

  5. QHyer: Q-conditioned Hybrid Attention-mamba Transformer for Offline Goal-conditioned RL

    cs.LG 2026-05 unverdicted novelty 6.0

    QHyer achieves state-of-the-art results in offline goal-conditioned RL by replacing return-to-go with a state-conditioned Q-estimator and introducing a gated hybrid attention-mamba backbone for content-adaptive histor...

  6. QHyer: Q-conditioned Hybrid Attention-mamba Transformer for Offline Goal-conditioned RL

    cs.LG 2026-05 unverdicted novelty 6.0

    QHyer replaces return-to-go with a state-conditioned Q-estimator and adds a gated hybrid attention-mamba backbone to achieve state-of-the-art performance in offline goal-conditioned RL on both Markovian and non-Markov...