DICE: Discrete inverse continuity equation for learning population dynamics

Tobias Blickhan, Jules Berman, Andrew Stuart, Benjamin Peherstorfer
7/7/2025
cs.LGstat.ML

No confident code implementation found for this paper.

Abstract

We introduce the Discrete Inverse Continuity Equation (DICE) method, a generative modeling approach that learns the evolution of a stochastic process from given sample populations at a finite number of time points. Models learned with DICE capture the typically smooth and well-behaved population dynamics, rather than the dynamics of individual sample trajectories that can exhibit complex or even chaotic behavior. The DICE loss function is developed specifically to be invariant, even in discrete time, to spatially constant but time-varying spurious constants that can emerge during training; this invariance increases training stability and robustness. Generating a trajectory of sample populations with DICE is fast because samples evolve directly in the time interval over which the stochastic process is formulated, in contrast to approaches that condition on time and then require multiple sampling steps per time step. DICE is stable to train, in situations where other methods for learning population dynamics fail, and DICE generates representative samples with orders of magnitude lower costs than methods that have to condition on time. Numerical experiments on a wide range of problems from random waves, Vlasov-Poisson instabilities and high-dimensional chaos are included to justify these assertions.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. Any repos shown below are weak matches — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{blickhan2025dice,
  title  = {DICE: Discrete inverse continuity equation for learning population dynamics},
  author = {Tobias Blickhan and Jules Berman and Andrew Stuart and Benjamin Peherstorfer},
  year   = {2025},
  eprint = {2507.05107},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2507.05107v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2507.05107.svg)](https://codeofpaper.com/paper/2507.05107)

Discussion