SAN: Inducing Metrizability of GAN with Discriminative Normalized Linear Layer
Yuhta Takida, Masaaki Imaizumi, Takashi Shibuya, Chieh-Hsin Lai, Toshimitsu Uesaka, Naoki Murata, Yuki Mitsufuji
Abstract
Generative adversarial networks (GANs) learn a target probability distribution by optimizing a generator and a discriminator with minimax objectives. This paper addresses the question of whether such optimization actually provides the generator with gradients that make its distribution close to the target distribution. We derive metrizable conditions, sufficient conditions for the discriminator to serve as the distance between the distributions, by connecting the GAN formulation with the concept of sliced optimal transport. Furthermore, by leveraging these theoretical results, we propose a novel GAN training scheme called the Slicing Adversarial Network (SAN). With only simple modifications, a broad class of existing GANs can be converted to SANs. Experiments on synthetic and image datasets support our theoretical results and the effectiveness of SAN as compared to the usual GANs. We also apply SAN to StyleGAN-XL, which leads to a stateof-the-art FID score amongst GANs for class conditional generation on CIFAR10 and ImageNet 256×256. Our implementation is available on the project page https://ytakida.github.io/san/ .
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Cited by top-tier papers4
- The GAN is dead; long live the GAN! A Modern GAN BaselineNick Huang, Aaron Gokaslan, Volodymyr Kuleshov, James TompkinNeurIPS 2024 · 111 citations
- Neon: Negative Extrapolation From Self-Training Improves Image GenerationSina Alemohammad, Zhangyang Wang, Richard BaraniukICLR 2026 · 5 citations
- Community Forensics: Using Thousands of Generators to Train Fake Image DetectorsJeongsoo Park, Andrew OwensCVPR 2025
- SONA: Learning Conditional, Unconditional, and Matching-Aware DiscriminatorYuhta Takida, Satoshi Hayakawa, Takashi Shibuya, Masaaki Imaizumi et al.ICLR 2026
Builds on30
- Learning Transferable Visual Models From Natural Language SupervisionAlec Radford, Jong Wook Kim, Chris Hallacy, Aditya Ramesh et al.ICML 2021 · 47,906 citations
- Denoising Diffusion Probabilistic ModelsJonathan Ho, Ajay Jain, Pieter AbbeelNeurIPS 2020 · 35,902 citations
- Denoising Diffusion Implicit ModelsJiaming Song, Chenlin Meng, Stefano ErmonICLR 2021 · 11,743 citations
- Training data-efficient image transformers & distillation through attentionHugo Touvron, Matthieu Cord, Matthijs Douze, Francisco Massa et al.ICML 2021 · 8,974 citations
- Improved Denoising Diffusion Probabilistic ModelsAlexander Quinn Nichol, Prafulla DhariwalICML 2021 · 5,234 citations
Related papers
- Bridging the Gap Between f-GANs and Wasserstein GANsJiaming Song, Stefano ErmonICML 2020 · 45 citations
- Run-Sort-ReRun: Escaping Batch Size Limitations in Sliced Wasserstein Generative ModelsJosé Lezama, Wei Chen, Qiang QiuICML 2021 · 9 citations
- A Unified View of cGANs with and without ClassifiersSi-An Chen, Chun-Liang Li, Hsuan-Tien LinNeurIPS 2021 · 12 citations
- Spider GAN: Leveraging Friendly Neighbors to Accelerate GAN TrainingSiddarth Asokan, Chandra Sekhar SeelamantulaCVPR 2023
- Wasserstein-2 Generative NetworksAlexander Korotin, Vage Egiazarian, Arip Asadulaev, Alexander Safin et al.ICLR 2021 · 128 citations
