Home › Code › get_loaders

get_loaders

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

get_loaders appears in the code Syntology harvested for 51 papers, as 51 distinct code bodies found in 54 places (a place is one code body under one paper). At least one of them ran in 4 of the papers; 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_loaders 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 4 of the 51 distinct code bodies named get_loaders; 47 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
4ran
47unverified
0fingerprinted

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

51 papers shown of 51, newest first; 54 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 5 papers added by Syntology; 5 papers have no page here and are shown by arXiv id only. 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
Geometry-Anchored Transport Framework for Exemplar-Free Class-Incremental Learning added by Syntology 2026-06 (from id) HXuSz11/GATF_ECCV2026/src/datasets/data_loader.py d80980af3f736cda unverified no licence file found · pointer only
Balancing Fidelity, Utility, and Privacy in Synthetic Cardiac MRI Generation: A Comparative Study added by Syntology 2026-03 (from id) vlbthambawita/SynCMRI/mask_generation/data_loading.py 4dce07ff377af4b1 unverified no licence file found · pointer only
Garbage Attention in Large Language Models: <BOS> Sink Heads and Sink-aware Pruning added by Syntology 2026-01 (from id) CASIA-LMC-Lab/FLAP/lib/prune.py 21ef6425a9e8b029 unverified Apache-2.0 (permissive)
PuzzleMoE: Efficient Compression of Large Mixture-of-Experts Models via Fine-Grained Expert Merging and Bit-packed Inference added by Syntology 2025-11 (from id) Supercomputing-System-AI-Lab/PuzzleMoE/puzzlemoe/utils/merge_experts_function.py 3770bd0cab131a2b unverified Apache-2.0 (permissive)
The Unseen Frontier: Pushing the Limits of LLM Sparsity with Surrogate-Free ADMM added by Syntology 2025-10 (from id) log-postech/elsa/lib/data.py e2c3c36c497f9fe0 unverified no licence file found · pointer only
arXiv:2507.23279 2025-07 (from id) ZunhaiSu/Super-Experts-Profilling/data_utils.py 4b74616b7db8928f unverified no licence file found · pointer only
arXiv:2506.09351 2025-06 (from id) yuchenblah/DIVE/lib/evaldata.py 7e68b286b9a062c5 unverified Apache-2.0 (permissive)
SAFE: Finding Sparse and Flat Minima to Improve Pruning 7 Jun 2025 LOG-postech/safe-torch/language/lib/prune.py d6ccfa34fac6df39 unverified MIT (permissive)
DLP: Dynamic Layerwise Pruning in Large Language Models 27 May 2025 ironartisan/dlp/lib/prune.py 2eaf81f9b2452228 unverified Apache-2.0 (permissive)
AmoebaLLM: Constructing Any-Shape Large Language Models for Efficient and Instant Deployment 15 Nov 2024 GATECH-EIC/AmoebaLLM/width_shrink/data.py 16994008353af958 unverified MIT (permissive)
Privacy-Preserving Graph-Based Machine Learning with Fully Homomorphic Encryption for Collaborative Anti-Money Laundering 5 Nov 2024 fabecode/GraphML-FHE/gnn_fhe_pipeline/train_util.py 7a4b3977f9af49ca unverified Apache-2.0 (permissive)
LLMCBench: Benchmarking Large Language Model Compression for Efficient Deployment 28 Oct 2024 AboveParadise/LLMCBench/evaluate_ppl.py 3f1d2bce76741bc0 unverified MIT (permissive)
WAGLE: Strategic Weight Attribution for Effective and Modular Unlearning in Large Language Models 23 Oct 2024 OPTML-Group/WAGLE/src/dataset/dataset.py 16994008353af958 unverified MIT (permissive)
DARE the Extreme: Revisiting Delta-Parameter Pruning For Fine-Tuned Models 12 Oct 2024 vengdeng/darex/utils/getwx.py a54651cc8454cb77 unverified no licence file found · pointer only
MaskLLM: Learnable Semi-Structured Sparsity for Large Language Models 26 Sep 2024 NVlabs/MaskLLM/eval_llama_ppl.py a6cf7a5e8f29a402 unverified licence not identified · pointer only
Composable Interventions for Language Models 9 Jul 2024 hartvigsen-group/composable-interventions/sparsellm/lib/data.py d280312c1c709fbb unverified no licence file found · pointer only
Pruner-Zero: Evolving Symbolic Pruning Metric from scratch for Large Language Models 5 Jun 2024 pprp/pruner-zero/lib/data.py b6ec51bc8a06ee71 unverified MIT (permissive)
Pruner-Zero: Evolving Symbolic Pruning Metric from scratch for Large Language Models 5 Jun 2024 pprp/pruner-zero/lib/gradient_computation.py 35a6bbc8f64f77b7 unverified MIT (permissive)
Layer-Aware Analysis of Catastrophic Overfitting: Revealing the Pseudo-Robust Shortcut Dependency 25 May 2024 tmllab/2024_ICML_LAP/CIFAR10/utils.py 816caa026adecbe6 unverified MIT (permissive)
CaloDREAM -- Detector Response Emulation via Attentive flow Matching 2024-05 (from id) heidelberg-hepml/calo_dreamer/src/datasets.py 456a769435ec2115 ran no licence file found · pointer only
SOUL: Unlocking the Power of Second-Order Optimization for LLM Unlearning 28 Apr 2024 optml-group/soul/src/dataset/dataset.py 16994008353af958 unverified MIT (permissive)
Conformal Prediction via Regression-as-Classification 12 Apr 2024 EtashGuha/R2CCP/R2CCP/data.py ba314ff194ec3aa8 ran MIT (permissive)
What do we learn from inverting CLIP models? 5 Mar 2024 hamidkazemi22/clipinversion/helpers/utils.py 52c6392743c5bd39 unverified no licence file found · pointer only
A Mechanistic Analysis of a Transformer Trained on a Symbolic Multi-Step Reasoning Task 19 Feb 2024 abhay-sheshadri/backward-chaining-circuits/src/utils.py acd6a741f6a7a07f ran no licence file found · pointer only
Shortened LLaMA: Depth Pruning for Large Language Models with Comparison of Retraining Methods 5 Feb 2024 nota-netspresso/shortened-llm/src/dataset.py 4ef386ce30344069 unverified no licence file found · pointer only
Fast and Effective Weight Update for Pruned Large Language Models 1 Jan 2024 fmfi-compbio/admm-pruning/lib/data.py d0b76a86bef8bcaa unverified MIT (permissive)
Beyond Size: How Gradients Shape Pruning Decisions in Large Language Models 8 Nov 2023 rocktimjyotidas/gblm-pruner/lib/data.py 938021b9c285abea unverified MIT (permissive)
Cross-modal Active Complementary Learning with Self-refining Correspondence 26 Oct 2023 QinYang79/CRCL/CRCL_NeurIPS23/data.py c2c0455d61babb92 unverified no licence file found · pointer only
EmoCLIP: A Vision-Language Method for Zero-Shot Video Facial Expression Recognition 25 Oct 2023 nickyfot/emoclip/DataLoaders/get_loader.py 368b5461230215d6 unverified Apache-2.0 (permissive)
Dynamic Sparse No Training: Training-Free Fine-tuning for Sparse LLMs 13 Oct 2023 zyxxmu/dsnot/lib/prune.py 2551834c320a844b unverified no licence file found · pointer only
Outlier Weighed Layerwise Sparsity (OWL): A Missing Secret Sauce for Pruning LLMs to High Sparsity 8 Oct 2023 luuyin/owl/lib/prune_all.py 2d4b7e939c6fa46b unverified MIT (permissive)
Compressing LLMs: The Truth is Rarely Pure and Never Simple 2 Oct 2023 VITA-Group/llm-kick/GPTQ_experiment/lib/data.py e871931ae9a838f9 unverified no licence file found · pointer only
FACTS: First Amplify Correlations and Then Slice to Discover Bias 29 Sep 2023 yvsriram/FACTS/utils/datasets.py f9d167bde46e08be ran no licence file found · pointer only
A Simple and Effective Pruning Approach for Large Language Models 20 Jun 2023 crystaleye42/eval-safety/lib/prune.py 142350989c8691e6 unverified MIT (permissive)
A Simple and Effective Pruning Approach for Large Language Models 20 Jun 2023 qiaoxiao7282/seft/lib/prune_all.py a0fc985586f0984c unverified no licence file found · pointer only
A Simple and Effective Pruning Approach for Large Language Models 20 Jun 2023 locuslab/wanda/lib/prune.py d2a4a72ebbf33444 unverified MIT (permissive)
Joint Feature and Differentiable $ k $-NN Graph Learning using Dirichlet Energy 21 May 2023 GhadaSokar/WAST/utils.py bb797c04116322a3 unverified MIT (permissive)
The Forward-Forward Algorithm: Some Preliminary Investigations 27 Dec 2022 ads-cmu/forwardforward/previous_implementation/utilities.py 4613748f89bf60c7 unverified MIT (permissive)
TrojViT: Trojan Insertion in Vision Transformers 27 Aug 2022 mxzheng/trojvit/utils.py 95bc0f22b2452460 unverified MIT (permissive)
On the Privacy Effect of Data Enhancement via the Lens of Memorization 17 Aug 2022 lixiaothu/privacy_and_aug/dataset.py e259e3b8e5627125 unverified MIT (permissive)
Disparate Impact in Differential Privacy from Gradient Misalignment 15 Jun 2022 layer6ai-labs/fair-dp/datasets/loaders.py 890beb904c12fdd3 unverified Apache-2.0 (permissive)
Robust Fine-Tuning of Deep Neural Networks with Hessian-based Generalization Guarantees 6 Jun 2022 VirtuosoResearch/Robust-fine-tuning/exps_on_image_datasets/data_loader/mini_domain_net.py fa25db77d8a7f54f unverified MIT (permissive)
Patch-Fool: Are Vision Transformers Always Robust Against Adversarial Perturbations? 16 Mar 2022 RICE-EIC/Patch-Fool/utils.py 94ca6bbcc2bbe97e unverified MIT (permissive)
On the importance of cross-task features for class-incremental learning 22 Jun 2021 AlbinSou/cross_task_cil/src/datasets/data_loader.py 00e4bb5fb503e035 unverified MIT (permissive)
Universal Weighting Metric Learning for Cross-Modal Matching 7 Oct 2020 wayne980/PolyLoss/data.py a90b1e5a707539c5 unverified Apache-2.0 (permissive)
Variational Inference with Continuously-Indexed Normalizing Flows 10 Jul 2020 anthonycaterini/cif-vi/cif/datasets/loaders.py 2b5ed06aec1d27b3 unverified MIT (permissive)
Learning to Generate Noise for Multi-Attack Robustness 22 Jun 2020 divyam3897/MNG_AC/train_pgd.py 4829fc02195f0c39 unverified MIT (permissive)
Dynamically Stable Infinite-Width Limits of Neural Classifiers 11 Jun 2020 deepmipt/research/Infinite_Width_Limits_of_Neural_Classifiers/utils/data_loaders.py a3acc2c4331bedae unverified MIT (permissive)
Conditional Channel Gated Networks for Task-Aware Continual Learning 31 Mar 2020 lit-leo/cgate/src/data.py de186ee17852ec67 unverified MIT (permissive)
Stacked Cross Attention for Image-Text Matching 21 Mar 2018 idejie/SCAN/data.py a3b22af17bee87cc unverified Apache-2.0 (permissive)
Loss Surfaces, Mode Connectivity, and Fast Ensembling of DNNs 27 Feb 2018 tjwhitaker/prune-and-tune-ensembles/src/data.py 4b373666065863fd unverified MIT (permissive)
arXiv:2025.acl-long.590 ChnQ/SPIN/src/utils.py 653a16cc7fc93fe0 unverified Apache-2.0 (permissive)
arXiv:2024.findings-emnlp.579 RazvanDu/DynamicSlicing/src/slicegpt/data.lib.py 16994008353af958 unverified MIT (permissive)
arXiv:136910021 UCDvision/CMSF/self_supervised/eval_knn.py 31aaac6f71c512ca unverified 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 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