Papers › Unsupervised State Representation Learning in Atari

Unsupervised State Representation Learning in Atari

19 Jun 2019NeurIPS 2019 12arXiv:1906.08226archive 2025-07-28

Ankesh Anand, Evan Racah, Sherjil Ozair, Yoshua Bengio, Marc-Alexandre Côté, R. Devon Hjelm

State representation learning, or the ability to capture latent generative factors of an environment, is crucial for building intelligent agents that can perform a wide variety of tasks. Learning such representations without supervision from rewards is a challenging open problem. We introduce a method that learns state representations by maximizing mutual information across spatially and temporally distinct features of a neural encoder of the observations. We also introduce a new benchmark based on Atari 2600 games where we evaluate representations based on how well they capture the ground truth state variables. We believe this new framework for evaluating representation learning models will be crucial for future representation learning research. Finally, we compare our technique with other state-of-the-art generative and contrastive representation learning methods. The code associated with this work is available at https://github.com/mila-iqia/atari-representation-learning

PaperPDFConference PDFCodeCode 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="1906.08226")

Code

Syntology Ran 3 of 10 code samples harvested from 4 repositories linked to this paper; 7 have no recorded run. Of those that ran: 2 ran · honoured contract; 1 ran · fixture could not drive it.

By repository: official repository: 1 sample from 1 repository, 0 ran; community (archive-listed): 9 samples from 3 repositories, 3 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

mila-iqia/atari-representation-learning officialmentioned in papermentioned on GitHubpytorch report
GabrielAlacchi/atari-ari-extensions mentioned on GitHubpytorch report
ankeshanand/atari-representation-learning mentioned on GitHubpytorchMIT report
k4ntz/oc_atari mentioned on GitHubMIT report
mengli11235/dim-ua mentioned on GitHubpytorch report
mengli11235/mst_dim mentioned on GitHubpytorchMIT report
opendilab/DI-engine mentioned 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; 3 ran; 2 honoured the contract we drafted; 7 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.

2ran · honoured contract
1ran · fixture could not drive it
7unverified

Licence: 0 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 4 repositories linked to this paper, official or community; each sample names its own and says which. “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.

ram2label mila-iqia/atari-representation-learning/atariari/benchmark/wrapper.py official repository unverified MIT (permissive) · 030e6f81007d1713 · report
calculate_accuracy mengli11235/dim-ua/atariari/methods/utils.py community (archive-listed) ran · honoured contract fingerprinted MIT (permissive) · 33a582f5c65e69d0 · report
calculate_multiclass_accuracy mengli11235/dim-ua/atariari/methods/utils.py community (archive-listed) ran · honoured contract MIT (permissive) · ac47f2a9466c063d · report
calculate_multiclass_f1_score mengli11235/dim-ua/atariari/methods/utils.py community (archive-listed) ran · fixture could not drive it MIT (permissive) · 729c53ca6081bb07 · report
compute_cov_a mengli11235/mst_dim/a2c_ppo_acktr/algo/kfac.py community (archive-listed) unverified MIT (permissive) · 6aff48ec0d1463e1 · report
compute_cov_g mengli11235/mst_dim/a2c_ppo_acktr/algo/kfac.py community (archive-listed) unverified MIT (permissive) · d9fd61d47e236b09 · report
find_checkpoint mengli11235/mst_dim/visualize.py community (archive-listed) unverified MIT (permissive) · 7c1ee3a75ad60f87 · report
majority_baseline ankeshanand/atari-representation-learning/atariari/methods/majority.py community (archive-listed) unverified MIT (permissive) · 78832d905c5c1834 · report
summarize mengli11235/mst_dim/visualize.py community (archive-listed) unverified MIT (permissive) · 8c0759e56e428dd0 · report
summarize_by_cat mengli11235/mst_dim/visualize.py community (archive-listed) unverified MIT (permissive) · eb759f58e5c72c18 · report

Tasks

Atari GamesRepresentation Learning

Datasets

Introduced by this paper, per the archive.

AtariARI

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