arXiv Machine Learning

Disentangling Continuous-Time Latent Dynamics: Identifiability of Latent SDEs via Diffusion Shifts

arXiv:2606. 28228v1 Announce Type: new Abstract: Causal representation learning for time series has developed strong identifiability results in discrete-time latent causal models, but identifiability in continuous-time latent stochastic differential equation (SDE) models remains largely open.

arXiv Machine Learning
Sep 18

One Intervention per Component is Enough: Towards Identifiability in Linear Stochastic Dynamics from Steady State

The paper investigates how to recover the parameters of a multivariate Ornstein-Uhlenbeck process using only steady-state observational and interventional data. It proves that a single intervention per strongly connected component of the drift graph is sufficient to identify all parameters generically, up to a global scaling factor, provided the SCC condensation graph is connected with a single root and certain spectral conditions hold. A recursive learning algorithm and a regularized least-squares estimator are proposed, and experiments confirm the theoretical results.

By Saber Salehkaleybar
Hugging Face Trending Papers
Aug 5

Intrinsic-Hybrid Latent Diffusion Models for Generative Modeling on Unknown Manifolds

We introduce the Intrinsic Hybrid Latent Diffusion Model (ILDM), a generative framework that integrates probabilistic dimensionality reduction with geometry-aware diffusion on unknown manifolds. While diffusion models (DMs) have achieved state-of-the-art results in high-dimensional data synthesis, they rely on large training datasets and ignore intrinsic geometric structure.

arXiv Statistics ML
Aug 25

Change Detection in Probability Flow ODE: Online Testing in Diffusion Latent Spaces

The paper introduces a sequential change‑point detection method for time‑ordered data where neither the pre‑ nor post‑change distributions have closed forms. It trains a conditional diffusion model on pre‑change data, uses its probability flow ODE to map observations to a Gaussian latent space, and then applies the Maximum Mean Discrepancy as a test statistic. The authors derive closed‑form components under the Gaussian null, establish the statistic’s asymptotic distribution as a degenerate U‑statistic, and implement an online Shiryaev–Roberts procedure with exact threshold calibration to detect arbitrary distributional shifts without parametric assumptions.

By Artem Kraevskiy, Artem Prokhorov