Stochastic Lifting for Generating Trajectories of Stochastic Physical Systems

• URL: http://arxiv.org/abs/2605.29194v1
• Date: Thu, 28 May 2026 00:10:45 GMT
• Title: Stochastic Lifting for Generating Trajectories of Stochastic Physical Systems
• Abstract summary: transition from current state to next state can often be modeled as the combination of a smooth map and an explicit source of randomness.<n>This paper exploits this structure by attaching an independent, high-dimensional random label to each state transition in the training data and fitting a transition map from the current state and label to the next state using a standard regression loss.<n>Fresh labels are sampled at each time step and the learned map is rolled forward autoregressively, generating diverse trajectories with a single network evaluation per time step.
• Score: 12.19832939917878
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Many stochastic physical systems evolve smoothly over time in the sense that the distribution of states changes regularly across time steps. The transition from current state to the next state can often be modeled as the combination of a smooth map and an explicit source of randomness. Stochastic Lifting exploits this structure by attaching an independent, high-dimensional random label to each state transition in the training data and fitting a transition map from the current state and label to the next state using a standard regression loss. The labels act as auxiliary coordinates that let the model represent multiple plausible next states from similar current states, avoiding collapse to a mean prediction in the finite-sample size regime. At inference, fresh labels are sampled at each time step and the learned map is rolled forward autoregressively, generating diverse trajectories with a single network evaluation per time step.

Related papers

• Orthogonal JEPA: Factorized Predictive States for Latent World Models [95.20158869896393]
  We introduce method, a latent world-modeling framework based on predictive factorization.<n>We show that method can allocate redundant capacity to dominant signals while providing weak or conflicting gradients to less dominant predictive structure.<n>Experiments on controlled vision, single-cell transcriptomics, longitudinal health records, continuous control, and molecular dynamics evaluate representation quality, forecasting, planning, and long-horizon stability.
  arXiv  Detail & Related papers  (2026-08-20T13:59:57Z)
• Latent States in Neural Networks: Recovering the Temporal Structure of Drifting Data from Model Weights [1.7767466724342065]
  A temporally drifting data stream may pass through discrete regimes rather than changing continuously.<n>We ask whether such regimes are recoverable from the weights of models trained on the stream using a hidden Markov model (HMM)<n>We study this question in two domains known to drift over time: multimodal misinformation detection, using the Fakeddit dataset; and sentiment analysis, using the Yelp dataset.
  arXiv  Detail & Related papers  (2026-07-29T21:51:29Z)
• Itô maps for any-step SDEs [5.492715250025273]
  Recent one-step generative models accelerate sampling by learning deterministic flow maps of underlying dynamics.<n>We introduce the It map, an any-step flow map that takes an intermediate state and Brownian path and predicts future states in a single pass.<n>It maps produce diverse, conditionally valid endpoint samples from fixed intermediate states and support strong steering performance on synthetic and image-generation benchmarks.
  arXiv  Detail & Related papers  (2026-06-09T17:39:22Z)
• Video Analysis and Generation via a Semantic Progress Function [75.07700965101854]
  We introduce a one-dimensional representation that captures how the meaning of a given sequence evolves over time.<n>For each frame, we compute distances between semantic embeddings and fit a smooth curve that reflects the cumulative semantic shift across the sequence.<n>Building on this insight, we propose a semantic linearization procedure that re parameterizes the sequence so that semantic change unfolds at a constant rate.
  arXiv  Detail & Related papers  (2026-04-24T13:48:51Z)
• SSR: A Training-Free Approach for Streaming 3D Reconstruction [53.19807901585702]
  Self-expressive Sequence Regularization (SSR) is a plug-and-play operator that enforces Grassmannian sequence regularity during inference.<n>We show that SSR consistently reduces drift and improves reconstruction quality across multiple streaming 3D reconstruction tasks.
  arXiv  Detail & Related papers  (2026-03-16T02:55:14Z)
• Time-series Generation by Contrastive Imitation [87.51882102248395]
  We study a generative framework that seeks to combine the strengths of both: Motivated by a moment-matching objective to mitigate compounding error, we optimize a local (but forward-looking) transition policy. At inference, the learned policy serves as the generator for iterative sampling, and the learned energy serves as a trajectory-level measure for evaluating sample quality.
  arXiv  Detail & Related papers  (2023-11-02T16:45:25Z)
• Machine learning in and out of equilibrium [58.88325379746631]
  Our study uses a Fokker-Planck approach, adapted from statistical physics, to explore these parallels. We focus in particular on the stationary state of the system in the long-time limit, which in conventional SGD is out of equilibrium. We propose a new variation of Langevin dynamics (SGLD) that harnesses without replacement minibatching.
  arXiv  Detail & Related papers  (2023-06-06T09:12:49Z)
• Asynchronously Trained Distributed Topographic Maps [0.0]
  We present an algorithm that uses $N$ autonomous units to generate a feature map by distributed training. Unit autonomy is achieved by sparse interaction in time & space through the combination of a distributed search, and a cascade-driven weight updating scheme.
  arXiv  Detail & Related papers  (2023-01-20T01:15:56Z)
• Stochastic Trajectory Prediction via Motion Indeterminacy Diffusion [88.45326906116165]
  We present a new framework to formulate the trajectory prediction task as a reverse process of motion indeterminacy diffusion (MID) We encode the history behavior information and the social interactions as a state embedding and devise a Transformer-based diffusion model to capture the temporal dependencies of trajectories. Experiments on the human trajectory prediction benchmarks including the Stanford Drone and ETH/UCY datasets demonstrate the superiority of our method.
  arXiv  Detail & Related papers  (2022-03-25T16:59:08Z)
• Stacked Residuals of Dynamic Layers for Time Series Anomaly Detection [0.0]
  We present an end-to-end differentiable neural network architecture to perform anomaly detection in multivariate time series. The architecture is a cascade of dynamical systems designed to separate linearly predictable components of the signal. The anomaly detector exploits the temporal structure of the prediction residuals to detect both isolated point anomalies and set-point changes.
  arXiv  Detail & Related papers  (2022-02-25T01:50:22Z)
• Online Variational Filtering and Parameter Learning [26.79116194327116]
  We present a variational method for online state estimation and parameter learning in state-space models (SSMs) We use gradients to simultaneously optimize a lower bound on the log evidence with respect to both model parameters and a variational approximation of the states' posterior distribution. Unlike existing approaches, our method is able to operate in an entirely online manner, such that historic observations do not require revisitation after being incorporated and the cost of updates at each time step remains constant.
  arXiv  Detail & Related papers  (2021-10-26T10:25:04Z)
• Dynamical Wasserstein Barycenters for Time-series Modeling [16.212262513825717]
  Most prior work assumes instantaneous transitions between pure discrete states. We propose a Wasserstein barycentric (DWB) model that estimates the system state over time. Experiments on several human activity datasets show that our proposed DWB model accurately learns the generating distribution of pure states.
  arXiv  Detail & Related papers  (2021-10-13T14:20:06Z)
• Targeted stochastic gradient Markov chain Monte Carlo for hidden Markov models with rare latent states [48.705095800341944]
  Markov chain Monte Carlo (MCMC) algorithms for hidden Markov models often rely on the forward-backward sampler. This makes them computationally slow as the length of the time series increases, motivating the development of sub-sampling-based approaches. We propose a targeted sub-sampling approach that over-samples observations corresponding to rare latent states when calculating the gradient of parameters associated with them.
  arXiv  Detail & Related papers  (2018-10-31T17:44:20Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.