Papers › Sequential Monte Carlo approximations of Wasserstein--Fisher--Rao gradient flows

Sequential Monte Carlo approximations of Wasserstein--Fisher--Rao gradient flows

6 Jun 2025arXiv:2506.05905archive 2025-07-28

Francesca R. Crucinio, Sahani Pathiraja

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 the Kullback--Leibler divergence from π. We consider several partial differential equations (PDEs) whose solution is a minimiser of the Kullback--Leibler divergence from π and connect them to well-known Monte Carlo algorithms. We focus in particular on PDEs obtained by considering the Wasserstein--Fisher--Rao geometry over the space of probabilities and show that these lead to a natural implementation using importance sampling and sequential Monte Carlo. We propose a novel algorithm to approximate the Wasserstein--Fisher--Rao flow of the Kullback--Leibler divergence which empirically outperforms the current state-of-the-art. We study tempered versions of these PDEs obtained by replacing the target distribution with a geometric mixture of initial and target distribution and show that these do not lead to a convergence speed up.

PaperPDFCode

In Syntology View this paper on Syntology, its page in Syntology's graph. That page lists the repositories linked to the paper, the abstract and the calls for agents.

Open this paper in Syntology's Atlas, the map of the papers in Syntology's graph and their citations.

For agents, on Syntology's MCP service (how to connect):

Code

FrancescaCrucinio/SMC-WFR officialmentioned in papermentioned on GitHubSyntology: no sample linked to this paper (harvested for another paper). Syntology's graph links these samples to Properties and limitations of geometric tempering for gradient flow dynamics (arXiv:2604.20301; that paper's own run record: 15 ran (of which 0 constructed an object rather than computing a result; 15 with no instrument failure: 1 honoured, 4 violated, 10 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified); nothing checks that they implement this paper's method. report

Repository list and official/mentioned flags are the archive's, frozen 2025-07-28. Reachability, where shown, is from one Syntology probe window (2026-09-16 to 2026-09-18); repositories not probed show nothing. GitHub stars are not tracked.

A paper named beside a repository with no sample linked to this paper is shown with that paper's own run record, not this paper's: “ran” means executed on a synthesized input, not that the code is correct, and “where Syntology's instrument failed” counts failures of Syntology's instrument, not of the code. Papers are listed in arXiv-id order, at most three per repository.

Code Syntology ran Syntology

Not run by Syntology. Nothing on this page verifies that the listed code works.

Results from the paper archive 2025-07-28

No leaderboard rows for this paper in the archive.

Methods

FocusSPEED

Report a problem or propose a change · a person checks every report against the paper or source before anything changes; decisions are listed on /corrections