2025/07/06 by Crucinio, Francesca Romana · 1 citation
#Computation (stat.CO) #FOS: Computer and information sciences #FOS: Mathematics #Machine Learning (cs.LG) #Methodology (stat.ME) #Statistics Theory (math.ST)
paper · doi:10.48550/arxiv.2507.04330
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 distribution in which we aim to minimise a divergence from π. and The optimisation problem is normally solved through gradient flows in the space of probability distribution 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 π.