Steering Diffusion Models to Rare Events
with Sequential Monte Carlo

Aavash Subedi1 Tim Reichelt1 Christopher Williams1 Philip Stier1 Yee Whye Teh1 Saifuddin Syed2
1University of Oxford 2University of British Columbia
Particle trajectories run from Gaussian noise on the right to data on the left. A red band at the top marks the rare event. Guidance pushes particles towards it, larger dots carry more weight, and red crosses mark particles removed by resampling.
DireSMC in one picture. Particles start as noise (right) and are denoised towards data (left). A guidance term nudges them towards the rare event E (red band). Dot size shows each particle's importance weight; low-weight particles are dropped and high-weight ones copied (red crosses). The weights that end up inside E give the probability estimate p0[E].
9× – 1413×

net speed-up over Monte Carlo on a climate emulator, growing with rarity

10−3 → 10−5

event probabilities recovered to within a few percent of the reference

No retraining

works at inference time with any pre-trained score model

The idea
In short
  • Rare events are where scientists most want answers: record heatwaves, failure modes, crop failures. Plain Monte Carlo needs roughly 1/p samples just to see one.
  • A diffusion model already walks from noise to data through a sequence of distributions. We use that walk as the bridge that classic rare-event methods have to build by hand.
  • DireSMC steers a population of particles towards the event and tracks importance weights as it goes. You get samples of the event and an unbiased estimate of its probability.

Why rare events are hard

Diffusion models now stand in for expensive simulators in weather and climate, molecular dynamics and materials design. They are cheap to sample, so the obvious way to estimate the probability of an event is to draw many samples and count.

That breaks down in the tails. The relative error of the Monte Carlo estimate is 1/√(N p), so an event with probability 10−5 needs about ten million samples for a 10% error bar. Most runs of a smaller budget see the event zero times.

Guidance can push a sampler towards the event, but on its own it changes the distribution you sample from. You get dramatic samples with no way to say how likely they are.

Method

Steering by changing the score

A diffusion model generates samples by integrating its score ∇x log pt from noise back to data, and it lands on the data distribution p0. Change the score and you land somewhere else. We add the gradient of a reward rt, chosen so that the new endpoint is the data distribution restricted to the rare event, p0(x | E).

∇x log pt + ∇x rt integrate x0 ~ p0(x | E)

Getting that reward right, and correcting for the fact that we can only approximate it, is the rest of the method. DireSMC is a sequential Monte Carlo sampler that runs inside the denoising process. It needs three ingredients, and each one fixes a specific problem.

Soften, steer, weigh

Soften

An event like φ(x) ≥ τ has an all-or-nothing indicator with zero gradient almost everywhere. We swap it for a smooth Gaussian-CDF reward that still points towards the event from outside it.

Steer

At each denoising step we look ahead to the model's guess of the clean sample (Tweedie's formula) and add the reward's gradient to the drift. For linear observables this look-ahead is closed-form.

Weigh

Every particle carries a weight that corrects for the steering. When the weights degenerate we resample and refresh particles with an MCMC move. The weights inside E estimate p0[E].

Left: the soft reward rises smoothly from 0 to 1 around the threshold tau, sharper for smaller delta. Right: the guidance strength is large below the threshold and falls off inside the event region.
The soft reward. Smaller widths δ approach the hard indicator (left). Outside the event the gradient stays large, so particles far from E are pushed hardest (right).
Results

Experiments

We test DireSMC on a Gaussian mixture where the exact answer is known, and on a pre-trained climate emulator.

Checking against an exact answer

We first test on a seven-mode Gaussian mixture where the true probability is known in closed form. Events of the form x1 ≥ τ range from about 7 × 10−3 down to 1.4 × 10−5.

DireSMC recovers the reference with both the analytical and a learned score. Its coefficient of variation stays flat as the event gets rarer, while Monte Carlo at the same budget gets steadily worse. We also compare with the importance-sampling estimator of Manshausen et al. (2026), which uses the probability-flow ODE: DireSMC has lower variance at equal compute and a much smaller discretisation bias.

Three panels. Left: coefficient of variation falls with the number of particles; DireSMC with MADM rejuvenation is lowest. Middle: at equal compute, DireSMC's error stays flat across rarities while Monte Carlo grows. Right: the ODE baseline overestimates the probability by up to 2.5 times at 50 steps; DireSMC stays near 1.
Gaussian mixture. Left: error falls as particles are added; resampling and MCMC rejuvenation (MADM) help most. Middle: at equal compute, error stays flat as the event gets rarer. Right: with exact guidance, the ratio of estimate to truth across step counts K; ours sits at 1.
Cite

BibTeX

@article{subedi2026diresmc,
  title   = {Steering Diffusion Models to Rare Events
             with Sequential Monte Carlo},
  author  = {Subedi, Aavash and Reichelt, Tim and Williams, Christopher
             and Stier, Philip and Teh, Yee Whye and Syed, Saifuddin},
  journal = {arXiv preprint},
  year    = {2026}
}