Home › Code › get_optim

get_optim

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.

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

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

15 papers shown of 15, newest first; 15 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; 3 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
Why Does Dropping Edges Usually Outperform Adding Edges in Graph Contrastive Learning? 11 Dec 2024 hyzhang98/epagcl/Utils.py 7e94915c3b426976 ran · our draft was wrong no licence file found · pointer only
SymDiff: Equivariant Diffusion via Stochastic Symmetrisation 8 Oct 2024 leozhangML/SymDiff/qm9/models.py 85c8c5cc8774ca97 ran · our draft was wrong MIT (permissive)
CloudFixer: Test-Time Adaptation for 3D Point Clouds via Diffusion-Guided Geometric Transformation 23 Jul 2024 shimazing/CloudFixer/diffusion/build_model.py f00fffed990205f4 ran MIT (permissive)
A Simple Latent Diffusion Approach for Panoptic Segmentation and Mask Inpainting 18 Jan 2024 segments-ai/latent-diffusion-segmentation/ldmseg/trainers/optim.py 285d6b71a60bea8d ran licence not identified · pointer only
Improving Adversarial Transferability via Model Alignment 30 Nov 2023 averyma/model-alignment/src/utils_general.py 246863313c06da67 ran no licence file found · pointer only
Understanding the robustness difference between stochastic gradient descent and adaptive gradient methods 13 Aug 2023 averyma/opt-robust/src/utils_general.py 634dbd17789eb3c5 ran no licence file found · pointer only
NuScenes-QA: A Multi-modal Visual Question Answering Benchmark for Autonomous Driving Scenario 24 May 2023 qiantianwen/nuscenes-qa/src/utils/optim.py 9e822b9d34a49db0 ran MIT (permissive)
Prophet: Prompting Large Language Models with Complementary Answer Heuristics for Knowledge-based Visual Question Answering 3 Mar 2023 milvlg/prophet/prophet/stage1/utils/optim.py 4120d55fb48dd6b0 unverified Apache-2.0 (permissive)
EvoJAX: Hardware-Accelerated Neuroevolution 10 Feb 2022 google/evojax/evojax/algo/ars_native.py d3bae217f149bd47 unverified Apache-2.0 (permissive)
Separating Skills and Concepts for Novel Visual Question Answering 19 Jul 2021 SpencerWhitehead/novelvqa/core/model/optim.py b6bf5a95f3801883 ran MIT (permissive)
Gradient Boosting Neural Networks: GrowNet 19 Feb 2020 sbadirli/GrowNet/Classification/main_cls_cv.py dcaab65615b91b2d ran · our draft was wrong no licence file found · pointer only
Deep Modular Co-Attention Networks for Visual Question Answering 25 Jun 2019 MILVLG/mcan-vqa/core/model/optim.py b6bf5a95f3801883 ran Apache-2.0 (permissive)
AAAI id aaai_28607 GuangmingZhu/SketchESC/inversion/main_inversion.py 89169ce9effdd614 ran MIT (permissive)
AAAI id aaai_28253 qiantianwen/NuScenes-QA/src/utils/optim.py 9e822b9d34a49db0 ran MIT (permissive)
ACL Anthology id 2023.findings-acl.810 yoyo-yun/DG_RRR/models/get_optim.py a034475a3896a941 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