DICE: Discrete Inverse Continuity Equation

• DICE is a generative method that reconstructs population dynamics from finite time marginals by inverting the continuity equation using a scalar potential.
• It employs a discrete weak formulation that enforces a minimum-kinetic-energy criterion and invariance to spatially constant, time-varying shifts to stabilize training.
• The approach generates trajectories by integrating an optimal gradient field, offering efficiency and robustness compared to time-conditioned or Neural ODE based methods.

Searching arXiv for the specified DICE paper and any directly relevant related work to support the encyclopedia entry. Discrete Inverse Continuity Equation (DICE) is a generative modeling method for learning the evolution of a stochastic process from sample populations observed at a finite set of time points. Rather than fitting the dynamics of individual sample trajectories, which may be complex or chaotic, DICE learns population-level, Eulerian dynamics by inverting the continuity equation and selecting the minimum-kinetic-energy velocity field compatible with the observed marginals. The method parameterizes a scalar potential $s:[0,T]\times\mathcal X\to\mathbb R$, uses the gradient field $u=\nabla s$ as the advecting velocity, and is designed so that its discrete-time loss remains invariant to spatially constant but time-varying additive functions. This invariance is central to its training stability, well-posedness, and robustness, and the resulting models generate trajectories of sample populations by direct evolution over physical time rather than by repeated time-conditioned inference (Blickhan et al., 7 Jul 2025).

1. Problem setting and modeling objective

DICE considers a stochastic process $X(t)\in\mathcal X$ with law $\rho(t)\in\mathcal P(\mathcal X)$, where $\mathcal X$ is either a bounded, connected, open subset of $\mathbb R^d$ or the flat torus $\mathbb T^d$. When $\rho(t)$ is viewed as a density, it is written as $\rho(t,\cdot):\mathcal X\to\mathbb R$ with value $\rho(t,x)$. The boundary conditions are either tangential velocity at $u=\nabla s$0 in the bounded-domain case, corresponding to a no-flux condition, or periodic boundary conditions when $u=\nabla s$1 (Blickhan et al., 7 Jul 2025).

The method is formulated for the regime in which one observes unpaired samples from the time marginals $u=\nabla s$2 at finitely many times $u=\nabla s$3. Its objective is not to identify Lagrangian trajectories of particular particles or agents. Instead, it reconstructs a population transport consistent with the observed marginals and constrained by a minimum-energy principle. This distinction is essential: the paper emphasizes that population dynamics can be smooth and well-behaved even when individual trajectories exhibit high-dimensional chaos or other complicated behavior.

A standing assumption is a Poincaré inequality for each time $u=\nabla s$4: for any Lipschitz $u=\nabla s$5,

$u=\nabla s$6

where $u=\nabla s$7 is the Poincaré constant. This assumption underpins the existence, uniqueness, and lower-boundedness results developed for the discrete variational problem.

The learned transport is defined through a potential $u=\nabla s$8 whose gradient yields the velocity field,

$u=\nabla s$9

and the admissible transport is selected by minimizing the kinetic energy

$X(t)\in\mathcal X$0

The minimum-energy compatible field is a gradient field. DICE therefore identifies the tangent component of the transport and excludes divergence-free components. A plausible implication is that the method is intrinsically aligned with Eulerian marginal evolution rather than with any specific microscopic realization.

2. Continuity-equation inversion and the discrete weak formulation

The starting point is the continuity equation in weak form: $X(t)\in\mathcal X$1 for all smooth, compactly supported test functions $X(t)\in\mathcal X$2. When regularity is sufficient, this corresponds to the strong form

$X(t)\in\mathcal X$3

Under the minimum-energy criterion, the compatible field takes the gradient form

$X(t)\in\mathcal X$4

and the potential satisfies the formal elliptic equation

$X(t)\in\mathcal X$5

This leads to the continuous-time variational problem

$X(t)\in\mathcal X$6

For sample-based estimation, the source term is rewritten as

$X(t)\in\mathcal X$7

yielding an objective expressed purely through expectations: $X(t)\in\mathcal X$8

DICE discretizes this inverse problem directly at the weak level. With time grid $X(t)\in\mathcal X$9 and the convention $\rho(t)\in\mathcal P(\mathcal X)$0, $\rho(t)\in\mathcal P(\mathcal X)$1, the discrete inverse continuity equation requires

$\rho(t)\in\mathcal P(\mathcal X)$2

for $\rho(t)\in\mathcal P(\mathcal X)$3. This is the core discrete weak constraint enforced by the method. The paper characterizes this construction as an inverse continuity equation because the unknown is not the density evolution but the potential generating a velocity field consistent with the observed marginals.

3. DICE loss, function spaces, and invariance

For each time index $\rho(t)\in\mathcal P(\mathcal X)$4, DICE uses the weighted space $\rho(t)\in\mathcal P(\mathcal X)$5 and defines

