Papers › Unifying Count-Based Exploration and Intrinsic Motivation

Unifying Count-Based Exploration and Intrinsic Motivation

6 Jun 2016NeurIPS 2016 12arXiv:1606.01868archive 2025-07-28

Marc G. Bellemare, Sriram Srinivasan, Georg Ostrovski, Tom Schaul, David Saxton, Remi Munos

We consider an agent's uncertainty about its environment and the problem of generalizing this uncertainty across observations. Specifically, we focus on the problem of exploration in non-tabular reinforcement learning. Drawing inspiration from the intrinsic motivation literature, we use density models to measure uncertainty, and propose a novel algorithm for deriving a pseudo-count from an arbitrary density model. This technique enables us to generalize count-based exploration algorithms to the non-tabular case. We apply our ideas to Atari 2600 games, providing sensible pseudo-counts from raw pixels. We transform these pseudo-counts into intrinsic rewards and obtain significantly improved exploration in a number of hard games, including the infamously difficult Montezuma's Revenge.

PaperPDFConference PDFCode

In Syntology View this paper on Syntology, its page in Syntology's graph. That page 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

RLAgent/state-marginal-matching mentioned on GitHubpytorchSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Curiosity-driven Exploration by Self-supervised Prediction (arXiv:1705.05363; that paper's own run record: 16 ran (of which 9 constructed an object rather than computing a result; 13 with no instrument failure: 1 honoured, 1 violated, 11 with no contract checked; 3 where Syntology's instrument failed) · 16 unverified); nothing checks that they implement this paper's method. 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.

A paper named beside a repository with no sample linked to this paper is shown with that paper's own run record, not this paper's: “ran” means executed on a synthesized input, not that the code is correct, and “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Papers are listed in arXiv-id order, at most three per repository.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Tasks

Atari GamesMontezuma's RevengeReinforcement LearningReinforcement Learning (RL)reinforcement-learning

Results from the paper archive 2025-07-28

TaskDatasetModelMetricValueRank at snapshotLeaderboardReport
Atari Games Atari 2600 Freeway A3C-CTS Score 30.48 #32 of 59 Archive leaderboard report
Atari Games Atari 2600 Gravitar A3C-CTS Score 238.68 #49 of 53 Archive leaderboard report
Atari Games Atari 2600 Montezuma's Revenge DDQN-PC Score 3459 #10 of 50 Archive leaderboard report
Atari Games Atari 2600 Montezuma's Revenge A3C-CTS Score 273.7 #23 of 50 Archive leaderboard report
Atari Games Atari 2600 Private Eye A3C-CTS Score 99.32 #46 of 52 Archive leaderboard report
Atari Games Atari 2600 Venture A3C-CTS Score 0.0 #50 of 55 Archive leaderboard report

Ranks are positions in the archive's leaderboards as they stood at the 2025-07-28 snapshot. Results published since then are not among these rows, so a rank here is not a current standing.

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