Home › Code › calc_gradient_penalty

calc_gradient_penalty

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.

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

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

16 papers shown of 16, newest first; 16 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. 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
Diffusion-based Conditional ECG Generation with Structured State Space Models 19 Jan 2023 ai4healthuol/sssd-ecg/src/baselines/utils/utils.py 08bc532c558ef11c unverified MIT (permissive)
Adversarial Texture for Fooling Person Detectors in the Physical World 7 Mar 2022 WhoTHU/Adversarial_Texture/generator_dim.py 3ec68f4651c396a2 ran MIT (permissive)
Relational Surrogate Loss Learning 26 Feb 2022 hunto/reloss/example/train_reloss/train_reloss.py daf58932096695e5 ran · our draft was wrong Apache-2.0 (permissive)
Existence and Estimation of Critical Batch Size for Training Generative Adversarial Networks with Two Time-Scale Update Rule 28 Jan 2022 iiduka-researches/gans/wgan-gp.py 7f7d85bc76796eb9 ran; the contract check could not run (RAISES) · metamorphic tier: invariant no licence file found · pointer only
A Comprehensive Study on Deep Learning-based Methods for Sign Language Recognition 24 Jul 2020 iliasprc/slrzoo/utils/loss.py e6800d2aedfe20ba ran MIT (permissive)
Leveraging Seen and Unseen Semantic Relationships for Generative Zero-Shot Learning 19 Jul 2020 Maunil/LsrGAN/Codes/Wikipedia_based_dataset/train_CUB.py d3890273357e43a0 unverified no licence file found · pointer only
Hierarchical Patch VAE-GAN: Generating Diverse Videos from a Single Sample 22 Jun 2020 shirgur/hp-vae-gan/modules/utils.py dcaec709beaaa7c4 ran MIT (permissive)
Getting High: High Fidelity Simulation of High Granularity Calorimeters with High Speed 2020-05 (from id) FLC-QU-hep/getting_high/WGAN/wGAN.py 0d068fa8024ead12 ran · our draft was wrong no licence file found · pointer only
Neural Painters: A learned differentiable constraint for generating brushstroke paintings 17 Apr 2019 reiinakano/neural-painters-pytorch/neural_painters/gan_painter.py fd23c3d880c3e469 unverified MIT (permissive)
advertorch v0.1: An Adversarial Robustness Toolbox based on PyTorch 20 Feb 2019 Cody2333/WassNet/WassNet.py 340ab2dfb8dc60eb unverified LGPL-3.0 (copyleft) · pointer only
Copy the Old or Paint Anew? An Adversarial Framework for (non-) Parametric Image Stylization 22 Nov 2018 zalandoresearch/famos/network.py f4aa5c2bfe596cdc unverified MIT (permissive)
ClusterGAN : Latent Space Clustering in Generative Adversarial Networks 10 Sep 2018 eriklindernoren/PyTorch-GAN/implementations/cluster_gan/clustergan.py 3be3af069c4dd5fb unverified MIT (permissive)
A Unified Feature Disentangler for Multi-Domain Image Translation and Manipulation 5 Sep 2018 Alexander-H-Liu/UFDN/src/util.py 3625768918bd356f ran MIT (permissive)
Negative Momentum for Improved Game Dynamics 12 Jul 2018 ReyhaneAskari/negative_momentum_for_improved_game_dynamics/gan_pytorch.py 8165dccb5f7b4b5d unverified MIT (permissive)
DeSIGN: Design Inspiration from Generative Networks 3 Apr 2018 blufzzz/Design-Inspiration-from-Generative-Networks/utils.py 6eae36f6caddabf5 unverified MIT (permissive)
Image-to-Image Translation with Conditional Adversarial Networks 21 Nov 2016 Vious/LBAM_Pytorch/loss/InpaintingLoss.py c22eeb67c665a020 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