Home › Code › Optimizer

Optimizer

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

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

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

18 papers shown of 18, newest first; 19 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. 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
Automated Random Embedding for Practical Bayesian Optimization with Unknown Effective Dimension added by Syntology 2026-05 (from id) Evolutionary-Intelligence/pypop/pypop7/optimizers/bo/lamcts.py f8702fe36ffd2e73 ran GPL-3.0 (copyleft) · pointer only
Can Textual Gradient Work in Federated Learning? 27 Feb 2025 ubc-tea/FedTextGrad/textgrad/optimizer/optimizer.py 564ea28ae44d788f unverified no licence file found · pointer only
Adaptive Observation Cost Control for Variational Quantum Eigensolvers 3 Feb 2025 angler-vqe/subscore/src/subscore/bayesopt/bo.py 67357eab38c03c79 ran fingerprinted no licence file found · pointer only
Adaptive Observation Cost Control for Variational Quantum Eigensolvers 3 Feb 2025 emicore/emicore/src/emicore/bo.py 2b7d6039ba3f5223 ran no licence file found · pointer only
VoxSim: A perceptual voice similarity dataset 26 Jul 2024 kaistmm/voxsim_trainer/optimizer/adam.py 8857cf22d4733067 ran no licence file found · pointer only
Making Offline RL Online: Collaborative World Models for Offline Visual Reinforcement Learning 24 May 2023 qiwang067/CoWorld/models.py 47e0a0e2a2c2db4b ran no licence file found · pointer only
Combinatorial Optimization enriched Machine Learning to solve the Dynamic Vehicle Routing Problem with Time Windows 3 Apr 2023 tumbais/euro-meets-neurips-2022/training/optimization.py f71c69c65ce31fe1 unverified MIT (permissive)
Diffusion-based Generation, Optimization, and Planning in 3D Scenes 15 Jan 2023 scenediffuser/Scene-Diffuser/models/dm/ddpm.py a6222e5f451c662a ran MIT (permissive)
Mastering Diverse Domains through World Models 10 Jan 2023 nm512/dreamerv3-torch/dreamer.py ad4473538a000c98 unverified MIT (permissive)
A Simple Decentralized Cross-Entropy Method 16 Dec 2022 vincentzhang/decentcem/dmbrl/misc/optimizers/decent_cem.py b2643bc67ba7017b ran MIT (permissive)
Bi-directional Weakly Supervised Knowledge Distillation for Whole Slide Image Classification 7 Oct 2022 miccaiif/weno/train_CAMELYONFeat_BagDistillationDSMIL_SharedEnc_Similarity_StuFilterSmoothed_DropPos.py 5ffdba2dcbe80a03 ran no licence file found · pointer only
Mastering the Unsupervised Reinforcement Learning Benchmark from Pixels 24 Sep 2022 mazpie/mastering-urlb/agent/dreamer.py 374c4448ac4f78c9 ran MIT (permissive)
Active Exploration for Inverse Reinforcement Learning 18 Jul 2022 lasgroup/aceirl/src/active_irl/aceirl/algorithm.py f86e4d591b2e9ab0 ran MIT (permissive)
TRACER: Extreme Attention Guided Salient Object Tracing Network 14 Dec 2021 Karel911/TRACER/util/losses.py e1efea555907f415 unverified Apache-2.0 (permissive)
Beta-CROWN: Efficient Bound Propagation with Per-neuron Split Constraints for Complete and Incomplete Neural Network Robustness Verification 11 Mar 2021 eth-sri/eran/tf_verify/optimizer.py ed7f6744c1db4625 ran Apache-2.0 (permissive)
An Efficient Transfer Learning Framework for Multiagent Reinforcement Learning 2020-02 (from id) tianpeiyang/maptf_code/alg/option/option_ma_sro.py 7c8f3673bee00fb7 unverified no licence file found · pointer only
Deep Reinforcement Learning in a Handful of Trials using Probabilistic Dynamics Models 30 May 2018 quanvuong/handful-of-trials-pytorch/MPC.py 5938fc919ec8c9ab ran no licence file found · pointer only
Decoupled Weight Decay Regularization 14 Nov 2017 JakobHavtorn/nn/optim/adam.py 921eeee14c254068 unverified MIT (permissive)
Adam: A Method for Stochastic Optimization 22 Dec 2014 nnaisense/pgpelib/pgpelib/optimizers.py 2601595a91035c3b ran BSD-3-Clause (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