Home › Code › select_action

select_action

Syntologyentry name in harvested coderead from the graph 2026-09-24

select_action appears in the code Syntology harvested for 22 papers, as 20 distinct code bodies found in 24 places (a place is one code body under one paper). At least one of them ran in 7 of the papers; 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 select_action 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; the graph at syntology.ai holds them. "Ran" means executed on a synthesized fixture, not that the code is correct or reproduces a paper.

Samples Syntology

Syntology ran 5 of the 20 distinct code bodies named select_action; 15 are unverified. 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
3ran · fixture could not drive it
2ran
15unverified
0fingerprinted

Licence is a property of each copy, so it is counted per place: 8 of the 24 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 “fixture could not drive it” 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.

Papers

22 papers shown of 22, newest first; 24 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 1 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, 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.

PaperDateFileStatus SyntologyLicence
ReLaTS: a Reinforcement Learning-based method for dynamically determining the coupling Time Step in multi-scale simulations of self-gravitating systems added by Syntology 2026-06 (from id) veronicasaz/RL_bridgedCluster/TrainRL.py 0d01e6f28ed555ed ran no licence file found · pointer only
AffordGrasp: In-Context Affordance Reasoning for Open-Vocabulary Task-Oriented Grasping in Clutter 2025-03 (from id) H-Freax/ThinkGrasp/realarm.py ae08b081b5d182e6 unverified MIT (permissive)
The Curse of Diversity in Ensemble-Based Exploration 7 May 2024 zhixuan-lin/ensemble-rl-discrete/ensemble_rl/agents/boot_quantile_agent.py 5eff8223ef2a7296 unverified MIT (permissive)
Tree Search-Based Policy Optimization under Stochastic Execution Delay 8 Apr 2024 davidva1/Delayed-EZ/core/utils.py 7cf8a53360f599af ran GPL-3.0 (copyleft) · pointer only
Proper Laplacian Representation Learning 16 Oct 2023 identical code first harvested elsewhere 2957ca0c26f2fc3f ran · fixture could not drive it licence of this copy not recorded
Quantum Natural Policy Gradients: Towards Sample-Efficient Reinforcement Learning 26 Apr 2023 nicomeyer96/quantum-natural-policy-gradients/utils.py 720b07b98b308694 unverified Apache-2.0 (permissive)
Deep Laplacian-based Options for Temporally-Extended Exploration 26 Jan 2023 identical code first harvested elsewhere 2957ca0c26f2fc3f ran · fixture could not drive it licence of this copy not recorded
A Machine with Short-Term, Episodic, and Semantic Memory Systems 5 Dec 2022 humemai/agent-room-env-v1/agent/dqn/utils.py 750debd5365bc34e unverified MIT (permissive)
A Machine with Short-Term, Episodic, and Semantic Memory Systems 5 Dec 2022 humemai/agent-room-env-v1/agent/ppo/utils.py 8ee60ab856ea7100 unverified MIT (permissive)
On the Feasibility of Cross-Task Transfer with Model-Based Reinforcement Learning 19 Oct 2022 mlpc-ucsd/xtra/src/core/utils.py f20a0c2687734ea6 unverified Apache-2.0 (permissive)
Understanding and Accelerating Neural Architecture Search with Training-Free and Theory-Grounded Metrics 26 Aug 2021 vita-group/tegnas/reinforce.py d76fd75b329eb07e unverified MIT (permissive)
Rapid Neural Architecture Search by Learning to Generate Graphs from Datasets 2 Jul 2021 D-X-Y/AutoDL-Projects/exps/NAS-Bench-201-algos/reinforce.py 0e6f925ca93551fa unverified MIT (permissive)
Cross-Trajectory Representation Learning for Zero-Shot Generalization in RL 4 Jun 2021 bmazoure/ctrl_public/algo.py 2ed07b9462bf332f ran · fixture could not drive it no licence file found · pointer only
Structure Mapping for Transferability of Causal Models 18 Jul 2020 Information-Fusion-Lab-Umass/causal_transfer_learning/codes/models/rl_approaches/DQN_main.py bb75366f778f682d unverified no licence file found · pointer only
A differentiable programming method for quantum control 2020-02 (from id) frankschae/A-differentiable-programming-method-for-quantum-control/qubit/reinforce/policy_gradient_qubit.py e35734bfb6c1e4ee unverified MIT (permissive)
NAS-Bench-201: Extending the Scope of Reproducible Neural Architecture Search 2 Jan 2020 D-X-Y/NAS-Projects/exps/NAS-Bench-201-algos/reinforce.py 0e6f925ca93551fa unverified MIT (permissive)
NAS-Bench-201: Extending the Scope of Reproducible Neural Architecture Search 2 Jan 2020 yoichii/nashpobench2api/bench_algos/reinforce.py 0aaac10bb2675319 unverified MIT (permissive)
Mastering Atari, Go, Chess and Shogi by Planning with a Learned Model 19 Nov 2019 dmiracle/muzero-starter/pseudocode.py fe46ed855a1faead unverified no licence file found · pointer only
Artificial Intelligence for Prosthetics - challenge solutions 7 Feb 2019 iasawseen/MultiServerRL/simple_virtual_env/client.py 17277a43a521c152 unverified MIT (permissive)
Learning when to Communicate at Scale in Multiagent Cooperative and Competitive Tasks 23 Dec 2018 IC3Net/IC3Net/action_utils.py dbf148c04f6bc762 unverified MIT (permissive)
Dopamine: A Research Framework for Deep Reinforcement Learning 14 Dec 2018 google/dopamine/dopamine/jax/agents/rainbow/rainbow_agent.py e71ad53b0a330121 unverified Apache-2.0 (permissive)
Deep Reinforcement Learning 15 Oct 2018 identical code first harvested elsewhere e71ad53b0a330121 unverified licence of this copy not recorded
Representation Balancing MDPs for Off-Policy Policy Evaluation 23 May 2018 stanfordai4hi/repbm/qlearning_cartpole.py a1999e91696fab13 ran · fixture could not drive it MIT (permissive)
Eigenoption Discovery through the Deep Successor Representation 30 Oct 2017 mklissa/dceo/dopamine/jax/agents/full_rainbow/full_rainbow_dceo.py 2957ca0c26f2fc3f ran · fixture could not drive it Apache-2.0 (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 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 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