Home › Code › init_optimizer

init_optimizer

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.

init_optimizer appears in the code Syntology harvested for 11 papers, as 11 distinct code bodies found in 11 places (a place is one code body under one paper). Of the 11 papers, 11 with a sample that ran: 6 with a run with no instrument failure, 5 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 init_optimizer 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 init_optimizer: 11 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 5 where Syntology's instrument failed) · 0 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
5ran · our draft was wrong
0ran; the contract check could not run
6ran
0unverified
0fingerprinted

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

11 papers shown of 11, 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 1 papers added by Syntology; 1 papers have no page here and are shown by their id only (arXiv: for an arXiv id; an id from another venue, such as ACL Anthology or AAAI, is named as that venue's id, never as an arXiv id). 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
Diffusion Models Preferentially Memorize Prototypical Examples or: Why Does My Diffusion Model Love Slop? added by Syntology 2026-05 (from id) martaaparod/memorization-in-diffusion-models/diffusion_rhm/init.py bf5065959dbc94ef ran · our draft was wrong BSD-3-Clause (permissive)
ShortcutProbe: Probing Prediction Shortcuts for Learning Robust Models 20 May 2025 gtzheng/ShortcutProbe/algorithms/shortcut_probe.py ad87b4581c72eb68 ran · our draft was wrong no licence file found · pointer only
Trap-MID: Trapdoor-based Defense against Model Inversion Attacks 13 Nov 2024 ntuaislab/Trap-MID/utils.py 4fb95eae17ae047f ran MIT (permissive)
Hierarchies of Reward Machines 31 May 2022 ertsiger/hrm-learning/src/reinforcement_learning/ihsa_hrl_dqn_algorithm.py b9729dcc17bf5a29 ran MIT (permissive)
Canonical 3D Deformer Maps: Unifying parametric and non-parametric methods for dense weakly-supervised category reconstruction 28 Aug 2020 facebookresearch/c3dm/c3dm/experiment.py fcaeb3c24d287242 ran MIT recorded; this copy not marked cleared · pointer only
C3DPO: Canonical 3D Pose Networks for Non-Rigid Structure From Motion 5 Sep 2019 facebookresearch/c3dpo_nrsfm/experiment.py 7fe913d0a64673bf ran · our draft was wrong MIT (permissive)
Semantics-Aligned Representation Learning for Person Re-identification 30 May 2019 microsoft/Semantics-Aligned-Representation-Learning-for-Person-Re-identification/torchreid/optimizers.py 8f45a875ca759c55 ran MIT (permissive)
Disentangling by Factorising 16 Feb 2018 mmrl/disent-and-gen/src/training/loss.py 7c1f2ad3c96fb760 ran · our draft was wrong MIT (permissive)
Detecting Text in Natural Image with Connectionist Text Proposal Network 12 Sep 2016 zhaobomin/pytorch-ocr/train_ctpn.py 99b4d1927696d2e8 ran · our draft was wrong no licence file found · pointer only
Performance Measures and a Data Set for Multi-Target, Multi-Camera Tracking 6 Sep 2016 adhirajghosh/rptm_reid/model/optimizers.py d7a1ddf6df1db746 ran MIT (permissive)
ACL Anthology id 2023.findings-ijcnlp.4 brightjade/PRiSM/utils.py a7c148d70a285771 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