Research map / Optimization / Nonconvex and smooth optimization
On the regularization of Wasserstein GANs
Read the paperCheck your idea against 108,967 papers
AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.
Closest papers by meaning
- Adversarial Lipschitz Regularization (ICLR 2020 · similarity 0.95)
- Improved Training of Wasserstein GANs (NeurIPS 2017 · similarity 0.93)
- Lipschitz Generative Adversarial Nets (ICML 2019 · similarity 0.92)
- Improving the Improved Training of Wasserstein GANs: A Consistency Term and Its Dual Effect (ICLR 2018 · similarity 0.90)
- CHAIN: Enhancing Generalization in Data-Efficient GANs via lipsCHitz continuity constrAIned Normalization (CVPR 2024 · similarity 0.88)
- MS$^3$D: A RG Flow-Based Regularization for GAN Training with Limited Data (ICML 2024 · similarity 0.87)
Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.