SYNTOLOGY HomeExplorerAtlasCodeMethodologyAboutDevelopersFeedPricing
Paper · 1802.04821 · 2018

Evolved Policy Gradients

arXiv · PDF · Open in the Atlas

Code that ran

6 of 6 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 3 have no contract verdict; 2 failures of our instrument; 0 no recorded run); 1 of them was also run on the host, not in the jail, by the peer-agreement lane that set its level, measured 2026-11-22; repository links from the Papers with Code archive attributed under CC BY-SA, no affiliation; 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/1802.04821.json · badge: /api/ran/1802.04821.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.

RepositoryRoleRan
openai/EPG canonical (classifier label)
classifier basis: classifier_2025
2 ran · 0 no recorded run
victcebesp/Booster-Evolved-Policy-Gradient community (classifier label)
classifier basis: plan_row
4 ran · 0 no recorded run
FunctionStatusWhere it lives
flatten Ran
ran, honoured the contract we drafted
victcebesp/Booster-Evolved-Policy-Gradient/epg/viskit/core.py
pointer only (licence: MIT) · get_code("20922c79a0929bbf")
How it ran

The body of this sample is withheld: MIT, as GitHub detects it on this paper's repository, victcebesp/Booster-Evolved-Policy-Gradient, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

gamma_expand Ran
ran on a synthesized input
victcebesp/Booster-Evolved-Policy-Gradient/epg/utils.py
pointer only (licence: MIT) · get_code("22ce513fe6d2b13e")
How it ran

The body of this sample is withheld: MIT, as GitHub detects it on this paper's repository, victcebesp/Booster-Evolved-Policy-Gradient, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

get_dims Ran
ran on a synthesized input
victcebesp/Booster-Evolved-Policy-Gradient/epg/utils.py
pointer only (licence: MIT) · get_code("b16faabc1615be78")
How it ran

The body of this sample is withheld: MIT, as GitHub detects it on this paper's repository, victcebesp/Booster-Evolved-Policy-Gradient, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

load_progress Ran
ran on a synthesized input
victcebesp/Booster-Evolved-Policy-Gradient/epg/viskit/core.py
pointer only (licence: MIT) · get_code("462821d355e6e526")
How it ran

The body of this sample is withheld: MIT, as GitHub detects it on this paper's repository, victcebesp/Booster-Evolved-Policy-Gradient, is in the permissive set, but a licence decision keeps the body a pointer: the reason for that decision is not recorded with it. The setup block that called it is withheld with it, because it is written against that body. source_path and origin say where the code lives, to read under the repository's own terms. A run is recorded.

sliding_mean Ran
ran; the contract check could not run (RAISES, DEP_MISSING or TIMEOUT)
openai/EPG/epg/viskit/frontend.py
code served (permissive licence) · get_code("40f81b1d5f51ea76")
How it ran

Ran in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1) and returned ndarray, ndim 1, dtype family float, shape (8,) 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.

import numpy as np

# Construct a small data array for testing
data_array = np.array([1.0, 2.0, 3.0, 4.0, 5.0, 6.0, 7.0, 8.0])

# Define the arguments dictionary
ARGS = {
    "data_array": data_array,
    "window": 5
}
Setup block drafted by
a language model, Claude Haiku 4.5, prompt python_fixture_v1
Imports
numpy — import names as written, not package names to install; a name the repository itself provides is not a package
Returned
type ndarray, ndim 1, dtype family float, shape (8,) — shape (8,) as a later run recorded it
dtype family
int means an integer dtype; float means any other dtype the instrument saw, bool and complex included (fixture_check.py records only these two families)
Environment
image not recorded; re-verify against syntology-harvest-sandbox:v5-deps; not recorded for this sample: the harness installs a cuda-to-cpu shim (cuda_shim.py) before every sample and no run records whether a sample needed it; seed: none by the harness; any seed is in the setup block
unique Ran
ran; our contract draft was wrong, not the code
openai/EPG/epg/viskit/frontend.py
code served (permissive licence) · get_code("6c7a4a9349a395e9")
How it ran

