Home › Code › make_optimizer

make_optimizer

Syntologyentry name in harvested code

Syntology's record for this page has not changed since , the first build that kept a record date for it; when this build read Syntology's graph is in the build record.

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

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

32 papers shown of 32, newest first; 32 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; 2 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
Optimizing for the decision not the prediction: an exploration of Smooth Net Benefit as a training objective added by Syntology 2026-09 (from id) KoenGorgels/Smooth-Net-Benefit/nbloss/trainer.py 71f4421a921fe1c0 ran no licence file found · pointer only
Seg-R1: Segmentation Can Be Surprisingly Simple with Reinforcement Learning 27 Jun 2025 geshang777/FOCUS/focus/evaluation/utils.py 6f80ac05b5e36f8e ran Apache-2.0 (permissive)
Unveiling Advanced Frequency Disentanglement Paradigm for Low-Light Image Enhancement 3 Sep 2024 redrock303/ADF-LLIE/utils/solver.py 25451c0fe76b30b2 ran no licence file found · pointer only
Team up GBDTs and DNNs: Advancing Efficient and Effective Tabular Prediction with Tree-hybrid MLPs 13 Jul 2024 jyansir/tmlp/models/abstract.py 5d82780c042d2e41 ran MIT (permissive)
Estimating before Debiasing: A Bayesian Approach to Detaching Prior Bias in Federated Semi-Supervised Learning 30 May 2024 GuogangZhu/FedDB/src/modules/modules.py cc90e13adc203a00 ran · our draft was wrong Apache-2.0 (permissive)
Adaptive Convolutional Neural Network for Image Super-resolution 24 Feb 2024 hellloxiaotian/adsrnet/HDSRNet/utility.py f42529fb5148a7f3 ran no licence file found · pointer only
Deep Neural Network Benchmarks for Selective Classification 23 Jan 2024 andrepugni/esc/testing_ood.py acfc9110c70967de unverified no licence file found · pointer only
Learning Semantic-Aware Knowledge Guidance for Low-Light Image Enhancement 14 Apr 2023 langmanbusi/semantic-aware-low-light-image-enhancement/DRBN_SKF/src/utility.py f3316005a99d1d08 ran MIT (permissive)
Flow reconstruction by multiresolution optimization of a discrete loss with automatic differentiation 2023-03 (from id) cselab/odil/src/odil/optimizer.py e1e44850adde7fe3 unverified MIT (permissive)
Transformers are Meta-Reinforcement Learners 14 Jun 2022 luckeciano/transformers-metarl/src/garage/_functions.py 8a3741971be6face ran MIT (permissive)
FedFormer: Contextual Federation with Attention in Reinforcement Learning 27 May 2022 liamhebert/FedFormer/garage/_functions.py 8a3741971be6face ran MIT (permissive)
CCMB: A Large-scale Chinese Cross-modal Benchmark 8 May 2022 yuxie11/R2D2/train_r2d2_matching.py 494b925526e287c1 ran Apache-2.0 (permissive)
CLIP-CLOP: CLIP-Guided Collage and Photomontage 6 May 2022 deepmind/arnheim/arnheim_3/src/training.py 9179f893b42e7d4c ran Apache-2.0 (permissive)
Revisiting Deep Learning Models for Tabular Data 22 Jun 2021 Yura52/tabular-dl-revisiting-models/lib/deep.py 27e9ee3019bc8ff0 unverified Apache-2.0 (permissive)
AdaMatch: A Unified Approach to Semi-Supervised Learning and Domain Adaptation 8 Jun 2021 smkim7-kr/AdaMatch-pytorch/src/optimizer.py 0c2325bd115425e9 unverified MIT (permissive)
Graph-based Person Signature for Person Re-Identifications 14 Apr 2021 aioz-ai/CVPRW21_GPS/solver/build.py 3c707eafb83ce730 ran · our draft was wrong MIT (permissive)
Spelling Error Correction with Soft-Masked BERT 15 May 2020 gitabtion/BertBasedCorrectionModels/bbcm/solver/build.py 3c707eafb83ce730 ran · our draft was wrong Apache-2.0 (permissive)
Revisiting Pre-Trained Models for Chinese Natural Language Processing 29 Apr 2020 shibing624/pycorrector/pycorrector/macbert/macbert4csc.py 3c707eafb83ce730 ran · our draft was wrong Apache-2.0 (permissive)
Closed-loop Matters: Dual Regression Networks for Single Image Super-Resolution 16 Mar 2020 guoyongcs/DRN/utility.py 0bf2f644da5606ae ran MIT (permissive)
Dual-path RNN: efficient long sequence modeling for time-domain single-channel speech separation 14 Oct 2019 JusperLee/Dual-Path-RNN-Pytorch/train_rnn.py b448dde01277a441 ran · our draft was wrong Apache-2.0 (permissive)
Deformable Non-local Network for Video Super-Resolution 24 Sep 2019 wh1h/DNLN/src/utility.py 5eed111fb0fb051b ran MIT (permissive)
AdaCoF: Adaptive Collaboration of Flows for Video Frame Interpolation 24 Jul 2019 HyeongminLEE/AdaCoF-pytorch/utility.py 35612f45302f599e ran MIT (permissive)
Densely Residual Laplacian Super-Resolution 28 Jun 2019 saeed-anwar/DRLN/TestCode/code/utility.py f3316005a99d1d08 ran MIT (permissive)
Omnidirectional Scene Text Detection with Sequential-free Box Discretization 6 Jun 2019 Yuliang-Liu/Box_Discretization_Network/maskrcnn_benchmark/solver/build.py 08d4c641043ce5c0 ran · our draft was wrong licence not identified · pointer only
Neural Ordinary Differential Equations 19 Jun 2018 HolmesShuan/OISR-PyTorch/NTIRE2019/OISR/src/utility.py f250aafdaa7f4526 ran BSD-2-Clause (permissive)
Learning Discriminative Features with Multiple Granularities for Person Re-Identification 4 Apr 2018 WangTaoAs/MGN_ReID/processor/make_optimizer.py 6e544671b85f034f ran Apache-2.0 (permissive)
Maintaining Natural Image Statistics with the Contextual Loss 13 Mar 2018 subeeshvasu/2018_subeesh_epsr_eccvw/EPSR_testcode/code/utility.py f3316005a99d1d08 ran MIT (permissive)
Deep Back-Projection Networks For Super-Resolution 7 Mar 2018 LEEPEIQIN/EDSR/src/utility.py 5eed111fb0fb051b ran MIT (permissive)
SEGAN: Speech Enhancement Generative Adversarial Network 28 Mar 2017 santi-pdp/segan_pytorch/segan/models/ops.py 42bb0a5113fe251c unverified MIT (permissive)
Benchmarking Deep Reinforcement Learning for Continuous Control 22 Apr 2016 rlworkgroup/garage/src/garage/_functions.py 8a3741971be6face ran MIT (permissive)
CVF open access id Deng_LAU-Net_Latitude_Adaptive_Upscaling_Network_for_Omnidirectional_Image_Super-Resolution_CVPR_2021_paper wangh-allen/LAU-Net/utility.py cbc1a02648805661 ran Apache-2.0 (permissive)
CVF open access id Danier_ST-MFNet_A_Spatio-Temporal_Multi-Flow_Network_for_Frame_Interpolation_CVPR_2022_paper danielism97/ST-MFNet/utility.py 35612f45302f599e 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