On the Gradient Formula for learning Generative Models with Regularized Optimal Transport Costs - Archive ouverte HAL Access content directly
Preprints, Working Papers, ... Year :

On the Gradient Formula for learning Generative Models with Regularized Optimal Transport Costs

(1) , (1) , (1) , (2)
1
2

Abstract

The use of optimal transport costs for learning generative models has become popular with Wasserstein Generative Adversarial Networks (WGANs). Training a WGAN requires the computation of the differentiation of the optimal transport cost with respect to the parameters of the generative model. In this work, we provide sufficient conditions for the existence of a gradient formula in two different frameworks: the case of semi-discrete optimal transport (i.e. with a discrete target distribution) and the case of regularized optimal transport (i.e. with an entropic penalty). Both cases are based on the dual formulation of the transport cost, and the gradient formula involves a solution of the dual problem. The learning problem is addressed with an alternate algorithm, whose behavior is examined for the problem of MNIST digits generation. In particular, we analyze the impact of entropic regularization both on visual results and convergence speed.
Fichier principal
Vignette du fichier
gradient_wgan_tmlr_preprint.pdf (1.45 Mo) Télécharger le fichier
Origin : Files produced by the author(s)

Dates and versions

hal-03740368 , version 1 (29-07-2022)

Identifiers

  • HAL Id : hal-03740368 , version 1

Cite

Antoine Houdard, Arthur Leclaire, Nicolas Papadakis, Julien Rabin. On the Gradient Formula for learning Generative Models with Regularized Optimal Transport Costs. 2022. ⟨hal-03740368⟩
28 View
29 Download

Share

Gmail Facebook Twitter LinkedIn More