Home › Code › conjugate_gradients

conjugate_gradients

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

conjugate_gradients appears in the code Syntology harvested for 7 papers, as 6 distinct code bodies found in 8 places (a place is one code body under one paper). At least one of them ran in 4 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 conjugate_gradients 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 2 of the 6 distinct code bodies named conjugate_gradients; 4 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
1ran · fixture could not drive it
1ran
4unverified
0fingerprinted

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

7 papers shown of 7, newest first; 8 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; 1 papers have no page here and are shown by arXiv id only. 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
SHAPO: Sharpness-Aware Policy Optimization for Safe Exploration added by Syntology 2026-06 (from id) montrealrobotics/shapo/safepo/single_agent/shapo.py 66ed7b1d9ea7acbc unverified Apache-2.0 (permissive)
Learning from Imperfect Demonstrations from Agents with Varying Dynamics 10 Mar 2021 Stanford-ILIAD/Learn-Imperfect-Varying-Dynamics/trpo.py 918891131c62a121 ran · fixture could not drive it MIT (permissive)
Stable Policy Optimization via Off-Policy Divergence Regularization 9 Mar 2020 facebookresearch/ppo-dice/trpo/opt.py 918891131c62a121 ran · fixture could not drive it MIT (permissive)
Constrained Policy Optimization 30 May 2017 sapanachaudhary/pytorch-cpo/algos/cpo.py aad2ffc14dc1c396 unverified MIT (permissive)
Photo-Realistic Single Image Super-Resolution Using a Generative Adversarial Network 15 Sep 2016 shirsenduhalder/SRResGAN-Improved-Perceptual/basic_utils.py 2d594866e7355287 unverified MIT (permissive)
Trust Region Policy Optimization 19 Feb 2015 identical code first harvested elsewhere 918891131c62a121 ran · fixture could not drive it licence of this copy not recorded
Trust Region Policy Optimization 19 Feb 2015 Khrylx/PyTorch-RL/core/trpo.py 8946170b041be61b unverified MIT (permissive)
arXiv:aaai_16817 Akella17/Deep-Bayesian-Quadrature-Policy-Optimization/optimization.py ac81cfb2bd5616e5 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 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