$\rho(t)\in\mathcal P(\mathcal X)$6

together with

$\rho(t)\in\mathcal P(\mathcal X)$7

On these spaces the discrete objective is

$\rho(t)\in\mathcal P(\mathcal X)$8

Its Euler–Lagrange equations coincide with the discrete inverse weak continuity equations, so minimizers of the loss solve the target discrete transport system (Blickhan et al., 7 Jul 2025).

A defining property of the construction is invariance to spatially constant, time-varying additive terms. For any $\rho(t)\in\mathcal P(\mathcal X)$9 that is constant in space,

$\mathcal X$0

The quadratic terms are unchanged because $\mathcal X$1, while the linear terms cancel telescopically since expectations of constants equal the constants themselves. The paper treats this as preservation, in discrete time, of the intrinsic non-identifiability of the potential up to an additive temporal function.

This invariance is not merely algebraic. It is presented as the mechanism that prevents the ill-posedness encountered by other empirical time discretizations, notably empirical Action Matching, where residual terms associated with such constants can destabilize training. The paper further identifies the DICE functional as quadratic and convex, with well-posed discrete optimization under the stated assumptions.

A common misconception is to interpret the additive freedom in $\mathcal X$2 as an ambiguity in the learned velocity. DICE does not leave the velocity field underdetermined in that sense: $\mathcal X$3 is the identified object, while $\mathcal X$4 is unique only modulo time-dependent constants.

4. Parameterization, empirical training, and generation

In practice, the potential is parameterized by a neural network $\mathcal X$5, or in parametric settings by $\mathcal X$6. The reported architectures include MLPs with swish activations and ResNets for high-dimensional states, with time supplied either as an input coordinate or through Fourier or time features. The velocity field is obtained by automatic differentiation,

$\mathcal X$7

Training requires only unpaired samples at discrete times,

$\mathcal X$8

with no density evaluations and no trajectory supervision. Expectations are replaced by Monte Carlo estimates,

$\mathcal X$9

giving the empirical loss of the same algebraic form as $\mathbb R^d$0, but with empirical averages in place of exact expectations (Blickhan et al., 7 Jul 2025).

The training pipeline is minibatch-based. At each iteration, one samples a minibatch of time indices and, for each selected $\mathbb R^d$1, samples points from the datasets at times $\mathbb R^d$2 and $\mathbb R^d$3. The network values and spatial gradients are evaluated, the empirical DICE contributions are accumulated, and the parameters are updated by backpropagation. The stabilization strategy is built into the objective itself: because $\mathbb R^d$4, no additional penalties are required to remove spatial constants. The implementation notes state that standard optimizers such as Adam with a cosine schedule work well, and that a learning rate $\mathbb R^d$5 with cosine decay works robustly in the reported experiments.

After training, sample populations are generated by integrating

$\mathbb R^d$6

using a standard ODE solver or explicit Euler on the physical time grid. If the network accepts continuous time, it can be queried directly for arbitrary $\mathbb R^d$7; otherwise, the paper advocates a linear-in-time interpolant between grid points. This produces the full population trajectory in one forward evolution across $\mathbb R^d$8.

The computational profile reflects this design. With minibatches of size $\mathbb R^d$9 in time and $\mathbb T^d$0 in samples in dimension $\mathbb T^d$1, the forward and automatic-differentiation cost per iteration is $\mathbb T^d$2, plus network cost. Training does not differentiate through time integrators and does not require optimal-transport solvers. Memory is $\mathbb T^d$3 for minibatch activations and gradients and is independent of the number of ODE steps because simulated dynamics are not included in the backward pass. At inference, evolving $\mathbb T^d$4 samples across $\mathbb T^d$5 physical time steps with a first-order integrator costs $\mathbb T^d$6, whereas time-conditioned diffusion or flow methods incur $\mathbb T^d$7 with $\mathbb T^d$8 solver or denoising steps per marginal.

5. Existence, uniqueness, consistency, and error control

Under the Poincaré inequality and a mild square-integrability condition on discrete time derivatives of $\mathbb T^d$9, the discrete loss restricted to the time grid admits a minimizer in the product space $\rho(t)$0: $\rho(t)$1 Moreover, the mean-zero representative is unique, $\rho(t)$2 is lower-bounded on $\rho(t)$3, and the mean-free minimizer is unique in the product norm induced by $\rho(t)$4 and $\rho(t)$5 (Blickhan et al., 7 Jul 2025).

The analysis also provides consistency bounds for the discrete approximation. Under smoothness assumptions, including densities bounded above and below and transported by a smooth diffeomorphic flow, the discrete minimizer $\rho(t)$6 satisfies, at the observation times,

$\rho(t)$7

For all $\rho(t)$8, using the linear-in-time interpolant $\rho(t)$9,

$\rho(t,\cdot):\mathcal X\to\mathbb R$0

