Aaron Courville, Philip Bachman, Devon Hjelm, Max Schwarzer, Ankesh Anand, Rishab Goel
1 of 2 samples (functions and classes) lifted from this paper's linked repositories executed on a synthesized input in Syntology's jail (0 of them constructed an object rather than computing a result; 1 honoured the contract we drafted, 0 violated it and 0 have no contract verdict; 0 failures of our instrument; 1 no recorded run), measured 2026-11-21; bodies inline only under a permissive licence as GitHub detects it. Not a reproduction of the paper's results.
"Ran" means the function executed on a synthesized input and returned a value. It is not a reproduction of the paper's results. This record, dated, as JSON: /api/ran/2007.05929.json · badge: /api/ran/2007.05929.svg
Each repository's role is a label: a classifier's output recorded on the link, or, where no role is recorded, what the Papers with Code archive marked. The line under it names its basis. Neither says who wrote the code.
| Repository | Role | Ran |
|---|---|---|
| mila-iqia/spr | canonical (classifier label) classifier basis: census |
1 ran · 1 no recorded run |
| Function | Status | Where it lives |
|---|---|---|
| calculate_accuracy | Ran ran, honoured the contract we drafted |
mila-iqia/spr/src/utils.py code served (permissive licence) · get_code("33a582f5c65e69d0") How it ranRan in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1) and returned Tensor, ndim 0, dtype family float, shape () as a later run recorded it. The image it ran in was not recorded. If your copy returns the same type, ndim and shape on these inputs, it matched what we observed; nothing here checks that. It does NOT mean the output is correct: nothing has compared it to the paper.
|
| fig2data | Not yet run unverified (harvested, no recorded run) |
mila-iqia/spr/src/utils.py code served (permissive licence) · get_code("01ea1c18cea4f892") How it ranno invocation recorded. |
Of 2 samples lifted from this paper's linked repositories, 2 carry a function identity and 0 do not. Of the 2 distinct functions with an identity, 2 are also present in other papers whose code we hold (2 with at least one paper dated earlier, 1 the same month, 1 later) and 0 are only here among the 52,977 papers whose code Syntology holds (as of 2026-09-26).
Only here means: among the 52,977 papers whose code Syntology holds (51,887 with lifted samples, 1,090 through their assemblies only), as of 2026-09-26, no other paper's lifted samples or current assembly bricks contain an identical function body after normalisation.
| Function | Also present in | Earliest-dated | Others named |
|---|---|---|---|
| fig2data | 8 other papers 1 dated earlier, 7 later |
1806.09045 (2018-06) Variational Wasserstein Clustering |
2106.01954 (2021-06) Do Neural Optimal Transport Solvers Work? A Continuous Wasserstein-2 Benchmark 2201.12220 (2022-01) Neural Optimal Transport and 5 more not named here |
| calculate_accuracy | 2 other papers 1 dated earlier, 1 the same month |
1906.08226 (2019-06) Unsupervised State Representation Learning in Atari |
2007.16041 (2020-07) Whole MILC: generalizing learned dynamics across tasks, datasets, and populations |
Presence, not direction: an identical function body in two papers' repositories does not say who wrote it, which came from which, or that either paper's method rests on it. Matching is exact after normalisation, so a renamed or edited function is not matched. Dates are when papers appeared, not when code was written. Only .py files the harvester lifted are covered; notebooks are not read. A new-style arXiv id YYMM.NNNN dates a paper to the month 20YY-MM; otherwise Paper.year dates it to the year; otherwise it is undated. Dates are when the paper appeared, not when the code was written. Read 2026-11-21.
Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.
While deep reinforcement learning excels at solving tasks where large amounts of data can be collected through virtually unlimited interaction with the environment, learning from limited interaction remains a key challenge. We posit that an agent can learn more efficiently if we augment reward maximization with self-supervised objectives based on structure in its visual input and sequential interaction with the environment. Our method, Self-Predictive Representations (SPR), trains an agent to predict its own latent state representations multiple steps into the future. We compute target representations for future states using an encoder which is an exponential moving average of the agent's parameters and we make predictions using a learned transition model. On its own, this future prediction objective outperforms prior methods for sample-efficient deep RL from pixels. We further improve performance by adding data augmentation to the future prediction loss, which forces the agent's representations to be consistent across multiple views of an observation. Our full self-supervised objective, which combines future prediction and data augmentation, achieves a median human-normalized score of 0.415 on Atari in a setting limited to 100k steps of environment interaction, which represents a 55% relative improvement over the previous state-of-the-art. Notably, even in this limited data regime, SPR exceeds expert human scores on 7 out of 26 games. We've made the code associated with this work available at https://github.com/mila-iqia/spr.
The same record, over MCP at https://syntology.ai/mcp:
get_harvested_code_for_paper("2007.05929")
get_code_for_paper("2007.05929")
have("2007.05929")
The run record, dated, one paper per request, free:
curl https://syntology.ai/api/ran/2007.05929.json
A badge for a README (the split and the date, never a ratio):
[](https://syntology.ai/paper/2007.05929)
Connect an agent — have() is free.