Papers › LECO: Learnable Episodic Count for Task-Specific Intrinsic Reward

LECO: Learnable Episodic Count for Task-Specific Intrinsic Reward

11 Oct 2022arXiv:2210.05409archive 2025-07-28

DaeJin Jo, Sungwoong Kim, Daniel Wontae Nam, Taehwan Kwon, Seungeun Rho, Jongmin Kim, Donghoon Lee

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.

PaperPDFCodeCode Syntology ran

In Syntology Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="2210.05409")

Code

Syntology Ran 7 of 10 code samples harvested from 1 repository linked to this paper; 3 have no recorded run. Of those that ran: 6 ran · our draft was wrong; 1 ran with no contract checked.

By repository: official repository: 10 samples from 1 repository, 7 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

kakaobrain/leco officialmentioned on GitHubpytorch report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

10 samples harvested; 7 ran; 0 honoured the contract we drafted; 3 have no recorded run. Read from Syntology's graph 2026-09-24; that is when this build read the record, not when the samples ran.

6ran · our draft was wrong
1ran
3unverified

Licence: 10 of the 10 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from kakaobrain/leco. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “fixture could not drive it” are failures of Syntology's instrument, not of the code.

Each sample ends with its code_sha256, Syntology's identity for that exact code. An agent fetches the stored sample with Syntology's MCP tool get_code(code_sha256="…") (how to connect); click an identity to copy that call.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at harvest. “Pointer only” means Syntology does not serve that copy's text, for one of four reasons: no licence file was found; the licence was not identified; the licence is recorded as permissive but that copy's record is not marked cleared; or the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar). Some licences outside that list permit redistribution, such as WTFPL, and GPL-3.0 under its conditions; they are simply not on the list. Hover a licence label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

AttrDict kakaobrain/leco/sample_factory/algorithms/appo/intrinsic.py official repository ran no licence file found · pointer only · 992553c7fdf8d531 · report
get_obs_shape kakaobrain/leco/sample_factory/algorithms/appo/intrinsic.py official repository ran · our draft was wrong no licence file found · pointer only · d6ddabf253abd0c6 · report
nonlinearity kakaobrain/leco/sample_factory/algorithms/appo/intrinsic.py official repository ran · our draft was wrong no licence file found · pointer only · be8197cbc393893b · report
update_params_by_adam kakaobrain/leco/sample_factory/algorithms/appo/intrinsic.py official repository ran · our draft was wrong no licence file found · pointer only · 5525927097201875 · report
update_params_by_adamw kakaobrain/leco/sample_factory/algorithms/appo/intrinsic.py official repository ran · our draft was wrong no licence file found · pointer only · 8a8aaef31d1b40ec · report
update_params_by_rms kakaobrain/leco/sample_factory/algorithms/appo/intrinsic.py official repository ran · our draft was wrong no licence file found · pointer only · a17d8608a786ddd1 · report
update_params_by_sgd kakaobrain/leco/sample_factory/algorithms/appo/intrinsic.py official repository ran · our draft was wrong no licence file found · pointer only · fa95d51044e04fc8 · report
CellCounterWrapper kakaobrain/leco/sample_factory/algorithms/appo/intrinsic.py official repository unverified no licence file found · pointer only · e735ccc6ba1315d0 · report
LirPG kakaobrain/leco/sample_factory/algorithms/appo/intrinsic.py official repository unverified no licence file found · pointer only · 273dee399d8182f7 · report
RND kakaobrain/leco/sample_factory/algorithms/appo/intrinsic.py official repository unverified no licence file found · pointer only · 04c8ad4bbc8ab86b · report

Tasks

Efficient Explorationreinforcement-learning

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections