Two new algorithm families (controlled transport on path space and Wasserstein/JKO density evolution) for sampling posterior path measures without trajectory data, with theoretical consistency equations and toy experiments.
Conditioning Diffusions Using Malliavin Calculus
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
In generative modelling and stochastic optimal control, a central computational task is to modify a reference diffusion process to maximise a given terminal-time reward. Most existing methods require this reward to be differentiable, using gradients to steer the diffusion towards favourable outcomes. However, in many practical settings, like diffusion bridges, the reward is singular, taking an infinite value if the target is hit and zero otherwise. We introduce a novel framework, based on Malliavin calculus and centred around a generalisation of the Tweedie score formula to nonlinear stochastic differential equations, that enables the development of methods robust to such singularities. This allows our approach to handle a broad range of applications, like diffusion bridges, or adding conditional controls to an already trained diffusion model. We demonstrate that our approach offers stable and reliable training, outperforming existing techniques. As a byproduct, we also introduce a novel score matching objective. Our loss functions are formulated such that they could readily be extended to manifold-valued and infinite dimensional diffusions.
citation-role summary
citation-polarity summary
fields
stat.ML 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
unclear 1representative citing papers
citing papers explorer
-
Machine-Learned Sampling of Conditioned Path Measures
Two new algorithm families (controlled transport on path space and Wasserstein/JKO density evolution) for sampling posterior path measures without trajectory data, with theoretical consistency equations and toy experiments.