Pith. sign in

REVIEW 2 cited by

Conditioning Diffusions Using Malliavin Calculus

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2504.03461 v2 pith:4FPTV4S2 submitted 2025-04-04 stat.ML cs.LGmath.PR

classification stat.MLcs.LGmath.PR
keywords diffusionrewardapproachbridgescalculusdiffusionsexistinginfinite
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original 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.

Discussion (0). Sign in to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Conditional Diffusion Guidance under Hard Constraint: A Stochastic Analysis Approach

    cs.AI 2026-02 conditional novelty 6.0 of 10

    By adding drift g(t)^2 ∇log h(t,y) with h estimated via martingale and covariation losses, diffusion samples can be hard-conditioned on an event.

  2. Machine-Learned Sampling of Conditioned Path Measures

    stat.ML 2025-06 conditional novelty 6.0 of 10

    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.

Pith tools