Home › Code › compute_gradient_penalty

compute_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.

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

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

15 papers shown of 15, newest first; 17 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. 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
No Free Lunch for Synthetic Images under Data Scarcity Conditions added by Syntology 2026-06 (from id) BorjaArroyo/synthetic-images-tradeoff/src/core/trainer.py baa017955d57c289 ran MIT (permissive)
Generative Conditional Distributions by Neural (Entropic) Optimal Transport 4 Jun 2024 nguyenngocbaocmt02/gentle/train_wgan_gp.py 56d80682979d3e38 unverified no licence file found · pointer only
Teach a Robot to FISH: Versatile Imitation from One Minute of Demonstrations 2 Mar 2023 siddhanthaldar/FISH/FISH/agent/dac.py 52cbdb60c855f08b ran MIT (permissive)
Visual Imitation Learning with Patch Rewards 2 Feb 2023 sail-sg/PatchAIL/PatchAIL/agent/adv_irl.py d7749f49287c02d5 ran Apache-2.0 (permissive)
CRIL: Continual Robot Imitation Learning via Generative and Prediction Model 17 Jun 2021 HeegerGao/CRIL/wgangp.py 4e8241a45eda25b9 unverified MIT (permissive)
End-to-end reconstruction meets data-driven regularization for inverse problems 7 Jun 2021 Subhadip-1/unrolling_meets_data_driven_regularization/adversarial_reg_models.py 068e5121b893e599 unverified MIT (permissive)
Disentangled Representation Learning for Astronomical Chemical Tagging 10 Mar 2021 drd13/tagging-package/tagging/scripts/train_factordis.py 08560cce1ac8cf98 unverified no licence file found · pointer only
Learned convex regularizers for inverse problems 6 Aug 2020 Subhadip-1/data_driven_convex_regularization/train_convex_reg.py 14faa548c958b89a unverified MIT (permissive)
StarGAN: Unified Generative Adversarial Networks for Multi-Domain Image-to-Image Translation 24 Nov 2017 eriklindernoren/PyTorch-GAN/implementations/stargan/stargan.py 25032f56f7a0b4cf unverified MIT (permissive)
On Convergence and Stability of GANs 19 May 2017 eriklindernoren/PyTorch-GAN/implementations/dragan/dragan.py c0ef577ceff3d8e3 unverified MIT (permissive)
DualGAN: Unsupervised Dual Learning for Image-to-Image Translation 8 Apr 2017 tmabraham/UPIT/upit/train/dualgan.py 389f241698c1763f unverified Apache-2.0 (permissive)
DualGAN: Unsupervised Dual Learning for Image-to-Image Translation 8 Apr 2017 eriklindernoren/PyTorch-GAN/implementations/dualgan/dualgan.py 7df95909e48d11f5 unverified MIT (permissive)
Improved Training of Wasserstein GANs 31 Mar 2017 goldhuang/SRGAN-PyTorch/model.py 8ad87c2d347e436c ran · our draft was wrong no licence file found · pointer only
Improved Training of Wasserstein GANs 31 Mar 2017 eriklindernoren/PyTorch-GAN/implementations/wgan_gp/wgan_gp.py 90d0782f63f78a1d unverified MIT (permissive)
Unpaired Image-to-Image Translation using Cycle-Consistent Adversarial Networks 30 Mar 2017 NiucunCode/Deep-Learning-proj2/stargan/stargan.py 6150661478a11e4a unverified no licence file found · pointer only
Unsupervised Anomaly Detection with Generative Adversarial Networks to Guide Marker Discovery 17 Mar 2017 A03ki/f-AnoGAN/fanogan/train_wgangp.py 90dc48f19c618ed7 ran · our draft was wrong MIT (permissive)
Generative Adversarial Networks 10 Jun 2014 BYOGan/BYOGan/byogan-api/TrainGAN.py 8b5b6daf7185083a 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