We construct a Wasserstein gradient flow of the maximum mean discrepancy (MMD) and study its convergence properties.
The MMD is an integral probability metric defined for a reproducing kernel Hilbert space (RKHS), and serves as a metric on probability measures for a sufficiently rich RKHS. We obtain conditions for convergence of the gradient flow towards a global optimum, that can be related to particle transport when optimizing neural networks.
We also propose a way to regularize this MMD flow, based on an injection of noise in the gradient. This algorithmic fix comes with theoretical and empirical evidence. The practical implementation of the flow is straightforward, since both the MMD and its gradient have simple closed-form expressions, which can be easily estimated with samples.

@InProceedings{Arbel:2018,
author = {Michael Arbel, Anna Korba, Adil Salim, Arthur Gretton},
title = {Maximum Mean Discrepancy Gradient Flow},
journal = {NeurIPS},
year = {2019},
url = {https://arxiv.org/abs/1906.04370},
}

Code

An implementation of the Wasserstein gradient flow of the Maximum Mean Discrepancy is available at: