mlsanityData to 7 Oct 2026

DEIR: Efficient and Robust Exploration through Discriminative-Model-Based Episodic Intrinsic Rewards

arXiv 2304.10770 ↗First posted 21 Apr 2023cs.LG cs.AI cs.ITcited by 7

Not on the map. Why?

Abstract (arXiv)

Exploration is a fundamental aspect of reinforcement learning (RL), and its effectiveness is a deciding factor in the performance of RL algorithms, especially when facing sparse extrinsic rewards. Recent studies have shown the effectiveness of encouraging exploration with intrinsic rewards estimated from novelties in observations. However, there is a gap between the novelty of an observation and an exploration, as both the stochasticity in the environment and the agent's behavior may affect the observation. To evaluate exploratory behaviors accurately, we propose DEIR, a novel method in which we theoretically derive an intrinsic reward with a conditional mutual information term that principally scales with the novelty contributed by agent explorations, and then implement the reward with a discriminative forward model. Extensive experiments on both standard and advanced exploration tasks in MiniGrid show that DEIR quickly learns a better policy than the baselines. Our evaluations on ProcGen demonstrate both the generalization capability and the general applicability of our intrinsic reward. Our source code is available at https://github.com/swan-utokyo/deir.

Key facts. Cited by 7 papers in the map (data through 7 Oct 2026). Builds on 27 of its 63 references that are in the map. First posted on arXiv 21 Apr 2023.

Builds on

27 of 63 references.

References · 27

  1. 2017Proximal Policy Optimization Algorithmscited by 14,441
  2. 2015Batch Normalization: Accelerating Deep Network Training by Reducing Internal Covariate Shiftcited by 6,979
  3. 2016Layer Normalizationcited by 5,579
  4. 2016OpenAI Gymcited by 1,684
  5. 2019Dream to Control: Learning Behaviors by Latent Imaginationcited by 1,598
  6. 2014On the Properties of Neural Machine Translation: Encoder-Decoder Approachescited by 1,303
  7. 2016Understanding intermediate layers using linear classifier probescited by 1,279
  8. 2017Curiosity-driven Exploration by Self-supervised Predictioncited by 1,173
  9. 2018Exploration by Random Network Distillationcited by 966
  10. 2018IMPALA: Scalable Distributed Deep-RL with Importance Weighted Actor-Learner Architecturescited by 866
  11. 2020CURL: Contrastive Unsupervised Representations for Reinforcement Learningcited by 745
  12. 2016Unifying Count-Based Exploration and Intrinsic Motivationcited by 632
15 more
  1. 2019Leveraging Procedural Generation to Benchmark Reinforcement Learningcited by 478
  2. 2017Deep Reinforcement Learning: An Overviewcited by 327
  3. 2019Emergent Tool Use From Multi-Agent Autocurriculacited by 308
  4. 2016#Exploration: A Study of Count-Based Exploration for Deep Reinforcement Learningcited by 307
  5. 2017Count-Based Exploration with Neural Density Modelscited by 255
  6. 2020Never Give Up: Learning Directed Exploration Strategiescited by 210
  7. 2020What Matters In On-Policy Reinforcement Learning? A Large-Scale Empirical Studycited by 157
  8. 2017Neural Episodic Controlcited by 148
  9. 2021Contrastive Behavioral Similarity Embeddings for Generalization in Reinforcement Learningcited by 123
  10. 2020Phasic Policy Gradientcited by 121
  11. 2016Model-Free Episodic Controlcited by 100
  12. 2021Decoupling Value and Policy for Generalization in Reinforcement Learningcited by 81
  13. 2016PixelVAE: A Latent Variable Model for Natural Imagescited by 69
  14. 2017Z-Forcing: Training Stochastic Recurrent Networkscited by 51
  15. 2015Batch Normalized Recurrent Neural Networkscited by 14

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 2; 2025: 3; 2026: 2.

7 papers.