Properties and limitations of geometric tempering for gradient flow dynamics

We consider the problem of sampling from a probability distribution π. It is well known that this can be written as an optimisation problem over the space of probability distributions in which we aim to minimise the Kullback–Leibler divergence from π. We consider the effect of replacing π with a sequence of moving targets (πt)t≥0 defined via geometric tempering on the Wasserstein and Fisher–Rao gradient flows. We show that convergence occurs exponentially in continuous time, providing novel bounds in both cases. We also consider popular time discretisations and explore their convergence properties. We show that in the Fisher–Rao case, replacing the target distribution with a geometric mixture of initial and target distribution never leads to a convergence speed up both in continuous time and in discrete time. Finally, we explore the gradient flow structure of tempered dynamics and derive novel adaptive tempering schedules.