Home › Code › run_episode

run_episode

Syntologyentry name in harvested code

Syntology's record for this page last changed ; when this build read Syntology's graph is in the build record.

run_episode appears in the code Syntology harvested for 10 papers, as 11 distinct code bodies found in 11 places (a place is one code body under one paper). Of the 10 papers, 6 with a sample that ran: 6 with a run with no instrument failure, 0 where every run was a failure of Syntology's instrument. 0 of the code bodies carry a behaviour fingerprint.

What this page is not. Routines are grouped here by the exact string of their function or class name. Nothing asserts that two samples named run_episode do the same thing, share code, or are comparable; the name is a string, not an identity. Behaviour outputs (what a fingerprinted sample returned on the shared battery) are not in this export and are not shown here; get_code(code_sha256="…") returns this sample's fingerprint on the shared battery, with the battery's shuffled null and lift; not shown on this site (how to connect). "Ran" means executed on a synthesized fixture, not that the code is correct or reproduces a paper.

Samples Syntology

The 11 distinct code bodies named run_episode: 7 ran (of which 0 constructed an object rather than computing a result; 7 with no instrument failure: 1 honoured, 1 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified. “Where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. One tile per status, in the site's fixed vocabulary, each code body counted once:

1ran · honoured contract
1ran · violated contract
0ran · our draft was wrong
0ran; the contract check could not run
5ran
4unverified
0fingerprinted

Licence is a property of each copy, so it is counted per place: 1 of the 11 places is pointer only (Syntology does not serve that copy's text). This site shows no code text for any sample; every row below links to the file in its repository where the record names one.

“Ran” means the sample executed on a synthesized input; it does not mean the output is correct. “Honoured” and “violated” refer to a contract Syntology drafted from the code itself; “our draft was wrong” and “the contract check could not run” (RAISES, DEP_MISSING or TIMEOUT; hover a row's label for which) are failures of Syntology's instrument, not of the code, and those samples did run. The ran count above is every status except unverified, the same rule as each paper page; “with no instrument failure” is honoured, violated and ran with no contract checked. A metamorphic tier, where shown, is evidence of the output's shape, not that the sample implements the method.

Papers

10 papers shown of 10, newest first; 11 places in the table. A paper with no recorded date is placed by the month its arXiv id encodes, shown in the Date column as YYYY-MM (from id). One row per place: a paper whose repository defines the name more than once appears more than once, and the same code body held for several papers appears once under each, with the same status. Titles and dates are the archive's archive 2025-07-28 for papers in the archive, and the graph's for 2 papers added by Syntology. Status and fingerprint are Syntology's record of each code body; licence is recorded for each place. The File cell ends with the code body's code_sha256. A sample's code_sha256 is Syntology's identity for that exact code. It is printed in full (16 hexadecimal characters for every sample in this build), and get_code(code_sha256="…") takes it exactly as printed. An agent calls it on Syntology's MCP service (how to connect); click an identity to copy that call.

PaperDateFileStatus SyntologyLicence
MORL-A2C: Multi-Objective Reinforcement Learning Reranker for Optimizing Healthiness in MOPI-HFRS added by Syntology 2026-06 (from id) JoshZ411/MOPI-HFRS-SLC/code/morl/training.py 5f992cad961a11bb unverified Apache-2.0 (permissive)
Scheduling That Speaks: An Interpretable Programmatic Reinforcement Learning Framework added by Syntology 2026-05 (from id) HcPlu/ProRL/optimisation/pdr/evaluate.py 948517dad8d0fdab ran · honoured contract licence not identified · pointer only
On Autonomous Agents in a Cyber Defence Environment 2023-09 (from id) ilyaorson/cyberdreamcatcher/cyberdreamcatcher/sampler.py 0b1a16f5749dcc3a ran MIT (permissive)
Learning Associative Inference Using Fast Weight Memory 16 Nov 2020 ischlag/Fast-Weight-Memory-public/metaRL/train_agent.py 83dc00c2fe9d0ac2 unverified MIT (permissive)
The NetHack Learning Environment 24 Jun 2020 Pieter-Cawood/Reinforcement-Learning/NLE_Method_Comparison/A2C_1/evaluation.py 38d19bc77768e47c unverified MIT (permissive)
Optimistic Distributionally Robust Policy Optimization 14 Jun 2020 kadysongbb/dr-trpo/tabular/train_helper.py 376d051ff6f4515b ran MIT (permissive)
Variational Adversarial Active Learning 31 Mar 2019 johntiger1/vaal_querying/rl/sample_cartpole.py baf11f4c9088b555 unverified BSD-2-Clause (permissive)
Obstacle Tower: A Generalization Challenge in Vision, Control, and Planning 4 Feb 2019 Unity-Technologies/obstacle-tower-env/examples/evaluation.py 448599b47d160e4f ran · violated contract Apache-2.0 (permissive)
Motion Planning Among Dynamic, Decision-Making Agents with Deep Reinforcement Learning 4 May 2018 mit-acl/gym-collision-avoidance/gym_collision_avoidance/experiments/src/env_utils.py 5494e1762df206ef ran MIT (permissive)
Action-depedent Control Variates for Policy Optimization via Stein's Identity 30 Oct 2017 DartML/PPO-Stein-Control-Variate/evaluation/main_algo.py fe515a034e675f33 ran MIT (permissive)
Action-depedent Control Variates for Policy Optimization via Stein's Identity 30 Oct 2017 DartML/PPO-Stein-Control-Variate/optimization/main_algo.py d65e0044847c6ca7 ran MIT (permissive)

This site shows no code text; each File cell links to the file on GitHub at the repository's current default branch, which may have changed since the harvest. "Pointer only" means Syntology does not serve that copy's text, for one of six 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; the licence is outside the permissive list Syntology serves text under (MIT, Apache-2.0, BSD and similar); this paper's copy was not located, so its licence is not recorded; or this paper's copy is under a permissive licence, but the stored copy of the same code that Syntology serves is not cleared for its text. 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 cell for the reason. Per-sample records for a paper are on its paper page under "Code Syntology ran".

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