mlsanityData to 7 Oct 2026

Sinkhorn-Drifting Generative Models

arXiv 2603.12366 ↗First posted 12 Mar 2026cs.LGcited by 20

Not on the map. Why?

Abstract (arXiv)

We establish a theoretical link between the recently proposed "drifting" generative dynamics and gradient flows induced by the Sinkhorn divergence. In a particle discretization, the drift field admits a cross-minus-self decomposition: an attractive term toward the target distribution and a repulsive/self-correction term toward the current model, both expressed via one-sided normalized Gibbs kernels. We show that Sinkhorn divergence yields an analogous cross-minus-self structure, but with each term defined by entropic optimal-transport couplings obtained through two-sided Sinkhorn scaling (i.e., enforcing both marginals). This provides a precise sense in which drifting acts as a surrogate for a Sinkhorn-divergence gradient flow, interpolating between one-sided normalization and full two-sided Sinkhorn scaling. Crucially, this connection resolves an identifiability gap in prior drifting formulations: leveraging the definiteness of the Sinkhorn divergence, we show that zero drift (equilibrium of the dynamics) implies that the model and target measures match. Experiments show that Sinkhorn drifting reduces sensitivity to kernel temperature and improves one-step generative quality, trading off additional training time for a more stable optimization, without altering the inference procedure used by drift methods. These theoretical gains translate to strong low-temperature improvements in practice: on FFHQ-ALAE at the lowest temperature setting we evaluate, Sinkhorn drifting reduces mean FID from 187.7 to 37.1 and mean latent EMD from 453.3 to 144.4, while on MNIST it preserves full class coverage across the temperature sweep. Project page: https://mint-vu.github.io/SinkhornDrifting/

Key facts. Cited by 20 papers in the map (data through 7 Oct 2026). Builds on 10 of its 19 references that are in the map. First posted on arXiv 12 Mar 2026.

Builds on

10 of 19 references.

References · 10

  1. 2018A Style-Based Generator Architecture for Generative Adversarial Networkscited by 5,986
  2. 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,277
  3. 2017Learning Generative Models with Sinkhorn Divergencescited by 310
  4. 2017MMD GAN: Towards Deeper Understanding of Moment Matching Networkcited by 251
  5. 2020Adversarial Latent Autoencoderscited by 155
  6. 2018Improving GANs Using Optimal Transportcited by 122
  7. 2026Generative Modeling via Driftingcited by 98
  8. 2021Entropic estimation of optimal transport mapscited by 87
  9. 2017Coulomb GANs: Provably Optimal Nash Equilibria via Potential Fieldscited by 20
  10. 2017Overrelaxed Sinkhorn-Knopp Algorithm for Regularized Optimal Transportcited by 16

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2026: 20.

20 papers.

Sort:

By area: