Pith. sign in

REVIEW 2 cited by

Episodic Curiosity through Reachability

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 1810.02274 v5 pith:EBUGCSAT submitted 2018-10-04 cs.LG cs.AIcs.CVcs.ROstat.ML

classification cs.LGcs.AIcs.CVcs.ROstat.ML
keywords curiositybonusagentmemoryrewardsalgorithmscurrentdmlab
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Rewards are sparse in the real world and most of today's reinforcement learning algorithms struggle with such sparsity. One solution to this problem is to allow the agent to create rewards for itself - thus making rewards dense and more suitable for learning. In particular, inspired by curious behaviour in animals, observing something novel could be rewarded with a bonus. Such bonus is summed up with the real task reward - making it possible for RL algorithms to learn from the combined reward. We propose a new curiosity method which uses episodic memory to form the novelty bonus. To determine the bonus, the current observation is compared with the observations in memory. Crucially, the comparison is done based on how many environment steps it takes to reach the current observation from those in memory - which incorporates rich information about environment dynamics. This allows us to overcome the known "couch-potato" issues of prior work - when the agent finds a way to instantly gratify itself by exploiting actions which lead to hardly predictable consequences. We test our approach in visually rich 3D environments in ViZDoom, DMLab and MuJoCo. In navigational tasks from ViZDoom and DMLab, our agent outperforms the state-of-the-art curiosity method ICM. In MuJoCo, an ant equipped with our curiosity module learns locomotion out of the first-person-view curiosity only.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Uncertainty Prioritized Experience Replay

    cs.LG 2025-06 conditional novelty 6.0 of 10

    UPER uses ensemble-based epistemic and aleatoric uncertainty to compute an information gain priority for experience replay, outperforming TD-error prioritization on Atari-57.

  2. LLM-Guided Reinforcement Learning: Addressing Training Bottlenecks through Policy Modulation

    cs.AI 2025-05 conditional novelty 6.0 of 10

    An LLM identifies critical states, suggests corrective actions, and assigns shaped rewards to refine an existing RL policy, beating several baselines in Pong and MuJoCo.

Pith tools