Papers › MineGAN: effective knowledge transfer from GANs to target domains with few images

MineGAN: effective knowledge transfer from GANs to target domains with few images

11 Dec 2019CVPR 2020 6arXiv:1912.05270archive 2025-07-28

Yaxing Wang, Abel Gonzalez-Garcia, David Berga, Luis Herranz, Fahad Shahbaz Khan, Joost Van de Weijer

One of the attractive characteristics of deep neural networks is their ability to transfer knowledge obtained in one domain to other related domains. As a result, high-quality networks can be trained in domains with relatively little training data. This property has been extensively studied for discriminative networks but has received significantly less attention for generative models. Given the often enormous effort required to train GANs, both computationally as well as in the dataset collection, the re-use of pretrained GANs is a desirable objective. We propose a novel knowledge transfer method for generative models based on mining the knowledge that is most beneficial to a specific target domain, either from a single or multiple pretrained GANs. This is done using a miner network that identifies which part of the generative distribution of each pretrained GAN outputs samples closest to the target domain. Mining effectively steers GAN sampling towards suitable regions of the latent space, which facilitates the posterior finetuning and avoids pathologies of other methods such as mode collapse and lack of flexibility. We perform experiments on several complex datasets using various GAN architectures (BigGAN, Progressive GAN) and show that the proposed method, called MineGAN, effectively transfers knowledge to domains with few target images, outperforming existing methods. In addition, MineGAN can successfully transfer knowledge from multiple pretrained GANs. Our code is available at: https://github.com/yaxingwang/MineGAN.

PaperPDFConference PDFCodeCode Syntology ran

In Syntology View this paper on Syntology: its repositories, every harvested function with whether it ran, its licence and the call to fetch it.

Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, Syntology's MCP tool lists every function and class Syntology harvested from this paper and whether it ran (how to connect): get_harvested_code_for_paper(arxiv_id="1912.05270")

Code

Syntology Ran 9 of 20 code samples harvested from 1 repository linked to this paper; 11 have no recorded run. Of those that ran: 3 ran · our draft was wrong; 6 ran with no contract checked.

By repository: named in the paper: 20 samples from 1 repository, 9 ran. The run record, sample by sample. “Ran” means executed on a synthesized input, not that the code is correct or reproduces the paper.

yaxingwang/MineGAN mentioned in papertfMIT report
PeterWang512/GANSketching mentioned on GitHubpytorchMIT report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

Code Syntology ran Syntology

20 samples harvested; 9 ran; 0 honoured the contract we drafted; 11 have no recorded run. Read from Syntology's graph 2026-09-25; that is when this build read the record, not when the samples ran.

3ran · our draft was wrong
6ran
11unverified

Licence: 0 of the 20 samples are pointer only, meaning Syntology does not serve that copy's text. This page shows no code text for any sample; each one links to its file in the repository.

Harvested from yaxingwang/MineGAN. “Ran” means the sample executed on a synthesized input. It does not mean the output is correct, and nothing here reproduces the paper's results. “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.

Each sample ends with its 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.

Repository labels, per sample. official repository: The archive marks this repository official for the paper. named in the paper: The archive records that the paper mentions this repository; it is not marked official. community (archive-listed): In the archive's code links for this paper, not marked official and not recorded as mentioned in the paper. found in paper text by Syntology: Syntology found this repository in the paper's own text; whether it is the authors' implementation is not asserted. community: Not in the archive's code links for this paper; a community repository Syntology harvested. Samples from a repository marked official are listed first. Licence labels name the repository's licence as recorded at 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 label for the reason. File links open the file on GitHub at the default branch, which may have changed since the harvest.

D_arch yaxingwang/MineGAN/BigGAN.py named in the paper ran · our draft was wrong MIT (permissive) · 85eb95cce203dfc7 · report
G_arch yaxingwang/MineGAN/BigGAN.py named in the paper ran · our draft was wrong MIT (permissive) · e8c308c9283407d7 · report
M_arch yaxingwang/MineGAN/BigGAN.py named in the paper ran MIT (permissive) · 7b1f8ad8742580c5 · report
find_classes yaxingwang/MineGAN/datasets.py named in the paper ran MIT (permissive) · 52d10a10fb72fb9f · report
gram_schmidt yaxingwang/MineGAN/layers.py named in the paper ran · our draft was wrong MIT (permissive) · c41836f3e51fa8f1 · report
is_image_file yaxingwang/MineGAN/datasets.py named in the paper ran MIT (permissive) · 4e6a8faaf8e44abe · report
l2_reg yaxingwang/MineGAN/styleGAN/finetune.py named in the paper ran MIT (permissive) · 3d111932e00fa877 · report
loss_dcgan_gen yaxingwang/MineGAN/losses.py named in the paper ran MIT (permissive) · c64be9107f781e89 · report
make_dataset yaxingwang/MineGAN/datasets.py named in the paper ran MIT (permissive) · 79e61b6269a450e8 · report
D_arch yaxingwang/MineGAN/BigGANdeep.py named in the paper unverified MIT (permissive) · a99a05ac52533be9 · report
FM_reg yaxingwang/MineGAN/styleGAN/finetune.py named in the paper unverified MIT (permissive) · a76fa2aebbbe157d · report
G_arch yaxingwang/MineGAN/BigGANdeep.py named in the paper unverified MIT (permissive) · 44d6a6343f6eb182 · report
loss_dcgan_dis yaxingwang/MineGAN/losses.py named in the paper unverified MIT (permissive) · 982a26492dc6b7fb · report
loss_hinge_dis yaxingwang/MineGAN/losses.py named in the paper unverified MIT (permissive) · 290cd37ab0098d5c · report
numpy_calculate_frechet_distance yaxingwang/MineGAN/inception_utils.py named in the paper unverified MIT (permissive) · 54af0200eab3163f · report
power_iteration yaxingwang/MineGAN/layers.py named in the paper unverified MIT (permissive) · 28d3a35157f2916d · report
proj yaxingwang/MineGAN/layers.py named in the paper unverified MIT (permissive) · 4015ab1f3ab9b881 · report
run yaxingwang/MineGAN/inception_tf13.py named in the paper unverified MIT (permissive) · ac122c2c1495ce94 · report
sqrt_newton_schulz yaxingwang/MineGAN/inception_utils.py named in the paper unverified MIT (permissive) · c39eebccbb5e86a6 · report
torch_cov yaxingwang/MineGAN/inception_utils.py named in the paper unverified MIT (permissive) · 4a2b2f288be2a186 · report

Tasks

Transfer Learning

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

Convolution

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