Home › Code › reward

reward

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

reward appears in the code Syntology harvested for 13 papers, as 17 distinct code bodies found in 17 places (a place is one code body under one paper). At least one of them ran in 5 of the papers; 2 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 reward 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 17 distinct code bodies named reward; 12 are unverified. One tile per status, in the site's fixed vocabulary, each code body counted once:

3ran · honoured contract
0ran · violated contract
0ran · our draft was wrong
1ran · fixture could not drive it
1ran
12unverified
2fingerprinted

Licence is a property of each copy, so it is counted per place: 10 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 “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

13 papers shown of 13, 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, and the graph's for 3 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
SAGE: Shaping Anchors for Guided Exploration in RLVR of LLMs added by Syntology 2026-05 (from id) tally0818/SAGE/src/train/rewards.py 85a2bb1a8e77c2eb ran fingerprinted no licence file found · pointer only
Near-Optimal Primal-Dual Algorithm for Learning Linear Mixture CMDPs with Adversarial Rewards added by Syntology 2026-03 (from id) kihyun-yu/pd-powers/cmdp_primal_dual_power.py b608dceacbfac8c9 ran · honoured contract fingerprinted no licence file found · pointer only
AnomaMind: Agentic Time Series Anomaly Detection with Tool-Augmented Reasoning added by Syntology 2026-02 (from id) Xiaoyu-Tao/AnomaMind-TS/src/AnomaMind/core/reward.py 5ed7ae732e853625 unverified licence not identified · pointer only
Natural Language Reinforcement Learning 21 Nov 2024 waterhorse1/natural-language-rl/nlrl/evaluate.py a2863dd7dd994a0a ran · honoured contract MIT (permissive)
Risk-Sensitive Stochastic Optimal Control as Rao-Blackwellized Markovian Score Climbing 21 Dec 2023 hanyas/psoc/psoc/environments/feedback/acrobot_env.py fb02748e906d2ebf unverified no licence file found · pointer only
Risk-Sensitive Stochastic Optimal Control as Rao-Blackwellized Markovian Score Climbing 21 Dec 2023 hanyas/psoc/psoc/environments/feedback/cartpole_env.py 793237d1ad68a705 unverified no licence file found · pointer only
Risk-Sensitive Stochastic Optimal Control as Rao-Blackwellized Markovian Score Climbing 21 Dec 2023 hanyas/psoc/psoc/environments/feedback/const_linear_env.py 7e7dcbf5a8571d7c unverified no licence file found · pointer only
Risk-Sensitive Stochastic Optimal Control as Rao-Blackwellized Markovian Score Climbing 21 Dec 2023 hanyas/psoc/psoc/environments/feedback/double_pendulum_env.py 8b0f817f54e161c5 unverified no licence file found · pointer only
Solving Long-run Average Reward Robust MDPs via Stochastic Games 21 Dec 2023 mehrdad76/rmdp-lra/contamination.py 8627a3a38478b85f unverified no licence file found · pointer only
Identifiability and Generalizability in Constrained Inverse Reinforcement Learning 1 Jun 2023 andrschl/cirl/algs/cirl.py c6f978bd33eadfed unverified MIT (permissive)
Optimistic Whittle Index Policy: Online Learning for Restless Bandits 30 May 2022 lily-x/online-rmab/src/uc_whittle.py c26495f6372f08b3 ran · honoured contract MIT (permissive)
Multi-objective Pointer Network for Combinatorial Optimization 25 Apr 2022 gaoly/mopn/MOPN_type1_obj2/tasks/motsp.py c284ef1374f699e8 unverified no licence file found · pointer only
Learning to Incentivize Other Learning Agents 10 Jun 2020 011235813/lio/lio/alg/lio_ac.py fb4097e566da6fc0 unverified MIT (permissive)
Learning Permutations with Sinkhorn Policy Gradient 18 May 2018 pemami4911/sinkhorn-policy-gradient.pytorch/envs/mwm2D_task.py fbcc4ff1d7572f35 unverified BSD-3-Clause (permissive)
Reinforcement Learning for Solving the Vehicle Routing Problem 12 Feb 2018 ajayn1997/RL-VRP-PtrNtwrk/Tasks/vrp.py 8c63c20097bd4bce ran · fixture could not drive it no licence file found · pointer only
Neural Combinatorial Optimization with Reinforcement Learning 29 Nov 2016 pemami4911/neural-combinatorial-rl-pytorch/sorting_task.py da119d24707d7943 unverified MIT (permissive)
Neural Combinatorial Optimization with Reinforcement Learning 29 Nov 2016 pemami4911/neural-combinatorial-rl-pytorch/tsp_task.py 570a2842c2ff2ab8 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 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