This work presents a population-level inference framework that recovers latent stochastic dynamics directly from snapshot probability distributions by decomposing the observed evolution into an intrinsic latent stochastic process and a discrepancy transport map that captures geometric deformation between the latent and observed probability spaces.
Abstract
Many scientific and engineering systems are observed as time-indexed probability distributions whose governing dynamics are unknown and whose individual trajectories are unavailable. These settings challenge conventional system-identification approaches that rely on trajectory correspondence or prescribed evolution equations. This work presents a population-level inference framework that recovers latent stochastic dynamics directly from snapshot probability distributions by decomposing the observed evolution into an intrinsic latent stochastic process and a discrepancy transport map that captures geometric deformation between the latent and observed probability spaces. The latent dynamics are modeled using an Ornstein--Uhlenbeck process, providing a closed-form solution to the associated Fokker--Planck equation, while the discrepancy transport map is parameterized through the Knothe--Rosenblatt rearrangement with monotone neural networks. To mitigate the non-uniqueness inherent in the latent--transport decomposition, the transport map is regularized using a deformation energy motivated by hyperelasticity, promoting smooth, physically interpretable deformations while reducing unnecessary complexity. The latent stochastic model and discrepancy transport map are learned jointly through a unified optimization problem defined over probability distributions. Numerical examples involving nonlinear and multimodal distributional dynamics demonstrate that the proposed framework accurately reconstructs complex probability evolution while preserving a compact and analytically tractable latent representation. The proposed formulation provides a general framework for population-level dynamical inference and establishes a foundation for extending latent stochastic models and transport-based learning to more general and higher-dimensional systems.
A framework is developed for the inference of dynamics described by a generalized system of ordinary differential equations. A stochastic gradient method is coined that infers dynamics from observed marginal probability density functions using the joint probability density function of the observable and latent variables. Diffusion and other irreversible processes observed in a low-dimensional state can be recast as deterministic, reversible flows in a sufficiently augmented state space, where the joint density satisfies the hyperbolic Liouville equation. The marginal distribution observed is the projection of these hyperbolic dynamics onto the observed coordinates, with the latent components carrying the randomness and memory. This reframing allows inference for irreversible or stochastic dynamics into the recovery of a deterministic Ordinary Differential Equation (ODE) from marginal observations. Instead of solving the high-dimensional Liouville equation for the joint density, the algorithm exploits its characteristic representation. Particles sampled from the initial distribution are transported along characteristic lines. The Eulerian sensitivity with respect to parameters is obtained by sensitivity propagation along the characteristic lines, with a crossed U-statistic producing an unbiased gradient estimator, which enables stochastic gradient descent. Four experiments validate the method: recovery of a three-mode linear system observed through the marginal of a single mode; a nonlinear Gompertz growth model with a hidden mode; a bistable system whose hidden mode turns a unimodal marginal bimodal; and Stokes--Oseen drag law recovery for particles in a cellular flow. Convergence behavior is analyzed across these settings.
Neural PDE solvers provide efficient surrogates for time-dependent physical systems, but autoregressive prediction over long horizons remains challenging because local errors can induce distribution shift and accumulate under recursive deployment. We develop a variational approach to this problem by introducing latent Markov dynamics in which physical states are represented by latent distributions and evolved through probabilistic transitions. The framework is formulated directly on function spaces and specialized to functional Gaussian models, where structured latent perturbations induce a spectral geometry and variational transition alignment regularizes the learned dynamics. We further analyze how these mechanisms affect autoregressive error propagation, providing a theoretical connection between variational training and long-horizon prediction. We instantiate the framework as the Variational Autoencoding Markov Operator (VAMO), which combines spatially resolved latent fields, structured Gaussian perturbations, and a neural-operator transition. Empirically, we demonstrate the effectiveness of VAMO on several fluid-dynamics benchmarks with prediction horizons extending substantially beyond those represented during training, where it consistently reduces error accumulation and improves rollout stability over several deterministic and noise-injection baselines. Overall, these results highlight variational modeling as a complementary approach to robust long-horizon neural PDE dynamics.
Jun-Yi Liao, J. Guilleminot, Vahid Tarokh· 0 citations
A factorized latent-conditioning formulation is introduced that jointly learns a neural operator and a low-dimensional latent representation through factorized prediction, trajectory-decoupled sampling, and dimension selection that enables generalization to previously unseen system instances.
Zi-Tuo Chen, Qiaofeng Li, Jia-Xin Hu et al.· arXiv.org· 1 citation
High-dimensional population balance equations (PBEs) provide a natural framework for modeling heterogeneous cell populations, but their direct numerical solution becomes computationally prohibitive when the internal state space contains many molecular variables. We propose a hybrid mechanistic-machine learning framework for reducing and simulating PBEs defined over high-dimensional intracellular coordinates. The cell population is described by a number density n(x, t), where x ∈ ℝN represents gene and protein states associated with macrophage activation. A dynamics-preserving autoencoder maps this state space to a low-dimensional latent coordinate z ∈ ℝd, with d ≪ N, while retaining key qualitative features of the underlying gene regulatory network, including attractor structure and multistability. Mechanistic information from the original regulatory dynamics is used to construct interpretable drift and diffusion terms for the reduced latent-space PBE. The reduced PBE is solved using a stochastic Lagrangian particle representation, in which particles evolve according to stochastic differential equations (SDEs) corresponding to the latent drift and diffusion fields. The resulting latent-space solution is subsequently decoded and propagated back into the original state space to recover physically interpretable cellular dynamics. We demonstrate the framework on macrophage polarization under cytokine-dependent regulation, including gene knockout perturbations. Overall, the proposed framework provides a computationally tractable and mechanistically interpretable route for integrating single-cell genomic data with population balance models of cell-state dynamics.
Forecasting the long-horizon evolution of mechanical systems from position-only observations is a pivotal yet difficult task, as hidden velocities and trajectory-specific physical properties must be inferred simultaneously. Although physics-guided neural networks like Lagrangian Neural Networks (LNNs) guarantee physical plausibility, they generally require complete state inputs and lack adaptability to changing system parameters. To break these limitations, we introduce History-informed Lagrangian Neural Networks (HiLNN). Grounded in the insight that temporal position sequences implicitly encode underlying dynamics, HiLNN employs a recurrent encoder to extract a latent context from history. This context not only reconstructs the unobserved initial velocity but also adaptively modulates the mass matrix, potential energy, and damping coefficients of a structured Lagrangian system. By leveraging a differentiable RK4 rollout scheme, the entire pipeline is optimized end-to-end under multi-step trajectory supervision and energy-consistency regularization. Empirical evaluations across conservative, dissipative, and heterogeneous variable-parameter systems show that HiLNN delivers superior long-term prediction accuracy and maintains precise energy profiles compared to state-of-the-art baselines. The source code is publicly available at https://github.com/yingtian22/History-informed-LNN.
Tian-Shuo Zhang, Xianglei Xing, Wenzhe Zhai et al.· 0 citations
Structure-preserving neural networks are essential for the long-term prediction of Hamiltonian systems from data. Many important Hamiltonian systems in mechanics and control admit symmetry reduction to Lie--Poisson systems, including rigid bodies, underwater vehicles, fluids, plasmas, and optimal control problems. A fundamental challenge in learning such systems is that their dynamics evolve in momentum variables that are typically unobservable, while available data consist only of observable quantities such as configurations and velocities. In optimal control applications, the situation is further complicated because the latent variables contain unobservable co-states and the Hamiltonian may be degenerate, preventing the existence of a corresponding Lagrangian and rendering the encoder-decoder approaches inapplicable. We introduce Latent Lie--Poisson Neural Networks (LLPNNs), a structure-preserving framework for learning Lie--Poisson dynamics directly from observable data. The proposed approach exploits three geometric ingredients: (i) learning either a Hamiltonian decoder or a pseudo-Lagrangian encoder on the active variables, (ii) constructing latent trajectories through a universal Noether invariant arising from Lie--Poisson symmetry reduction, and (iii) reconstructing observable and latent dynamics through Lie--Poisson flows combined with Magnus-based Lie-group updates. The resulting method preserves the geometric structure and is applicable to both regular and degenerate Hamiltonian systems. We demonstrate the method on three examples: a generalized rigid body on SO(3), Kirchhoff's underwater vehicle on SE(3), and an optimal-control problem for interacting vehicles on $SE(2)^N$. Numerical experiments show excellent long-term predictive accuracy, strong robustness to noise, and competitive performance using only modest datasets and lightweight neural-network architectures.
V. Putkaradze· arXiv.org· 0 citations
We use cookies to run the site and, with your consent, for analytics and to show ads.
See our Cookie Policy.
