mlsanityData to 7 Oct 2026

LECO: Learnable Episodic Count for Task-Specific Intrinsic Reward

arXiv 2210.05409 ↗First posted 11 Oct 2022cs.LG cs.AIcited by 11

Not on the map. Why?

Abstract (arXiv)

Episodic count has been widely used to design a simple yet effective intrinsic motivation for reinforcement learning with a sparse reward. However, the use of episodic count in a high-dimensional state space as well as over a long episode time requires a thorough state compression and fast hashing, which hinders rigorous exploitation of it in such hard and complex exploration environments. Moreover, the interference from task-irrelevant observations in the episodic count may cause its intrinsic motivation to overlook task-related important changes of states, and the novelty in an episodic manner can lead to repeatedly revisit the familiar states across episodes. In order to resolve these issues, in this paper, we propose a learnable hash-based episodic count, which we name LECO, that efficiently performs as a task-specific intrinsic reward in hard exploration problems. In particular, the proposed intrinsic reward consists of the episodic novelty and the task-specific modulation where the former employs a vector quantized variational autoencoder to automatically obtain the discrete state codes for fast counting while the latter regulates the episodic novelty by learning a modulator to optimize the task-specific extrinsic reward. The proposed LECO specifically enables the automatic transition from exploration to exploitation during reinforcement learning. We experimentally show that in contrast to the previous exploration methods LECO successfully solves hard exploration problems and also scales to large state spaces through the most difficult tasks in MiniGrid and DMLab environments.

Key facts. Cited by 11 papers in the map (data through 7 Oct 2026). Builds on 28 of its 42 references that are in the map. First posted on arXiv 11 Oct 2022.

Builds on

28 of 42 references.

References · 28

  1. 2017Neural Discrete Representation Learningcited by 4,650
  2. 2017Curiosity-driven Exploration by Self-supervised Predictioncited by 1,173
  3. 2018Exploration by Random Network Distillationcited by 966
  4. 2018IMPALA: Scalable Distributed Deep-RL with Importance Weighted Actor-Learner Architecturescited by 866
  5. 2016Unifying Count-Based Exploration and Intrinsic Motivationcited by 632
  6. 2019Leveraging Procedural Generation to Benchmark Reinforcement Learningcited by 478
  7. 2016#Exploration: A Study of Count-Based Exploration for Deep Reinforcement Learningcited by 307
  8. 2016Variational Intrinsic Controlcited by 262
  9. 2020First return, then explorecited by 256
  10. 2017Count-Based Exploration with Neural Density Modelscited by 255
  11. 2020Never Give Up: Learning Directed Exploration Strategiescited by 210
  12. 2020The NetHack Learning Environmentcited by 196
16 more
  1. 2020RIDE: Rewarding Impact-Driven Exploration for Procedurally-Generated Environmentscited by 135
  2. 2018Count-Based Exploration with the Successor Representationcited by 112
  3. 2018Episodic Curiosity through Reachabilitycited by 109
  4. 2018On Learning Intrinsic Rewards for Policy Gradient Methodscited by 100
  5. 2020Learning with AMIGo: Adversarially Motivated Intrinsic Goalscited by 86
  6. 2020Sample Factory: Egocentric 3D Control from Pixels at 100000 FPS with Asynchronous Reinforcement Learningcited by 84
  7. 2019Obstacle Tower: A Generalization Challenge in Vision, Control, and Planningcited by 54
  8. 2017Count-Based Exploration in Feature Space for Reinforcement Learningcited by 48
  9. 2021Adversarially Guided Actor-Criticcited by 47
  10. 2021MADE: Exploration via Maximizing Deviation from Explored Regionscited by 40
  11. 2019What Can Learned Intrinsic Rewards Capture?cited by 36
  12. 2021Dynamic Bottleneck for Robust Self-Supervised Explorationcited by 21
  13. 2018Efficient Model-Based Deep Reinforcement Learning with Variational State Tabulationcited by 20
  14. 2021Drop-Bottleneck: Learning Discrete Compressed Representation for Noise-Robust Explorationcited by 15
  15. 2020Variational Intrinsic Control Revisitedcited by 11
  16. 2021Don't Do What Doesn't Matter: Intrinsic Motivation with Action Usefulnesscited by 7

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2023: 4; 2024: 6; 2025: 0; 2026: 1.

11 papers.