mlsanityData to 14 Oct 2026

Trust the Critics: Generatorless and Multipurpose WGANs with Initial Convergence Guarantees

arXiv 2111.15099 ↗First posted 30 Nov 2021cs.LG cs.CV cs.NEcited by 1

Not on the map. Why?

Abstract (arXiv)

Inspired by ideas from optimal transport theory we present Trust the Critics (TTC), a new algorithm for generative modelling. This algorithm eliminates the trainable generator from a Wasserstein GAN; instead, it iteratively modifies the source data using gradient descent on a sequence of trained critic networks. This is motivated in part by the misalignment which we observed between the optimal transport directions provided by the gradients of the critic and the directions in which data points actually move when parametrized by a trainable generator. Previous work has arrived at similar ideas from different viewpoints, but our basis in optimal transport theory motivates the choice of an adaptive step size which greatly accelerates convergence compared to a constant step size. Using this step size rule, we prove an initial geometric convergence rate in the case of source distributions with densities. These convergence rates cease to apply only when a non-negligible set of generated data is essentially indistinguishable from real data. Resolving the misalignment issue improves performance, which we demonstrate in experiments that show that given a fixed number of training epochs, TTC produces higher quality images than a comparable WGAN, albeit at increased memory requirements. In addition, TTC provides an iterative formula for the transformed density, which traditional WGANs do not. Finally, TTC can be applied to map any source distribution onto any target; we demonstrate through experiments that TTC can obtain competitive performance in image generation, translation, and denoising without dedicated algorithms.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 27 of its 44 references that are in the map. First posted on arXiv 30 Nov 2021.

Builds on

27 of 44 references.

References · 27

  1. 2014Adam: A Method for Stochastic Optimizationcited by 37,240
  2. 2018A Style-Based Generator Architecture for Generative Adversarial Networkscited by 6,013
  3. 2017Fashion-MNIST: a Novel Image Dataset for Benchmarking Machine Learning Algorithmscited by 4,349
  4. 2018Neural Ordinary Differential Equationscited by 3,779
  5. 2017Improved Training of Wasserstein GANscited by 2,235
  6. 2015Variational Inference with Normalizing Flowscited by 2,170
  7. 2015Unsupervised Representation Learning with Deep Convolutional Generative Adversarial Networkscited by 2,054
  8. 2018Spectral Normalization for Generative Adversarial Networkscited by 1,636
  9. 2020Training Generative Adversarial Networks with Limited Datacited by 1,186
  10. 2014NICE: Non-linear Independent Components Estimationcited by 1,058
  11. 2016InfoGAN: Interpretable Representation Learning by Information Maximizing Generative Adversarial Netscited by 860
  12. 2018FFJORD: Free-form Continuous Dynamics for Scalable Reversible Generative Modelscited by 594
15 more
  1. 2015A note on the evaluation of generative modelscited by 292
  2. 2017Are GANs Created Equal? A Large-Scale Studycited by 267
  3. 2020How to train your neural ODE: the world of Jacobian and kinetic regularizationcited by 228
  4. 2020OT-Flow: Fast and Accurate Continuous Normalizing Flows via Optimal Transportcited by 143
  5. 2019Noisier2Noise: Learning to Denoise from Unpaired Noisy Datacited by 126
  6. 2018Adversarial Regularizers in Inverse Problemscited by 103
  7. 2017On the regularization of Wasserstein GANscited by 65
  8. 2018On the Convergence and Robustness of Training GANs with Regularized Optimal Transportcited by 51
  9. 2020Sliced Iterative Normalizing Flowscited by 38
  10. 2019Deep Generative Learning via Variational Gradient Flowcited by 32
  11. 2021End-to-end reconstruction meets data-driven regularization for inverse problemscited by 32
  12. 2017Wasserstein Introspective Neural Networkscited by 18
  13. 2018Composite Functional Gradient Learning of Generative Adversarial Modelscited by 6
  14. 2021Wasserstein GANs with Gradient Penalty Compute Congested Transportcited by 6
  15. 2018Gradient Layer: Enhancing the Convergence of Adversarial Training for Generative Modelscited by 5

Built on by

Cited by year

Citing papers per year: 2022: 1.

1 paper.