Skip to content

ABC: Any-Subset Autoregression via Non-Markovian Diffusion Bridges in Continuous Time and Space

Apr 2026 · arXiv.org · Vol abs/2604.27443 · 0 citations · 74 references
Computer Science

TL;DR

This work proposes ABC: Any-Subset Autoregressive Models via Non-Markovian Diffusion Bridges in Continuous Time and Space, and derives SDE dynamics via changes-of-measure on path space, yielding another advantage: path-dependent conditioning on arbitrary subsets of the state history and/or future.

Abstract

Generating continuous-time, continuous-space stochastic processes (e.g., videos, weather forecasts) conditioned on partial observations (e.g., first and last frames) is a fundamental challenge. Existing approaches, (e.g., diffusion models), suffer from key limitations: (1) noise-to-data evolution fails to capture structural similarity between states close in physical time and has unstable integration in low-step regimes; (2) random noise injected is insensitive to the physical process's time elapsed, resulting in incorrect dynamics; (3) they overlook conditioning on arbitrary subsets of states (e.g., irregularly sampled timesteps, future observations). We propose ABC: Any-Subset Autoregressive Models via Non-Markovian Diffusion Bridges in Continuous Time and Space. Crucially, we model the process with one continual SDE whose time variable and intermediate states track the real time and process states. This has provable advantages: (1) the starting point for generating future states is the already-close previous state, rather than uninformative noise; (2) random noise injection scales with physical time elapsed, encouraging physically plausible dynamics with similar time-adjacent states. We derive SDE dynamics via changes-of-measure on path space, yielding another advantage: (3) path-dependent conditioning on arbitrary subsets of the state history and/or future. To learn these dynamics, we derive a path- and time-dependent extension of denoising score matching. Our experiments show ABC's superiority to competing methods on multiple domains, including video generation and weather forecasting.

View source

Similar papers

Open access Jul 2026

First-Passage Time for PDifMPs: An Asymptotically Exact Simulation Approach for Time-Varying Thresholds

Piecewise diffusion Markov processes (PDifMPs) are valuable for modelling systems where continuous dynamics are interrupted by sudden shifts and/or changes in drift and diffusion. The first-passage time (FPT) in such models plays a central role in understanding when a process first reaches a critical boundary. In many...

Sascha Desmettre, Devika Khurana, A. Meddah · 0 citations
Preprint Aug 2026

Reinforcement Learning for Continuous-Time Jump Markov Decision Processes with Applications to Network Dynamic Pricing

Numerical experiments in network dynamic pricing show that the proposed RL algorithm reliably learns near-optimal policies and consistently outperforms standard benchmark methods, demonstrating superior solution quality and effective scalability to large-scale network instances.

Hui-Ling Meng, Ning-Yuan Chen, Xue-Feng Gao · 1 citation
#machine learning Preprint Sep 2026

Learning Fractional-Order Dynamics from a Single Trajectory

Many real-world processes exhibit long-range dependence, where the current state depends on a slowly decaying trace of past states rather than on the most recent state alone. This paper studies system identification for discrete-time fractional-order linear time-invariant systems from a single observed trajectory of le...

Xiao-Le Zhang, Zi-Yi Zhang, Ze-Hao Zhao et al. · 0 citations
#machine learning Preprint Aug 2026

Propensity Straight-Through Gradients for Discrete Stochastic Systems

This work exploits the affine state update to obtain the exact one-step conditional-mean sensitivity by differentiating normalized reaction propensities, and defines the propensity straight-through (PST) estimator, a temperature- and Gumbel-free path to scalable gradient-based learning through exact stochastic trajecto...

Jose M. G. Vilar, Leonor Saiz · 0 citations
Preprint Sep 2026

Online Change-Point Monitoring for Object-valued Time Series

We develop closed- and open-end procedures for monitoring changes in the marginal distribution of object-valued time series. The method combines two distance-based Hilbert-space embeddings, a monitoring-time-dependent projection, and self-normalization. It is computable entirely from pairwise distances, does not requir...

Yi Zhang, Tim Kutta, Xiao-Feng Shao · 0 citations

Related blog posts

MIT News · Artificial Intelligence Sep 29, 2026

Who we become when we talk to machines

Professor Sherry Turkle’s new book, “Artificial Intimacy,” offers a withering critique of chatbots and the antisocial dynamics she believes they encourage.

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.