ÍP
← All work
SciMLPINNsSPDEs

Chaos into Order (LEC)

A physics-informed network that learns the expected solution of a stochastic PDE directly, from sampled noise and the equation alone, with no pathwise solves, no discretization grid and no solution data.

In preparation · extends arXiv:2502.03670 · with María Óskarsdóttir

The interactive results page: the learned expected solution of a two-dimensional stochastic heat equation as a 3D surface, with noise paths drawn over it

The learned mean of a 2-D stochastic heat equation with Ornstein–Uhlenbeck noise, against the true mean (0.03% error at t = 0.05). In the explorer you can rotate it, switch method and noise, and overlay single noise paths.

The problem

Stochastic PDEs describe fields driven by noise: heat in a randomly forced medium, prices under random volatility, populations in a random environment. Often what's needed is the average behaviour, the expected solution E[u]. The standard route is Monte Carlo: solve the equation thousands of times, once per noise path, on a grid, and average. That gets expensive fast, especially as the dimension grows.

The idea: average the residual, then square it

LEC (Learned Expectation Collapser) trains one network on the PDE residual, but at every collocation point it averages the residual over a few fresh noise draws before squaring. The noise cancels in expectation, so the loss is minimized by E[u] itself rather than by any single noisy realization. Noise parameters are network inputs, so one trained model covers a whole family of noise processes.

Three heatmaps: the residual from one noise draw is speckle, the mean of ten draws is smoother, and the expected forcing is a smooth bump
One noise draw per point is pure speckle; averaging m draws shrinks it as 1/√m towards the expected forcing, the target the loss collapses to.

The extension: when the noise multiplies the solution

The original collapse needs the noise to enter additively. When it multiplies a coefficient of the equation, the noise and the solution become entangled, and the unmodified method converges to the wrong answer. The extension adds two methods:

Both come with an error estimate computed from training quantities only. It certifies a solution when the estimate is small and flags the cases it cannot trust, so failures are visible without knowing the answer.

Results

PreliminaryWork in progress and subject to change: the extension is in preparation, and the higher-dimensional runs are still going.

Median relative L2 error against a reference mean, over 128 random draws of the noise parameters per cell. Three noise processes (Brownian motion with drift, Ornstein–Uhlenbeck, compound Poisson), each in three shapes, nine drivers in all.

0.3%error with multiplicative noise at d = 2 (OU and telegraph drivers), where the unmodified method is off by 60–70%
< 1%median error for BC-LEC with Brownian and OU noise in every dimension tested, d = 1 to 6
Flaggedin every regime where it fails, the training-only estimate declines to certify
Driver (d = 2, three seeds)Noise-free baselineUnmodified LECBC-LEC
Ornstein–Uhlenbeck4.01%71%0.30%
Telegraph3.90%61%0.24%
Shot noise0.38%11%0.12%

Where it stops

Noise in the diffusion term with heavy tails is the hard case: with compound Poisson noise ASBC-LEC reaches 4–5%, and with its squared form it fails (31–38%). Some configurations have no finite mean at all. In each of these the method flags the result rather than reporting a confident wrong answer. Higher-dimensional runs (d = 8) are still in progress.