Home › Code › wrap_deepmind

wrap_deepmind

Syntologyentry name in harvested code

Syntology's record for this page has not changed since , the first build that kept a record date for it; when this build read Syntology's graph is in the build record.

wrap_deepmind appears in the code Syntology harvested for 17 papers, as 17 distinct code bodies found in 17 places (a place is one code body under one paper). Of the 17 papers, 5 with a sample that ran: 5 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 wrap_deepmind 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 17 distinct code bodies named wrap_deepmind: 5 ran (of which 0 constructed an object rather than computing a result; 5 with no instrument failure: 0 honoured, 0 violated, 5 with no contract checked; 0 where Syntology's instrument failed) · 12 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:

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

Licence is a property of each copy, so it is counted per place: 3 of the 17 places are 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

17 papers shown of 17, newest first; 17 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. 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
Q-Star Meets Scalable Posterior Sampling: Bridging Theory and Practice via HyperAgent 5 Feb 2024 szrlee/hyperagent/hyperagent/env/atari_wrapper.py f407a5134f319b52 unverified MIT (permissive)
Towards Optimal Adversarial Robust Q-learning with Bellman Infinity-error 3 Feb 2024 leoranlmia/CAR-DQN/IBP/environment.py 508c40d489d9c3f9 unverified no licence file found · pointer only
Memory-efficient Reinforcement Learning with Value-based Knowledge Consolidation 22 May 2022 qlan3/MeDQN/envs/wrapper.py 9f5ed411ced90230 unverified MIT (permissive)
Human-Level Control through Directly-Trained Deep Spiking Q-Networks 13 Dec 2021 aptx395/deep-spiking-q-networks/environment/atari_wrappers.py 2dc1687fabf93833 unverified MIT (permissive)
Time Discretization-Invariant Safe Action Repetition for Policy Gradient Methods 6 Nov 2021 artberryx/SAR/sb/stable_baselines/common/atari_wrappers.py 3833ca08c133f805 ran MIT (permissive)
Dual Policy Distillation 7 Jun 2020 kiminh/dual-policy-distillation/baselines/common/atari_wrappers.py 2475b5dbc5a1fb09 unverified MIT recorded; this copy not marked cleared · pointer only
LaProp: Separating Momentum and Adaptivity in Adam 12 Feb 2020 Z-T-WANG/LaProp-Optimizer/rainbow/common/wrappers.py 34023060eaec34a2 ran MIT (permissive)
ZPD Teaching Strategies for Deep Reinforcement Learning from Demonstrations 26 Oct 2019 RevanMacQueen/LearningFromHumans/lfh/envs/atari.py bfecf5132a09da6a ran MIT (permissive)
Soft Actor-Critic for Discrete Action Settings 16 Oct 2019 p-christ/Deep-Reinforcement-Learning-Algorithms-with-PyTorch/environments/Atari_Environment.py f22df3c0c0b99757 unverified MIT (permissive)
Dimension-Wise Importance Sampling Weight Clipping for Sample-Efficient Reinforcement Learning 7 May 2019 seungyulhan/disc/baselines/common/atari_wrappers.py 671e38aae9f3b6ba unverified MIT recorded; this copy not marked cleared · pointer only
Object-Oriented Dynamics Learning through Multi-Level Abstraction 16 Apr 2019 mig-zh/OODP/atari_wrappers.py 30ac4ed53628dbf7 unverified MIT (permissive)
Distributed Prioritized Experience Replay 2 Mar 2018 uber-research/ape-x/atari_wrappers.py a8c33fc375f8db7e unverified Apache-2.0 (permissive)
TreeQN and ATreeC: Differentiable Tree-Structured Models for Deep Reinforcement Learning 31 Oct 2017 oxwhirl/treeqn/treeqn/utils/atari_wrapper.py 98926491a0b85ec4 ran MIT (permissive)
Neural Episodic Control 6 Mar 2017 mjacar/pytorch-nec/utils/atari_wrapper.py 8752671a3407cc09 unverified MIT (permissive)
Generative Adversarial Imitation Learning 10 Jun 2016 Techget/gail-tf-sc2/gailtf/baselines/common/atari_wrappers.py 6ad2196300b77d83 ran MIT (permissive)
Dueling Network Architectures for Deep Reinforcement Learning 20 Nov 2015 opplieam/Pong-Deep-RL/atari_wrappers.py 72ea138169370d83 unverified Apache-2.0 (permissive)
Deep Reinforcement Learning with Double Q-learning 22 Sep 2015 jihoonerd/Deep-Reinforcement-Learning-with-Double-Q-learning/ddqn/utils/atari_wrappers.py 3b5c0e5667fd4eaa unverified 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