Home › Code › get_parameter_groups

get_parameter_groups

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.

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

Licence is a property of each copy, so it is counted per place: 21 of the 30 places are pointer only (Syntology does not serve that copy's text); at 12 of those 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 (hover the licence cell for why). 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

30 papers shown of 30, newest first; 30 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; 5 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
Make Your Training Flexible: Towards Deployment-Efficient Video Models 18 Mar 2025 OpenGVLab/FluxViT/single_modality/optim_factory.py 0ef0019514eaaa09 ran MIT (permissive) here; the stored copy is pointer only
Understanding Bias in Large-Scale Visual Datasets 2 Dec 2024 boyazeng/understand_bias/optim_factory.py 0ef0019514eaaa09 ran no licence file found · pointer only
Improving Synthetic Image Detection Towards Generalization: An Image Transformation Perspective 13 Aug 2024 ouxiang-li/safe/optim_factory.py f7189865b26b7aad ran Apache-2.0 (permissive)
CAS-ViT: Convolutional Additive Self-attention Vision Transformers for Efficient Mobile Applications 7 Aug 2024 tianfang-zhang/cas-vit/classification/optim_factory.py 979fc7d0ba424da1 ran MIT (permissive)
A Sanity Check for AI-generated Image Detection 27 Jun 2024 shilinyan99/aide/optim_factory.py dd7ffb8631ae8a47 ran MIT (permissive)
Large Brain Model for Learning Generic Representations with Tremendous EEG Data in BCI 29 May 2024 935963004/labram/optim_factory.py 731a7e8b4363c5ab ran MIT (permissive)
Adapting LLaMA Decoder to Vision Transformer 10 Apr 2024 techmonsterwang/illama/optim_factory.py 0ef0019514eaaa09 ran no licence file found · pointer only
Unleashing Network Potentials for Semantic Scene Completion 12 Mar 2024 fereenwong/ammnet/ammnet/optim/optim_factory.py 2834d68f0b087828 ran no licence file found · pointer only
SA$^2$VP: Spatially Aligned-and-Adapted Visual Prompt 16 Dec 2023 tommy-xq/sa2vp/optim_factory.py 0ef0019514eaaa09 ran MIT (permissive) here; the stored copy is pointer only
A Coefficient Makes SVRG Effective 9 Nov 2023 davidyyd/alpha-SVRG/optim_factory.py 0ef0019514eaaa09 ran no licence file found · pointer only
Simple and Asymmetric Graph Contrastive Learning without Augmentations 29 Oct 2023 yandex-research/heterophilous-graphs/utils.py f94ccb33e6c97913 ran MIT (permissive)
RoboDepth: Robust Out-of-Distribution Depth Estimation under Corruptions 23 Oct 2023 noahzn/Lite-Mono/lite-mono-pretrain-code/optim_factory.py 0ef0019514eaaa09 ran MIT (permissive) here; the stored copy is pointer only
Convolutional Networks with Oriented 1D Kernels 27 Sep 2023 princeton-vl/oriented1d/optim_factory.py 0ef0019514eaaa09 ran MIT (permissive) here; the stored copy is pointer only
MAE-DFER: Efficient Masked Autoencoder for Self-supervised Dynamic Facial Expression Recognition 5 Jul 2023 sunlicai/mae-dfer/optim_factory.py 0ef0019514eaaa09 ran MIT (permissive) here; the stored copy is pointer only
Hyperbolic Image-Text Representations 18 Apr 2023 facebookresearch/slip/beit_finetuning/optim_factory.py 0ef0019514eaaa09 ran MIT recorded; this copy not marked cleared · pointer only
SMPConv: Self-moving Point Representations for Continuous Convolution 5 Apr 2023 sangnekim/SMPConv/smp_imagenet/optim_factory.py f752c61c80d4fa81 ran MIT (permissive)
CEDNet: A Cascade Encoder-Decoder Network for Dense Prediction 13 Feb 2023 zhanggang001/cfnet/optim_factory.py 0ef0019514eaaa09 ran MIT recorded; this copy not marked cleared · pointer only
Masked Event Modeling: Self-Supervised Pretraining for Event Cameras 20 Dec 2022 tum-vision/mem/mem/optim_factory.py 0ef0019514eaaa09 ran Apache-2.0 (permissive) here; the stored copy is pointer only
AdaMAE: Adaptive Masking for Efficient Spatiotemporal Learning with Masked Autoencoders 16 Nov 2022 wgcban/adamae/optim_factory.py 0ef0019514eaaa09 ran MIT (permissive) here; the stored copy is pointer only
Demystify Transformers & Convolutions in Modern Image Deep Networks 10 Nov 2022 opengvlab/stm-evaluation/classification/optim_factory.py 0ef0019514eaaa09 ran MIT (permissive) here; the stored copy is pointer only
Exploring Target Representations for Masked Autoencoders 8 Sep 2022 liuxingbin/dbot/evaluation/optim_factory.py bb32ca015a494c58 ran Apache-2.0 (permissive)
Masked Unsupervised Self-training for Label-free Image Classification 7 Jun 2022 salesforce/must/optim_factory.py 3698f81878031ac1 ran BSD-3-Clause (permissive)
ResT: An Efficient Transformer for Visual Recognition 28 May 2021 wofmanaf/ResT/optim_factory.py 7de76b9d1b1f4ea4 ran Apache-2.0 recorded; this copy not marked cleared · pointer only
Online Normalization for Training Neural Networks 15 May 2019 cerebras/online-normalization/experiments/resnet/utils.py d8bd6382fa212764 ran BSD-3-Clause (permissive)
Searching for MobileNetV3 6 May 2019 xiaolai-sqlai/mobilenetv3/optim_factory.py 0ef0019514eaaa09 ran MIT recorded; this copy not marked cleared · pointer only
IJCAI id ijcai2023_0111 xiaolai-sqlai/RaMLP/optim_factory.py 0ef0019514eaaa09 ran MIT (permissive) here; the stored copy is pointer only
AAAI id aaai_28243 tommy-xq/SA2VP/optim_factory.py 0ef0019514eaaa09 ran MIT (permissive) here; the stored copy is pointer only
CVF open access id Li_Met2Net_A_Decoupled_Two-Stage_Spatio-Temporal_Forecasting_Model_for_Complex_Meteorological_ICCV_2025_paper ShremG/Met2Net/openstl/core/optim_scheduler.py 0ef0019514eaaa09 ran Apache-2.0 (permissive) here; the stored copy is pointer only
id 136860514 (not an arXiv id) facebookresearch/SLIP/beit_finetuning/optim_factory.py 0ef0019514eaaa09 ran MIT recorded; this copy not marked cleared · pointer only
id 136810051 (not an arXiv id) raoyongming/AMixer/optim_factory.py 0ef0019514eaaa09 ran MIT (permissive) here; the stored copy is pointer only

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