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 ranMethod as code

In Syntology View this paper on Syntology, its page in Syntology's graph. That page adds which of its functions are also present in other papers' code Syntology holds, with dates, and its dated run record as JSON and a README badge. It also lists the repositories linked to the paper, the abstract and the calls for agents.

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

For agents, on Syntology's MCP service (how to connect):

Code

Syntology 10 code samples harvested from 1 repository linked to this paper: 7 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 6 where Syntology's instrument failed) · 3 unverified. Where Syntology's instrument failed: 6 where our contract draft was wrong; failures of Syntology's instrument, not of the code.

By repository: official repository: 10 samples from 1 repository, 7 ran (1 with no instrument failure; 6 where Syntology's instrument failed). The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

Levels written on 2026-09-22 (UTC): the dates Syntology's graph wrote each sample's verification level, not when the code executed.

kakaobrain/leco officialmentioned on GitHubpytorchSyntology: 10 samples, 7 ran (6 instrument-failed) · 3 unverified 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 (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 6 where Syntology's instrument failed) · 3 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Syntology's record for this page has not changed since , the first build that kept a record date for it; when this build read Syntology's graph is in the build record. That date is 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. A line beginning “fixture:” under a sample that ran gives the arguments Syntology's fixture called the sample with, each as name:type/rank/element kind (? where none was recorded), and the type of what the fixture's run returned, exactly as the harness recorded them; the arguments and the returned type were recorded by two separate runs of the same fixture. No output value is shown, and a returned type says nothing about whether the output was right. “Level recorded” gives the UTC date when Syntology's graph wrote the sample's verification level, not when the code executed; where the level was written before Syntology's graph kept that date, the row says “level recorded, date not recorded”. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself. “Our draft was wrong” and “the contract check could not run” are failures of Syntology's instrument, not of the code: the sample ran on Syntology's synthesized input, and then the drafted contract did not describe it, or the check itself raised an error (RAISES), lacked a dependency (DEP_MISSING) or ran out of time (TIMEOUT); hover the label for which. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.

Each sample ends with its code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (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 are grouped by repository: a repository marked official first, then by how directly the repository is tied to the paper, then in the archive's order; never by how many ran. 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 six 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; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is cleared, but the stored copy of the same code that Syntology serves is not. 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.

A function or class name links to its page when the name occurs in the harvested code of at least 5 papers; the name is a string, not an identity. A census tag appears when Syntology's census ran implementations with that name on one shared input per bucket: it gives how many were compared, from how many papers, and how many distinct outputs they produced, and names this sample's bucket when this sample was one of them.

kakaobrain/leco official repository 10 samples, 7 ran (6 instrument-failed) · 3 unverified
AttrDict in 5 papers sample_factory/algorithms/appo/intrinsic.py ran no licence file found · pointer only · 992553c7fdf8d531 · report fixture: returned AttrDict · level recorded 2026-09-22
get_obs_shape sample_factory/algorithms/appo/intrinsic.py ran · our draft was wrong no licence file found · pointer only · d6ddabf253abd0c6 · report fixture: signature obs_space:Dict/0/None · returned AttrDict · level recorded 2026-09-22
nonlinearity in 140 papers
census: 4 implementations from 11 papers, 1 distinct output on one shared input
sample_factory/algorithms/appo/intrinsic.py ran · our draft was wrong no licence file found · pointer only · be8197cbc393893b · report fixture: signature cfg:Config/0/? · returned ELU · level recorded 2026-09-22
update_params_by_adam sample_factory/algorithms/appo/intrinsic.py ran · our draft was wrong no licence file found · pointer only · 5525927097201875 · report fixture: signature params:dict/0/?, grads:list/1/Tensor, optim:AdamW/0/?, lr:NoneType/0/? · returned OrderedDict · level recorded 2026-09-22
update_params_by_adamw sample_factory/algorithms/appo/intrinsic.py ran · our draft was wrong no licence file found · pointer only · 8a8aaef31d1b40ec · report fixture: signature params:dict/0/?, grads:list/1/Tensor, optim:AdamW/0/?, lr:NoneType/0/?, use_adam:bool/0/bool · returned OrderedDict · level recorded 2026-09-22
update_params_by_rms sample_factory/algorithms/appo/intrinsic.py ran · our draft was wrong no licence file found · pointer only · a17d8608a786ddd1 · report fixture: signature params:dict/0/?, grads:list/1/Tensor, optim:MockRMSprop/0/?, lr:NoneType/0/? · returned OrderedDict · level recorded 2026-09-22
update_params_by_sgd sample_factory/algorithms/appo/intrinsic.py ran · our draft was wrong no licence file found · pointer only · fa95d51044e04fc8 · report fixture: signature params:dict/0/?, grads:list/1/Tensor, optim:NoneType/0/?, lr:float/0/float · returned OrderedDict · level recorded 2026-09-22
CellCounterWrapper sample_factory/algorithms/appo/intrinsic.py unverified no licence file found · pointer only · e735ccc6ba1315d0 · report
LirPG sample_factory/algorithms/appo/intrinsic.py unverified no licence file found · pointer only · 273dee399d8182f7 · report
RND in 5 papers sample_factory/algorithms/appo/intrinsic.py unverified no licence file found · pointer only · 04c8ad4bbc8ab86b · report

Method as code Syntology

What Syntology's graph records as this paper's claimed method, lifted into code: each assembly names its bricks (functions and classes), each with its own role and its own verification level. An assembly is not a check that the code implements the method correctly or reproduces the paper's results. Levels are each brick's own verification level in Syntology's graph (level 0: no recorded run), listed brick by brick and never combined into one level; “ran” means the brick executed on a synthesized input, not that its output is correct, and the instrument figure counts failures of Syntology's instrument, not of the code. Where a model read the code against the paper's claim, each assembly's label verdict is one model's judgement, kept in this page's JSON twin; it is not calibrated, so no card prints it.

1 assembly on this paper: 1 harvested, 0 generated.

harvested Assembly for LECO (graph method: LECO). 10 bricks; individually on a fixture: 7 ran (of which 1 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 6 where Syntology's instrument failed) · 3 unverified. The assembly has not been run end-to-end.

  1. CellCounterWrapper entry · level 0 · unverified · e735ccc6ba1315d0
  2. AttrDict helper · level 1 · ran · 992553c7fdf8d531
  3. LirPG helper · level 0 · unverified · 273dee399d8182f7
  4. RND helper · level 0 · unverified · 04c8ad4bbc8ab86b
  5. nonlinearity helper · level 1 · ran · our draft was wrong · be8197cbc393893b
  6. update_params_by_adam helper · level 1 · ran · our draft was wrong · 5525927097201875
  7. update_params_by_adamw helper · level 1 · ran · our draft was wrong · 8a8aaef31d1b40ec
  8. update_params_by_rms helper · level 1 · ran · our draft was wrong · a17d8608a786ddd1
  9. update_params_by_sgd helper · level 1 · ran · our draft was wrong · fa95d51044e04fc8
  10. get_obs_shape helper · level 1 · ran · our draft was wrong · d6ddabf253abd0c6

Each brick ends with its code_sha256, Syntology's identity for that exact code; click one to copy the get_code call that returns it. For agents, on Syntology's MCP service: assembly(arxiv_id="2210.05409") returns these assemblies with each brick's role and wiring (how to connect).

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