加载中…
We consider the problem of sampling from a probability distribution which admits a density w.r.t. a dominating measure. 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 a divergence from . The optimisation problem is normally solved through gradient flows in the space of probability distributions with an appropriate metric. We show that the Kullback–Leibler divergence is the only divergence in the family of Bregman divergences whose gradient flow w.r.t. many popular metrics does not require knowledge of the normalising constant of .

生成讲解博客的中文版本

生成AI智能校验的中文版本