mlsanityData to 14 Oct 2026

CIG: Exploration via Conditional Information Gain

arXiv 2605.20878 ↗First posted 20 May 2026cs.LGcited by 0

On the map: Deep reinforcement learning methods → Deep RL algorithms and representations

Abstract (arXiv)

Intrinsic rewards for exploration in reinforcement learning condition on different contexts: lifelong rewards score each transition against accumulated experience but ignore within-rollout redundancy; episodic rewards penalize intra-trajectory repetition but discard lifetime progress. Hybrid methods combine both signals through heuristic weights or require Gaussian-process dynamics that do not scale beyond low-dimensional state spaces. Trajectory-level information gain decomposes into per-step terms that condition on the replay buffer and rollout prefix simultaneously, but remains intractable for deep models. We derive the Conditional Information Gain (CIG) reward as a tractable surrogate: a log-determinant objective over an ensemble disagreement kernel whose Cholesky factorization yields causal per-step rewards that retain both conditioning sets while scaling to high-dimensional state spaces. We instantiate CIG in a model-based setting, where rollouts are short and within-rollout corrections remain largely unexplored. Across twelve tasks spanning discrete (MiniGrid) and continuous control (OGBench), in both clean and stochastic-distractor settings, CIG outperforms or matches prior exploration methods while remaining robust to stochastic distractors.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Placed in Deep RL algorithms and representations, one of 15 directions in Deep reinforcement learning methods. Builds on 35 of its 49 references that are in the map. First posted on arXiv 20 May 2026.

Builds on

35 of 49 references.

Closest ancestors · 2

Same direction, newest first

  1. 2025Episodic Novelty Through Temporal Distance26 Jan
  2. 2024Exploration and Anti-Exploration with Distributional Random Network Distillation18 Jan

Other references · 33

  1. 2016Simple and Scalable Predictive Uncertainty Estimation using Deep Ensemblescited by 3,926
  2. 2018Learning Latent Dynamics for Planning from Pixelscited by 1,264
  3. 2017Curiosity-driven Exploration by Self-supervised Predictioncited by 1,194
  4. 2020Mastering Atari with Discrete World Modelscited by 1,007
  5. 2018Exploration by Random Network Distillationcited by 993
  6. 2021Deep Reinforcement Learning at the Edge of the Statistical Precipicecited by 807
  7. 2018Recurrent World Models Facilitate Policy Evolutioncited by 785
  8. 2016Unifying Count-Based Exploration and Intrinsic Motivationcited by 639
  9. 2020Planning to Explore via Self-Supervised World Modelscited by 368
  10. 2023Minigrid & Miniworld: Modular & Customizable Reinforcement Learning Environments for Goal-Oriented Taskscited by 327
  11. 2020Agent57: Outperforming the Atari Human Benchmarkcited by 303
  12. 2019Self-Supervised Exploration via Disagreementcited by 265
21 more
  1. 2017Count-Based Exploration with Neural Density Modelscited by 257
  2. 2024OGBench: Benchmarking Offline Goal-Conditioned RLcited by 238
  3. 2020Never Give Up: Learning Directed Exploration Strategiescited by 212
  4. 2021Behavior From the Void: Unsupervised Active Pre-Trainingcited by 174
  5. 2020RIDE: Rewarding Impact-Driven Exploration for Procedurally-Generated Environmentscited by 135
  6. 2023Modern Bayesian Experimental Designcited by 125
  7. 2018Episodic Curiosity through Reachabilitycited by 109
  8. 2021State Entropy Maximization with Random Encoders for Efficient Explorationcited by 108
  9. 2018Model-Based Active Explorationcited by 105
  10. 2022Exploration via Elliptical Episodic Bonusescited by 51
  11. 2021MADE: Exploration via Maximizing Deviation from Explored Regionscited by 40
  12. 2023On the Importance of Exploration for Generalization in Reinforcement Learningcited by 31
  13. 2021Rank the Episodes: A Simple Approach for Exploration in Procedurally-Generated Environmentscited by 28
  14. 2023Flipping Coins to Estimate Pseudocounts for Exploration in Reinforcement Learningcited by 28
  15. 2021How to Stay Curious while Avoiding Noisy TVs using Aleatoric Uncertainty Estimationcited by 27
  16. 2021Curiosity-Driven Exploration via Latent Bayesian Surprisecited by 22
  17. 2023A Study of Global and Episodic Bonuses for Exploration in Contextual MDPscited by 20
  18. 2021An Experimental Design Perspective on Model-Based Reinforcement Learningcited by 16
  19. 2022LECO: Learnable Episodic Count for Task-Specific Intrinsic Rewardcited by 11
  20. 2022Exploration via Planning for Information about the Optimal Trajectorycited by 8
  21. 2025On Efficient Bayesian Exploration in Model-Based Reinforcement Learningcited by 2

Built on by

Not cited yet.

Similar, not cited

Close in wording, no citation either way

  1. 2024MaxInfoRL: Boosting exploration in reinforcement learning through information gain maximization
  2. 2025Beyond Noisy-TVs: Noise-Robust Exploration Via Learning Progress Monitoring
  3. 2026Task-Aware Exploration via a Predictive Bisimulation Metric
  4. 2025Learning to Explore in Diverse Reward Settings via Temporal-Difference-Error Maximization
  5. 2026Explore Beyond the Boundary Using Entropic Information
  6. 2024Effective Exploration Based on the Structural Information Principles
  7. 2024Beyond Optimism: Exploration With Partially Observable Rewards
  8. 2024ELEMENT: Episodic and Lifelong Exploration via Maximum Entropy