Home › Code › load_mnist

load_mnist

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.

load_mnist appears in the code Syntology harvested for 35 papers, as 35 distinct code bodies found in 36 places (a place is one code body under one paper). Of the 35 papers, 15 with a sample that ran: 11 with a run with no instrument failure, 4 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 load_mnist 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 35 distinct code bodies named load_mnist: 14 ran (of which 0 constructed an object rather than computing a result; 11 with no instrument failure: 1 honoured, 0 violated, 10 with no contract checked; 3 where Syntology's instrument failed) · 21 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:

1ran · honoured contract
0ran · violated contract
2ran · our draft was wrong
1ran; the contract check could not run
10ran
21unverified
0fingerprinted

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

35 papers shown of 35, newest first; 36 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 3 papers added by Syntology; 1 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
How smoothing the affinity matrix affects neighborhood preservation in t-SNE added by Syntology 2026-08 (from id) aida-ugent/smooth_affinity_tsne/experiments/compare_affinity_variants.py e267fe6d285a5ca0 ran; the contract check could not run (DEP_MISSING) BSD-3-Clause (permissive)
Local Synaptic Rules Can Implement a SIGReg Gradient Without Backpropagation added by Syntology 2026-07 (from id) mdda/biological-sigreg/experiments/mnist_multilayer.py b41d0bf43e00d078 unverified MIT (permissive)
On Out-of-sample Embedding in UMAP added by Syntology 2026-06 (from id) tariqul-islam/OOS_UMAP/MNIST/mnist_reader.py fcde486b88e624a8 ran · our draft was wrong MIT (permissive)
Asymptotic Analysis of Two-Layer Neural Networks after One Gradient Step under Gaussian Mixtures Data with Structure 2 Mar 2025 KU-MLIP/2-Layer-NNs-with-Gaussian-Mixtures-Data/utils.py 3ceb0ad81b0b7777 unverified MIT (permissive)
Data-driven Precipitation Nowcasting Using Satellite Imagery 16 Dec 2024 seominseok0429/data-driven-precipitation-nowcasting-using-satellite-imagery/API/dataloader_moving_mnist.py 68f48f4d3c47966d unverified no licence file found · pointer only
Local Superior Soups: A Catalyst for Model Merging in Cross-Silo Federated Learning 31 Oct 2024 ubc-tea/Local-Superior-Soups/dataset/generate_Digit5.py 4a4d555c3688f0f6 unverified no licence file found · pointer only
Enhancing Domain Adaptation through Prompt Gradient Alignment 13 Jun 2024 VietHoang1512/PGA/LA/digit5.py 342c0c85275110c4 unverified no licence file found · pointer only
Generalization in diffusion models arises from geometry-adaptive harmonic representations 4 Oct 2023 LabForComputationalVision/memorization_generalization_in_diffusion_models/code/dataloader_func.py 6ad8ccbe18be47c9 ran MIT (permissive)
Delta-AI: Local objectives for amortized inference in sparse graphical models 3 Oct 2023 GFNOrg/Delta-AI/mnist/data.py 1005ab6934ffad36 unverified MIT (permissive)
On the Limitations of Temperature Scaling for Distributions with Overlaps 1 Jun 2023 2014mchidamb/temp-scaling-limitations/utils/data_utils.py 9a69802ad54de18d unverified MIT (permissive)
Low-rank extended Kalman filtering for online learning of neural networks from streaming data 31 May 2023 probml/rebayes/rebayes/datasets/datasets.py 1656f7098078556c unverified MIT (permissive)
Flexible Phase Dynamics for Bio-Plausible Contrastive Learning 24 Feb 2023 zek3r/icml2023/MNIST_TOOLS_ICML.py 6c9d971c4cd0e840 ran · our draft was wrong no licence file found · pointer only
Target-based Surrogates for Stochastic Optimization 6 Feb 2023 wilderlavington/target-based-surrogates-for-stochastic-optimization/loaders/load_data.py 2cb1e15f8d60f5a0 unverified MIT (permissive)
Concept Activation Regions: A Generalized Framework For Concept-Based Explanations 22 Sep 2022 vanderschaarlab/CARs/src/cars/models/mnist.py 46ff66ae7e7ac875 unverified Apache-2.0 (permissive)
Hierarchical Nearest Neighbor Graph Embedding for Efficient Dimensionality Reduction 24 Mar 2022 koulakis/h-nne/benchmarking/hnne_benchmarking/data.py 36476255697ea82f unverified MIT (permissive)
Universal Hopfield Networks: A General Framework for Single-Shot Associative Memory Models 9 Feb 2022 BerenMillidge/Theory_Associative_Memory/data.py 166095face05d8e0 unverified MIT (permissive)
Photometric Redshifts from SDSS Images with an Interpretable Deep Capsule Network 2021-12 (from id) biprateep/encapZulate-1/src/encapzulate/data_loader/data_loader.py ea3d5625d0edc156 ran MIT (permissive)
Lifelong Mixture of Variational Autoencoders 9 Jul 2021 dtuzi123/LifelongMixtureVAEs/LifelongMixture_32New_Dirchlet.py 99eec1bd389d0c5c unverified no licence file found · pointer only
Enabling Fast Differentially Private SGD via Just-in-Time Compilation and Vectorization 18 Oct 2020 TheSalon/fast-dpsgd/data.py 923ce6d32026c59f unverified MIT (permissive)
Generalized Clustering and Multi-Manifold Learning with Geometric Structure Preservation 21 Sep 2020 lirongwu/gcml/dataset.py b95d14e03470986e ran MIT (permissive)
Towards modular and programmable architecture search 30 Sep 2019 negrinho/deep_architect_legacy/darch/datasets.py a670d1a23a9c9041 ran MIT (permissive)
Unsupervised Visual Domain Adaptation: A Deep Max-Margin Gaussian Process Approach 23 Feb 2019 seqam-lab/GPDA/src/data_manager/mnist.py c3e19a4b614256b8 unverified MIT (permissive)
The Effect of Heterogeneous Data for Alzheimer's Disease Detection from Speech 29 Nov 2018 ychnlgy/Chebyshev-Lagrange/shake-shake_pytorch/datasets.py 11439743f8dc1cb3 unverified MIT (permissive)
Logit Pairing Methods Can Fool Gradient-Based Attacks 29 Oct 2018 uds-lsv/evaluating-logit-pairing-methods/mnist_cifar10/utils.py 4131fcb2c408c901 ran Apache-2.0 (permissive)
The relativistic discriminator: a key element missing from standard GAN 2 Jul 2018 taki0112/RelativisticGAN-Tensorflow/utils.py a5d19dceb0c8a790 unverified MIT (permissive)
Self-Attention Generative Adversarial Networks 21 May 2018 taki0112/Self-Attention-GAN-Tensorflow/utils.py 7fddf2b174e60ac1 unverified MIT (permissive)
Inference Suboptimality in Variational Autoencoders 10 Jan 2018 chriscremer/Inference-Suboptimality/gaps_over_training_exp/compute_gaps.py 715241df022a8fa7 ran · honoured contract no licence file found · pointer only
Dynamic Routing Between Capsules 26 Oct 2017 naturomics/CapsNet-Tensorflow/utils.py a60140719ee8eeab ran Apache-2.0 (permissive)
Dynamic Routing Between Capsules 26 Oct 2017 ethanleet/CapsNet/data_loaders.py 906e695c111ae448 unverified MIT (permissive)
Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithms 25 Aug 2017 zalandoresearch/fashion-mnist/utils/mnist_reader.py fcde486b88e624a8 ran · our draft was wrong MIT (permissive)
Cost-Effective Active Learning for Deep Image Classification 13 Jan 2017 tueboesen/Active-Learning/src/dataloader.py 3f44d3934b8b9f41 unverified MIT (permissive)
Practical Black-Box Attacks against Machine Learning 8 Feb 2016 jbinas/fortified-networks/datasets/utils_fashion_mnist.py 7802d4d8bfea87e4 unverified MIT (permissive)
How far can we go without convolution: Improving fully-connected networks 9 Nov 2015 AvocadoAlpha/boltz_bo/boltzmann_machines/utils/dataset.py f2bf14cc230e210e ran MIT (permissive)
Conditional Generative Adversarial Nets 6 Nov 2014 daheyinyin/CGAN/src/dataset.py 650292d030baf2d8 ran Apache-2.0 (permissive)
PCANet: A Simple Deep Learning Baseline for Image Classification? 14 Apr 2014 lucasleesw/PCANet_python_ver/data_loader.py 3f56553edd2ec3aa ran MIT (permissive)
id 04326 (not an arXiv id) DongGeun-Yoon/DGDM/datasets/mmnist.py f08dfc9a469e83b7 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