{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/method/wgan","slug":"wgan","name":"WGAN","full_name":"Wasserstein GAN","full_name_withheld":false,"description_markdown":"**Wasserstein GAN**, or **WGAN**, is a type of generative adversarial network that minimizes an approximation of the Earth-Mover's distance (EM) rather than the Jensen-Shannon divergence as in the original [GAN](https://paperswithcode.com/method/gan) formulation. It leads to more stable training than original GANs with less evidence of mode collapse, as well as meaningful curves that can be used for debugging and searching hyperparameters.","description_state":"present","introduced_year":null,"introduced_by":{"title":"Wasserstein GAN","paper":"/paper/wasserstein-gan","first_author":"Martin Arjovsky","n_authors":3,"url_abs":null,"archive_paper_url":"https://paperswithcode.com/paper/wasserstein-gan"},"source":{"url":"http://arxiv.org/abs/1701.07875v3","title":"Wasserstein GAN","url_on_a_paper_host":true},"code_snippet_url":"https://github.com/daheyinyin/wgan","code_snippet_url_on_a_code_host":true,"categories":[{"area":"Computer Vision","area_id":"computer-vision","collection":"Generative Adversarial Networks","url":"/methods/category/generative-adversarial-networks","pwc_aliases":[]}],"n_papers_tagged":95,"archive_num_papers":95,"papers_newest_first":[{"paper":null,"slug":"time-series-surrogates-from-energy-consumers","title":"Time-series surrogates from energy consumers generated by machine learning approaches for long-term forecasting scenarios","date":"2025-06-25","arxiv_id":"2506.20253","n_code_links":0,"syntology":null},{"paper":null,"slug":"risk-management-with-feature-enriched","title":"Risk Management with Feature-Enriched Generative Adversarial Networks (FE-GAN)","date":"2024-11-23","arxiv_id":"2411.15519","n_code_links":0,"syntology":null},{"paper":null,"slug":"enhanced-anime-image-generation-using-use","title":"Enhanced Anime Image Generation Using USE-CMHSA-GAN","date":"2024-11-17","arxiv_id":"2411.11179","n_code_links":0,"syntology":null},{"paper":null,"slug":"concentration-inequalities-for-f-g-gans","title":"Statistical Error Bounds for GANs with Nonlinear Objective Functionals","date":"2024-06-24","arxiv_id":"2406.16834","n_code_links":0,"syntology":null},{"paper":null,"slug":"a-differential-equation-approach-for","title":"A Differential Equation Approach for Wasserstein GANs and Beyond","date":"2024-05-25","arxiv_id":"2405.16351","n_code_links":0,"syntology":null},{"paper":"/paper/s3r-net-a-single-stage-approach-to-self","slug":"s3r-net-a-single-stage-approach-to-self","title":"S3R-Net: A Single-Stage Approach to Self-Supervised Shadow Removal","date":"2024-04-18","arxiv_id":"2404.12103","n_code_links":1,"syntology":null},{"paper":null,"slug":"a-ct-image-denoising-method-with-residual","title":"A CT Image Denoising Method with Residual Encoder-Decoder Network","date":"2024-04-02","arxiv_id":"2404.01553","n_code_links":0,"syntology":null},{"paper":null,"slug":"generative-modeling-for-tabular-data-via","title":"Efficient Generative Modeling via Penalized Optimal Transport Network","date":"2024-02-16","arxiv_id":"2402.10456","n_code_links":0,"syntology":null},{"paper":"/paper/improving-eeg-signal-classification-accuracy","slug":"improving-eeg-signal-classification-accuracy","title":"Improving EEG Signal Classification Accuracy Using Wasserstein Generative Adversarial Networks","date":"2024-02-05","arxiv_id":"2402.09453","n_code_links":1,"syntology":null},{"paper":"/paper/adversarial-score-distillation-when-score","slug":"adversarial-score-distillation-when-score","title":"Adversarial Score Distillation: When score distillation meets GAN","date":"2023-12-01","arxiv_id":"2312.00739","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":0,"n_instrument":1,"unverified":0,"pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","official":{"repos":["2y7c3/asd"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/stroke-based-neural-painting-and-stylization","slug":"stroke-based-neural-painting-and-stylization","title":"Stroke-based Neural Painting and Stylization with Dynamically Predicted Painting Region","date":"2023-09-07","arxiv_id":"2309.03504","n_code_links":2,"syntology":null},{"paper":"/paper/comgan-toward-gans-exploiting-multiple","slug":"comgan-toward-gans-exploiting-multiple","title":"ComGAN: Toward GANs Exploiting Multiple Samples","date":"2023-04-24","arxiv_id":"2304.12098","n_code_links":1,"syntology":null},{"paper":"/paper/energy-guided-entropic-neural-optimal","slug":"energy-guided-entropic-neural-optimal","title":"Energy-guided Entropic Neural Optimal Transport","date":"2023-04-12","arxiv_id":"2304.06094","n_code_links":1,"syntology":{"ran":8,"of":11,"n_ran_checked":8,"n_instrument":0,"unverified":3,"pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 3 unverified","official":{"repos":["petrmokrov/energy-guided-entropic-ot"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":3,"ran_from_kinds":["official"]}}},{"paper":"/paper/diffusion-probabilistic-models-beat-gans-on","slug":"diffusion-probabilistic-models-beat-gans-on","title":"Diffusion Probabilistic Models beat GANs on Medical Images","date":"2022-12-14","arxiv_id":"2212.07501","n_code_links":1,"syntology":null},{"paper":"/paper/resolving-semantic-confusions-for-improved-1","slug":"resolving-semantic-confusions-for-improved-1","title":"Resolving Semantic Confusions for Improved Zero-Shot Detection","date":"2022-12-12","arxiv_id":"2212.06097","n_code_links":1,"syntology":null},{"paper":null,"slug":"dvgan-stabilize-wasserstein-gan-training-for","title":"DVGAN: Stabilize Wasserstein GAN training for time-domain Gravitational Wave physics","date":"2022-09-26","arxiv_id":"2209.13592","n_code_links":0,"syntology":null},{"paper":null,"slug":"mandarin-singing-voice-synthesis-with","title":"Mandarin Singing Voice Synthesis with Denoising Diffusion Probabilistic Wasserstein GAN","date":"2022-09-21","arxiv_id":"2209.10446","n_code_links":0,"syntology":null},{"paper":"/paper/kantorovich-strikes-back-wasserstein-gans-are","slug":"kantorovich-strikes-back-wasserstein-gans-are","title":"Kantorovich Strikes Back! Wasserstein GANs are not Optimal Transport?","date":"2022-06-15","arxiv_id":"2206.07767","n_code_links":2,"syntology":{"ran":8,"of":12,"n_ran_checked":8,"n_instrument":0,"unverified":4,"pointer_only":0,"phrase":"8 ran (of which 0 constructed an object rather than computing a result; 8 with no instrument failure: 0 honoured, 0 violated, 8 with no contract checked; 0 where Syntology's instrument failed) · 4 unverified","official":{"repos":["justkolesov/wasserstein1benchmark"],"state":"official (archive's flag): 8 ran","n_ran":8,"n_constructed":0,"n_ran_no_instrument_failure":8,"n_unverified":4,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"demand-response-method-considering-multiple","title":"Demand Response Method Considering Multiple Types of Flexible Loads in Industrial Parks","date":"2022-05-24","arxiv_id":"2205.11743","n_code_links":0,"syntology":null},{"paper":null,"slug":"alternative-data-augmentation-for-industrial","title":"Alternative Data Augmentation for Industrial Monitoring using Adversarial Learning","date":"2022-05-09","arxiv_id":"2205.04222","n_code_links":0,"syntology":null},{"paper":null,"slug":"limited-parameter-denoising-for-low-dose-x","title":"Limited Parameter Denoising for Low-dose X-ray Computed Tomography Using Deep Reinforcement Learning","date":"2022-03-28","arxiv_id":"2203.14794","n_code_links":0,"syntology":null},{"paper":"/paper/neural-network-training-under-semidefinite","slug":"neural-network-training-under-semidefinite","title":"Neural network training under semidefinite constraints","date":"2022-01-03","arxiv_id":"2201.00632","n_code_links":1,"syntology":null},{"paper":"/paper/gm-score-incorporating-inter-class-and-intra","slug":"gm-score-incorporating-inter-class-and-intra","title":"GM Score: Incorporating inter-class and intra-class generator diversity, discriminability of disentangled representation, and sample fidelity for evaluating GANs","date":"2021-12-13","arxiv_id":"2112.06431","n_code_links":1,"syntology":null},{"paper":"/paper/synthetic-ecg-signal-generation-using","slug":"synthetic-ecg-signal-generation-using","title":"Synthetic ECG Signal Generation Using Generative Neural Networks","date":"2021-12-05","arxiv_id":"2112.03268","n_code_links":1,"syntology":null},{"paper":"/paper/trust-the-critics-generatorless-and","slug":"trust-the-critics-generatorless-and","title":"Trust the Critics: Generatorless and Multipurpose WGANs with Initial Convergence Guarantees","date":"2021-11-30","arxiv_id":"2111.15099","n_code_links":1,"syntology":null},{"paper":"/paper/physics-driven-learning-of-wasserstein-gan","slug":"physics-driven-learning-of-wasserstein-gan","title":"Physics-Driven Learning of Wasserstein GAN for Density Reconstruction in Dynamic Tomography","date":"2021-10-28","arxiv_id":"2110.15424","n_code_links":1,"syntology":null},{"paper":"/paper/investigating-generative-neural-network","slug":"investigating-generative-neural-network","title":"Investigating generative neural-network models for building pest insect detectors in sticky trap images for the Peruvian horticulture","date":"2021-10-16","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":null,"slug":"dp-gan-alleviating-mode-collapse-in-gan-via","title":"Alleviating Mode Collapse in GAN via Diversity Penalty Module","date":"2021-08-05","arxiv_id":"2108.02353","n_code_links":0,"syntology":null},{"paper":null,"slug":"synthetic-periocular-iris-pai-from-a-small","title":"Synthetic Periocular Iris PAI from a Small Set of Near-Infrared-Images","date":"2021-07-26","arxiv_id":"2107.12014","n_code_links":0,"syntology":null},{"paper":null,"slug":"generalization-error-of-gan-from-the","title":"Generalization Error of GAN from the Discriminator's Perspective","date":"2021-07-08","arxiv_id":"2107.03633","n_code_links":0,"syntology":null},{"paper":null,"slug":"dtgan-differential-private-training-for","title":"DTGAN: Differential Private Training for Tabular GANs","date":"2021-07-06","arxiv_id":"2107.02521","n_code_links":0,"syntology":null},{"paper":null,"slug":"the-use-of-generative-adversarial-networks-to","title":"The use of Generative Adversarial Networks to characterise new physics in multi-lepton final states at the LHC","date":"2021-05-31","arxiv_id":"2105.14933","n_code_links":0,"syntology":null},{"paper":"/paper/few-shot-learning-via-tensor-hallucination","slug":"few-shot-learning-via-tensor-hallucination","title":"Few-shot learning via tensor hallucination","date":"2021-04-19","arxiv_id":"2104.09467","n_code_links":1,"syntology":null},{"paper":"/paper/stock-price-prediction-using-generative","slug":"stock-price-prediction-using-generative","title":"Stock price prediction using Generative Adversarial Networks","date":"2021-04-02","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":null,"slug":"approximation-for-probability-distributions","title":"Approximating Probability Distributions by using Wasserstein Generative Adversarial Networks","date":"2021-03-18","arxiv_id":"2103.10060","n_code_links":0,"syntology":null},{"paper":null,"slug":"wasserstein-gans-work-because-they-fail-to","title":"Wasserstein GANs Work Because They Fail (to Approximate the Wasserstein Distance)","date":"2021-03-02","arxiv_id":"2103.01678","n_code_links":0,"syntology":null},{"paper":"/paper/hyperbolic-generative-adversarial-network","slug":"hyperbolic-generative-adversarial-network","title":"Hyperbolic Generative Adversarial Network","date":"2021-02-10","arxiv_id":"2102.05567","n_code_links":0,"syntology":null},{"paper":null,"slug":"on-the-existence-of-optimal-transport","title":"On the Existence of Optimal Transport Gradient for Learning Generative Models","date":"2021-02-10","arxiv_id":"2102.05542","n_code_links":0,"syntology":null},{"paper":"/paper/re-reproducibility-report-of-interpretable","slug":"re-reproducibility-report-of-interpretable","title":"[Re] Reproducibility report of \"Interpretable Complex-Valued Neural Networks for Privacy Protection\"","date":"2021-01-31","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":null,"slug":"continual-learning-of-generative-models-with","title":"Continual Learning of Generative Models with Limited Data: From Wasserstein-1 Barycenter to Adaptive Coalescence","date":"2021-01-22","arxiv_id":"2101.09225","n_code_links":0,"syntology":null},{"paper":"/paper/sobolev-wasserstein-gan","slug":"sobolev-wasserstein-gan","title":"Towards Generalized Implementation of Wasserstein Distance in GANs","date":"2020-12-07","arxiv_id":"2012.03420","n_code_links":1,"syntology":null},{"paper":null,"slug":"statistical-analysis-of-wasserstein-gans-with","title":"Statistical analysis of Wasserstein GANs with applications to time series forecasting","date":"2020-11-05","arxiv_id":"2011.03074","n_code_links":0,"syntology":null},{"paper":null,"slug":"gans-for-learning-from-very-high-class","title":"GANs for learning from very high class conditional noisy labels","date":"2020-10-19","arxiv_id":"2010.09577","n_code_links":0,"syntology":null},{"paper":"/paper/tabular-gans-for-uneven-distribution","slug":"tabular-gans-for-uneven-distribution","title":"Tabular GANs for uneven distribution","date":"2020-10-01","arxiv_id":"2010.00638","n_code_links":1,"syntology":null},{"paper":null,"slug":"adaptive-wgan-with-loss-change-rate-balancing","title":"Accelerated WGAN update strategy with loss change rate balancing","date":"2020-08-28","arxiv_id":"2008.12463","n_code_links":0,"syntology":null},{"paper":"/paper/direct-adversarial-training-for-gans","slug":"direct-adversarial-training-for-gans","title":"A New Perspective on Stabilizing GANs training: Direct Adversarial Training","date":"2020-08-19","arxiv_id":"2008.09041","n_code_links":1,"syntology":{"ran":3,"of":3,"n_ran_checked":3,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["iceli1007/DAT-GAN"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/joint-low-dose-ct-denoising-and-kidney","slug":"joint-low-dose-ct-denoising-and-kidney","title":"Joint Low Dose CT Denoising And Kidney Segmentation","date":"2020-07-31","arxiv_id":null,"n_code_links":1,"syntology":null},{"paper":"/paper/mtss-gan-multivariate-time-series-simulation","slug":"mtss-gan-multivariate-time-series-simulation","title":"MTSS-GAN: Multivariate Time Series Simulation Generative Adversarial Networks","date":"2020-06-26","arxiv_id":null,"n_code_links":2,"syntology":null},{"paper":"/paper/flows-succeed-where-gans-fail-lessons-from","slug":"flows-succeed-where-gans-fail-lessons-from","title":"An Empirical Comparison of GANs and Normalizing Flows for Density Estimation","date":"2020-06-17","arxiv_id":"2006.10175","n_code_links":1,"syntology":{"ran":2,"of":3,"n_ran_checked":2,"n_instrument":0,"unverified":1,"pointer_only":0,"phrase":"2 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 0 violated, 2 with no contract checked; 0 where Syntology's instrument failed) · 1 unverified","official":{"repos":["lliutianc/gan-flow"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":2,"n_unverified":1,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"data-augmentation-for-enhancing-eeg-based","title":"Data Augmentation for Enhancing EEG-based Emotion Recognition with Deep Generative Models","date":"2020-06-04","arxiv_id":"2006.05331","n_code_links":0,"syntology":null},{"paper":"/paper/discriminator-contrastive-divergence-semi","slug":"discriminator-contrastive-divergence-semi","title":"Discriminator Contrastive Divergence: Semi-Amortized Generative Modeling by Exploring Energy of the Discriminator","date":"2020-04-05","arxiv_id":"2004.01704","n_code_links":1,"syntology":null},{"paper":"/paper/audio-inpainting-with-generative-adversarial","slug":"audio-inpainting-with-generative-adversarial","title":"Audio inpainting with generative adversarial network","date":"2020-03-13","arxiv_id":"2003.07704","n_code_links":1,"syntology":null},{"paper":null,"slug":"minimax-theorem-for-latent-games-or-how-i","title":"A Limited-Capacity Minimax Theorem for Non-Convex Games or: How I Learned to Stop Worrying about Mixed-Nash and Love Neural Nets","date":"2020-02-14","arxiv_id":"2002.05820","n_code_links":0,"syntology":null},{"paper":null,"slug":"study-of-constrained-network-structures-for","title":"Study of Constrained Network Structures for WGANs on Numeric Data Generation","date":"2019-11-05","arxiv_id":"1911.01649","n_code_links":0,"syntology":null},{"paper":"/paper/quantum-wasserstein-generative-adversarial","slug":"quantum-wasserstein-generative-adversarial","title":"Quantum Wasserstein Generative Adversarial Networks","date":"2019-10-31","arxiv_id":"1911.00111","n_code_links":1,"syntology":{"ran":1,"of":9,"n_ran_checked":1,"n_instrument":0,"unverified":8,"pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 8 unverified","official":{"repos":["yiminghwang/qWGAN"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":8,"ran_from_kinds":["official"]}}},{"paper":"/paper/bridging-the-gap-between-f-gans-and","slug":"bridging-the-gap-between-f-gans-and","title":"Bridging the Gap Between $f$-GANs and Wasserstein GANs","date":"2019-10-22","arxiv_id":"1910.09779","n_code_links":1,"syntology":{"ran":3,"of":3,"n_ran_checked":3,"n_instrument":0,"unverified":0,"pointer_only":3,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 3 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["ermongroup/f-wgan"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"wasserstein-gan-with-quadratic-transport-cost","title":"Wasserstein GAN With Quadratic Transport Cost","date":"2019-10-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"model-imitation-for-model-based-reinforcement","title":"Model Imitation for Model-Based Reinforcement Learning","date":"2019-09-25","arxiv_id":"1909.11821","n_code_links":0,"syntology":null},{"paper":null,"slug":"prediction-of-rare-feature-combinations-in","title":"Prediction of rare feature combinations in population synthesis: Application of deep generative modelling","date":"2019-09-17","arxiv_id":"1909.07689","n_code_links":0,"syntology":null},{"paper":"/paper/a-characteristic-function-approach-to-deep","slug":"a-characteristic-function-approach-to-deep","title":"A Characteristic Function Approach to Deep Implicit Generative Modeling","date":"2019-09-16","arxiv_id":"1909.07425","n_code_links":1,"syntology":{"ran":6,"of":12,"n_ran_checked":6,"n_instrument":0,"unverified":6,"pointer_only":1,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 0 where Syntology's instrument failed) · 6 unverified","official":{"repos":["crslab/OCFGAN"],"state":"official (archive's flag): 6 ran","n_ran":6,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":6,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"190503356","title":"QSMGAN: Improved Quantitative Susceptibility Mapping using 3D Generative Adversarial Networks with Increased Receptive Field","date":"2019-05-08","arxiv_id":"1905.03356","n_code_links":0,"syntology":null},{"paper":null,"slug":"deli-fisher-gan-stable-and-efficient-image","title":"Deli-Fisher GAN: Stable and Efficient Image Generation With Structured Latent Generative Space","date":"2019-05-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"generative-model-based-on-minimizing-exact","title":"Generative model based on minimizing exact empirical Wasserstein distance","date":"2019-05-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"local-stability-and-performance-of-simple-1","title":"Local Stability and Performance of Simple Gradient Penalty $\\mu$-Wasserstein GAN","date":"2019-05-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":"/paper/higan-cosmic-neutral-hydrogen-with-generative","slug":"higan-cosmic-neutral-hydrogen-with-generative","title":"HIGAN: Cosmic Neutral Hydrogen with Generative Adversarial Networks","date":"2019-04-29","arxiv_id":"1904.12846","n_code_links":1,"syntology":null},{"paper":null,"slug":"uu-nets-connecting-discriminator-and","title":"UU-Nets Connecting Discriminator and Generator for Image to Image Translation","date":"2019-04-04","arxiv_id":"1904.02675","n_code_links":0,"syntology":null},{"paper":"/paper/lipschitz-generative-adversarial-nets","slug":"lipschitz-generative-adversarial-nets","title":"Lipschitz Generative Adversarial Nets","date":"2019-02-15","arxiv_id":"1902.05687","n_code_links":1,"syntology":null},{"paper":"/paper/qp-wasserstein-gans-comparing-ground-metrics","slug":"qp-wasserstein-gans-comparing-ground-metrics","title":"(q,p)-Wasserstein GANs: Comparing Ground Metrics for Wasserstein GANs","date":"2019-02-10","arxiv_id":"1902.03642","n_code_links":1,"syntology":null},{"paper":"/paper/f-anogan-fast-unsupervised-anomaly-detection","slug":"f-anogan-fast-unsupervised-anomaly-detection","title":"f-AnoGAN: Fast Unsupervised Anomaly Detection with Generative Adversarial Networks","date":"2019-01-30","arxiv_id":null,"n_code_links":3,"syntology":null},{"paper":"/paper/how-can-we-make-gan-perform-better-in-single","slug":"how-can-we-make-gan-perform-better-in-single","title":"How Can We Make GAN Perform Better in Single Medical Image Super-Resolution? A Lesion Focused Multi-Scale Approach","date":"2019-01-10","arxiv_id":"1901.03419","n_code_links":2,"syntology":null},{"paper":"/paper/on-relativistic-f-divergences","slug":"on-relativistic-f-divergences","title":"On Relativistic $f$-Divergences","date":"2019-01-08","arxiv_id":"1901.02474","n_code_links":1,"syntology":null},{"paper":"/paper/rankgan-a-maximum-margin-ranking-gan-for","slug":"rankgan-a-maximum-margin-ranking-gan-for","title":"RankGAN: A Maximum Margin Ranking GAN for Generating Faces","date":"2018-12-19","arxiv_id":"1812.08196","n_code_links":1,"syntology":null},{"paper":null,"slug":"a-wasserstein-gan-model-with-the-total","title":"A Wasserstein GAN model with the total variational regularization","date":"2018-12-03","arxiv_id":"1812.00810","n_code_links":0,"syntology":null},{"paper":"/paper/metropolis-hastings-generative-adversarial","slug":"metropolis-hastings-generative-adversarial","title":"Metropolis-Hastings Generative Adversarial Networks","date":"2018-11-28","arxiv_id":"1811.11357","n_code_links":4,"syntology":{"ran":6,"of":10,"n_ran_checked":4,"n_instrument":2,"unverified":4,"pointer_only":3,"phrase":"6 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 2 honoured, 1 violated, 1 with no contract checked; 2 where Syntology's instrument failed) · 4 unverified","official":{"repos":["uber-research/metropolis-hastings-gans"],"state":"official (archive's flag): 2 ran","n_ran":2,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["listed","official"]}}},{"paper":null,"slug":"physics-aware-deep-generative-models-for","title":"Physics-aware Deep Generative Models for Creating Synthetic Microstructures","date":"2018-11-21","arxiv_id":"1811.09669","n_code_links":0,"syntology":null},{"paper":"/paper/gan-qp-a-novel-gan-framework-without-gradient","slug":"gan-qp-a-novel-gan-framework-without-gradient","title":"GAN-QP: A Novel GAN Framework without Gradient Vanishing and Lipschitz Constraint","date":"2018-11-18","arxiv_id":"1811.07296","n_code_links":4,"syntology":null},{"paper":"/paper/deep-bayesian-inversion","slug":"deep-bayesian-inversion","title":"Deep Bayesian Inversion","date":"2018-11-14","arxiv_id":"1811.05910","n_code_links":1,"syntology":null},{"paper":null,"slug":"local-stability-and-performance-of-simple","title":"Local Stability and Performance of Simple Gradient Penalty mu-Wasserstein GAN","date":"2018-10-05","arxiv_id":"1810.02528","n_code_links":0,"syntology":null},{"paper":"/paper/gans-beyond-divergence-minimization","slug":"gans-beyond-divergence-minimization","title":"GANs beyond divergence minimization","date":"2018-09-06","arxiv_id":"1809.02145","n_code_links":1,"syntology":null},{"paper":null,"slug":"a-two-step-computation-of-the-exact-gan","title":"A Two-Step Computation of the Exact GAN Wasserstein Distance","date":"2018-07-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"training-discriminative-models-to-evaluate","title":"Training Discriminative Models to Evaluate Generative Ones","date":"2018-06-28","arxiv_id":"1806.10840","n_code_links":0,"syntology":null},{"paper":"/paper/banach-wasserstein-gan","slug":"banach-wasserstein-gan","title":"Banach Wasserstein GAN","date":"2018-06-18","arxiv_id":"1806.06621","n_code_links":2,"syntology":null},{"paper":null,"slug":"language-modeling-with-generative","title":"Language Modeling with Generative AdversarialNetworks","date":"2018-04-08","arxiv_id":"1804.02617","n_code_links":0,"syntology":null},{"paper":"/paper/improving-the-improved-training-of","slug":"improving-the-improved-training-of","title":"Improving the Improved Training of Wasserstein GANs: A Consistency Term and Its Dual Effect","date":"2018-03-05","arxiv_id":"1803.01541","n_code_links":1,"syntology":null},{"paper":null,"slug":"robust-gans-against-dishonest-adversaries","title":"Robust GANs against Dishonest Adversaries","date":"2018-02-27","arxiv_id":"1802.09700","n_code_links":0,"syntology":null},{"paper":null,"slug":"classification-of-sparsely-labeled-spatio","title":"Classification of sparsely labeled spatio-temporal data through semi-supervised adversarial learning","date":"2018-01-26","arxiv_id":"1801.08712","n_code_links":0,"syntology":null},{"paper":null,"slug":"deep-lipschitz-networks-and-dudley-gans","title":"Deep Lipschitz networks and Dudley GANs","date":"2018-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"manifold-valued-image-generation-with","title":"Manifold-valued Image Generation with Wasserstein Generative Adversarial Nets","date":"2017-12-05","arxiv_id":"1712.01551","n_code_links":0,"syntology":null},{"paper":"/paper/training-gans-with-optimism","slug":"training-gans-with-optimism","title":"Training GANs with Optimism","date":"2017-10-31","arxiv_id":"1711.00141","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":0,"n_instrument":1,"unverified":0,"pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","official":{"repos":["vsyrgkanis/optimistic_GAN_training"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"a-geometric-view-of-optimal-transportation","title":"A Geometric View of Optimal Transportation and Generative Model","date":"2017-10-16","arxiv_id":"1710.05488","n_code_links":0,"syntology":null},{"paper":null,"slug":"statistics-of-deep-generated-images","title":"Statistics of Deep Generated Images","date":"2017-08-09","arxiv_id":"1708.02688","n_code_links":0,"syntology":null},{"paper":null,"slug":"wasserstein-generative-adversarial-networks","title":"Wasserstein Generative Adversarial Networks","date":"2017-08-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"linear-discriminant-generative-adversarial","title":"Linear Discriminant Generative Adversarial Networks","date":"2017-07-25","arxiv_id":"1707.07831","n_code_links":0,"syntology":null},{"paper":"/paper/gang-of-gans-generative-adversarial-networks","slug":"gang-of-gans-generative-adversarial-networks","title":"Gang of GANs: Generative Adversarial Networks with Maximum Margin Ranking","date":"2017-04-17","arxiv_id":"1704.04865","n_code_links":1,"syntology":null},{"paper":"/paper/wasserstein-gan","slug":"wasserstein-gan","title":"Wasserstein GAN","date":"2017-01-26","arxiv_id":"1701.07875","n_code_links":120,"syntology":{"ran":16,"of":22,"n_ran_checked":4,"n_instrument":12,"unverified":6,"pointer_only":13,"phrase":"16 ran (of which 0 constructed an object rather than computing a result; 4 with no instrument failure: 1 honoured, 0 violated, 3 with no contract checked; 12 where Syntology's instrument failed) · 6 unverified","official":null}}],"papers_shown":95,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":95,"with_a_code_link":45,"where_syntology_ran_a_sample":11,"not_listed_spam_title":0,"listed":95,"listed_where_code_ran":11,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":9,"every_run_a_failure_of_syntologys_instrument":2,"listed_with_a_run_with_no_instrument_failure":9,"listed_every_run_a_failure_of_syntologys_instrument":2,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"papers_where_code_ran":11,"papers_where_code_ran_first_page":"/method/wgan/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not isolate this method inside it.","pages":[{"order":"ran","page":1,"of":1,"url":"/method/wgan/papers/ran/1","json":"/method/wgan/papers/ran/1.json","rows":11}],"tasks":[{"task":null,"name":"Generative Adversarial Network","papers":24},{"task":"/task/image-generation","name":"Image Generation","papers":15},{"task":"/task/denoising","name":"Denoising","papers":7},{"task":"/task/data-augmentation","name":"Data Augmentation","papers":4},{"task":"/task/diversity","name":"Diversity","papers":4},{"task":"/task/image-to-image-translation","name":"Image-to-Image Translation","papers":4},{"task":"/task/time-series-1","name":"Time Series","papers":4},{"task":"/task/time-series","name":"Time Series Analysis","papers":4},{"task":"/task/synthetic-data-generation","name":"Synthetic Data Generation","papers":3},{"task":"/task/translation","name":"Translation","papers":3},{"task":null,"name":"CPU","papers":2},{"task":"/task/decoder","name":"Decoder","papers":2},{"task":"/task/eeg-1","name":"EEG","papers":2},{"task":"/task/classification","name":"General Classification","papers":2},{"task":"/task/image-denoising","name":"Image Denoising","papers":2},{"task":"/task/image-reconstruction","name":"Image Reconstruction","papers":2},{"task":"/task/management","name":"Management","papers":2},{"task":"/task/ssim","name":"SSIM","papers":2},{"task":"/task/super-resolution","name":"Super-Resolution","papers":2},{"task":"/task/transfer-learning","name":"Transfer Learning","papers":2}],"tasks_shown":20,"n_tasks":85,"usage_by_year":[{"year":"2017","papers":8},{"year":"2018","papers":16},{"year":"2019","papers":18},{"year":"2020","papers":13},{"year":"2021","papers":18},{"year":"2022","papers":9},{"year":"2023","papers":4},{"year":"2024","papers":8},{"year":"2025","papers":1}],"row_source":"methods_table","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/wgan"},"syntology_read_at":"2026-10-05T00:36:11+00:00","syntology":{"source":"Syntology's have check for this name (the free coverage lookup), read from Syntology's graph","have_url":"https://syntology.ai/api/graph/have?x=WGAN","read_at":"2026-10-05T01:03:55+00:00","query":"WGAN","kind":"method","have":"unknown_name","tier":null,"verified_implementation":null,"level":null,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":null,"resolution":null,"resolved_name_differs":false,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":null,"archive_paper_arxiv_id":"1701.07875","repositories":null,"retrieve_with":null,"name_competition":{"verdict":"none","may_be_wrong_sense":false,"bearers_found":0,"served":null,"leading_other_bearer":null,"n_other_bearers_listed":0,"note":"Nothing in this corpus is named 'WGAN' -- no method node, no paper announcing it in its title, no expanded form declaring it as an acronym."},"name_competition_text":null,"near_matches":["GS-WGAN","SA-WGAN-GP","JS-WGAN-GP","SA-JS-WGAN-GP","WGAN-gp Transformer","Hybrid WGAN-GA Approach","physics-informed Wasserstein GAN with gradient penalty (WGAN-GP)"],"code_nearby":[],"code_nearby_caption":null,"origin_paper":null,"line":"name not resolved (unknown_name). The lookup matched no method, paper or venue by this name; that asserts nothing about whether code exists.","level_legend":null},"syntology_have_state":"loaded","record_sha256":"3b7553a0c6607474cc791fe4aca2e314803990a0a8fdf98f0361b2a8a0af98f5","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}