Ran in Syntology's sandbox on this synthesized input (drafted by a language model, Claude Haiku 4.5, prompt python_fixture_v1) and returned list, ndim 1, dtype family int; no output shape is stated. The image it ran in was not recorded. If your copy returns the same type and ndim 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.

import torch
import numpy as np

torch.manual_seed(0)

# The function `unique(l)` takes a list and returns unique elements
# It converts the list to a set and back to a list
# So we need to pass a list with some duplicate elements

ARGS = {
    "l": [1, 2, 3, 2, 1, 4, 3, 5]
}
Setup block drafted by
a language model, Claude Haiku 4.5, prompt python_fixture_v1
Imports
numpy, torch — import names as written, not package names to install; a name the repository itself provides is not a package
Returned
type list, ndim 1, dtype family int — a list output has no array shape of its own; none is stated
dtype family
int means an integer dtype; float means any other dtype the instrument saw, bool and complex included (fixture_check.py records only these two families)
Environment
image not recorded; re-verify against syntology-harvest-sandbox:v5-deps; not recorded for this sample: the harness installs a cuda-to-cpu shim (cuda_shim.py) before every sample and no run records whether a sample needed it; seed: none by the harness; any seed is in the setup block

Also present in other papers' code

Of 6 samples lifted from this paper's linked repositories, 6 carry a function identity and 0 do not. Of the 6 distinct functions with an identity, 3 are also present in other papers whose code we hold (1 with at least one paper dated earlier, 0 the same month, 3 later) and 3 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.

FunctionAlso present inEarliest-datedOthers named
flatten 21 other papers
1 dated earlier, 20 later
1609.08675 (2016-09)
YouTube-8M: A Large-Scale Video Classification Benchmark
1811.05014 (2018-11)
NeXtVLAD: An Efficient Neural Network to Aggregate Frame-level Features for Large-scale Video Classification
1911.03070 (2019-11)
Interactive Refinement of Cross-Lingual Word Embeddings
and 18 more not named here
unique 5 other papers
5 later
2006.04779 (2020-06)
Conservative Q-Learning for Offline Reinforcement Learning
2007.09070 (2020-07)
Hybrid Discriminative-Generative Training via Contrastive Learning
2210.06518 (2022-10)
Semi-Supervised Offline Reinforcement Learning with Action-Free Trajectories
and 2 more not named here
sliding_mean 2 other papers
2 later
2006.04779 (2020-06)
Conservative Q-Learning for Offline Reinforcement Learning
2007.09070 (2020-07)
Hybrid Discriminative-Generative Training via Contrastive Learning

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-22.

Repositories linked to this paper

Some links come from the archived Papers with Code dataset (CC BY-SA 4.0): attribution and licence.

Abstract

We propose a metalearning approach for learning gradient-based reinforcement learning (RL) algorithms. The idea is to evolve a differentiable loss function, such that an agent, which optimizes its policy to minimize this loss, will achieve high rewards. The loss is parametrized via temporal convolutions over the agent's experience. Because this loss is highly flexible in its ability to take into account the agent's history, it enables fast task learning. Empirical results show that our evolved policy gradient algorithm (EPG) achieves faster learning on several randomized environments compared to an off-the-shelf policy gradient method. We also demonstrate that EPG's learned loss can generalize to out-of-distribution test time tasks, and exhibits qualitatively different behavior from other popular metalearning algorithms.

For agents

The same record, over MCP at https://syntology.ai/mcp:

get_harvested_code_for_paper("1802.04821")
get_code_for_paper("1802.04821")
have("1802.04821")

The run record, dated, one paper per request, free:

curl https://syntology.ai/api/ran/1802.04821.json

A badge for a README (the split and the date, never a ratio):

[![Syntology run record](https://syntology.ai/api/ran/1802.04821.svg)](https://syntology.ai/paper/1802.04821)

Connect an agent — have() is free.