where $\rho(t,\cdot):\mathcal X\to\mathbb R$1 is explicit and independent of $\rho(t,\cdot):\mathcal X\to\mathbb R$2 and the time-step sizes themselves. This is a first-order accuracy statement in $\rho(t,\cdot):\mathcal X\to\mathbb R$3. If $\rho(t,\cdot):\mathcal X\to\mathbb R$4 is Lipschitz in time in $\rho(t,\cdot):\mathcal X\to\mathbb R$5, the same type of estimate holds for $\rho(t,\cdot):\mathcal X\to\mathbb R$6 itself, with a modified constant.

For the induced population dynamics, the paper states a Wasserstein-2 error bound. If the gradient approximation satisfies the time-uniform estimate, then the laws $\rho(t,\cdot):\mathcal X\to\mathbb R$7 and $\rho(t,\cdot):\mathcal X\to\mathbb R$8 generated respectively by $\rho(t,\cdot):\mathcal X\to\mathbb R$9 and $\rho(t,x)$0 obey

$\rho(t,x)$1

where $\rho(t,x)$2. Consequently, as $\rho(t,x)$3, one has $\rho(t,x)$4 in $\rho(t,x)$5 for all $\rho(t,x)$6, and thus $\rho(t,x)$7 when the initial conditions are matched.

These results tie the learning problem to the transport error of the generated populations. A plausible implication is that the method’s dense-in-time observation regime is not merely a practical convenience but part of its approximation theory: the discrete weak linearization is controlled at first order in the maximal time step.

6. Relation to adjacent methods, empirical behavior, and extensions

DICE is contrasted with several neighboring approaches. Time-conditioned generative models such as NCSM and CFM learn maps from a fixed reference to each marginal $\rho(t,x)$8 and require separate inference for each target time, with many solver or denoising steps per marginal. CNF and Neural ODE methods integrate ODEs during training and differentiate through solvers or adjoints, making them expensive and memory-intensive. Fokker–Planck and JKO-inspired approaches operate through variational problems on $\rho(t,x)$9 and often require nonlinear optimal-transport solves or bilevel optimization. Action Matching is the most direct methodological foil: it discretizes a continuous-time action objective, but its empirical discrete loss can retain residual terms from spatially constant time-varying functions, breaking invariance and destabilizing training. DICE is presented as avoiding these issues by enforcing discrete weak continuity constraints directly and preserving the relevant invariance in discrete time (Blickhan et al., 7 Jul 2025).

The paper reports experiments on a toy stationary Gaussian, a known-potential problem in $u=\nabla s$00, random waves, Vlasov–Poisson systems, and a $u=\nabla s$01D chaotic flow approximating Rayleigh–Bénard convection. In the toy Gaussian setup, with $u=\nabla s$02 on $u=\nabla s$03, $u=\nabla s$04, and $u=\nabla s$05, Action Matching develops a sharp kink in $u=\nabla s$06 and exhibits residual blow-up, whereas DICE remains stable. In the known-potential experiment, DICE attains low relative error while Action Matching becomes unstable for long training. For random waves in $u=\nabla s$07, generated populations reproduce population-level moments, specifically the mean and second and third moments, and exhibit lower kinetic energy than the original trajectories, consistent with the minimum-energy principle. In Vlasov–Poisson settings, including $u=\nabla s$08D strong Landau damping with $u=\nabla s$09 and $u=\nabla s$10, DICE reproduces particle histograms and electric energy evolution over several orders of magnitude; time-conditioned baselines are reported as similar in accuracy but notably more expensive at inference, while Action Matching fails to train reliably. In the $u=\nabla s$11D chaotic system, DICE matches population histograms and achieves lower Sinkhorn divergence than time-conditioned baselines, and Action Matching again fails due to instability.

The principal limitations and assumptions are stated explicitly. Densities should satisfy the Poincaré inequality, the elliptic variational arguments require regularity, the time marginals should be available at sufficiently dense times with known time stamps, and the domain should support either periodic or no-flux boundary handling. Identifiability holds for the velocity field $u=\nabla s$12 but not for the potential itself, which is defined only up to time functions $u=\nabla s$13. In sparse-time regimes, the linearization error degrades as $u=\nabla s$14. The base formulation models pure continuity transport and does not include diffusion.

The paper also describes several extensions. An entropic regularization yields

$u=\nabla s$15

which formally corresponds to a Fokker–Planck model and leads to SDE sampling,

$u=\nabla s$16

A parametric version over $u=\nabla s$17 is defined by

$u=\nabla s$18

Adaptive time discretization and physics-informed constraints are also identified as compatible with the same weak-form framework.

Taken together, these properties position DICE as a method for dense-in-time marginal learning that is simulation-free during training, fast at inference, and theoretically anchored by discrete weak continuity, minimum-energy selection of gradient transport, and invariance to spatially constant temporal perturbations.