aiqbench analysis
This research applies conditional diffusion models to learn transition kernels for jump-diffusion processes, enabling the generation of new sample paths from high-frequency trajectory data. The study provides non-asymptotic theoretical bounds on score estimation error and KL divergence while benchmarking performance on synthetic and real-world probabilistic forecasting tasks.
Learning Transition Kernels of Jump-Diffusion Processes with Conditional Diffusion Models
arXiv:2610.09045v1 Announce Type: cross Abstract: We study the problem of learning transition kernels for time-homogeneous jump-diffusion processes using conditional diffusion models, with the goal of generating new sample paths from training data consisting of N independent trajectories observed on a high-frequency discrete time grid. On the theoretical side, we establish non-asymptotic bounds for the conditional score estimation error and for the KL divergence between the laws of the true and generated discretely observed paths. On the numerical side, we first evaluate our method on synthetic data to assess the theoretical findings and benchmark its performance against the approach of Gao et al. (2025). We then apply our method to real-world data and investigate its performance on a probabilistic forecasting task.
Abstract:We study the problem of learning transition kernels for time-homogeneous jump-diffusion processes using conditional diffusion models, with the goal of generating new sample paths from training data consisting of N independent trajectories observed on a high-frequency discrete time grid. On the theoretical side, we establish non-asymptotic bounds for the conditional score estimation error and for the KL divergence between the laws of the true and generated discretely observed paths. On the numerical side, we first evaluate our method on synthetic data to assess the theoretical findings and benchmark its performance against the approach of Gao et al. (2025). We then apply our method to real-world data and investigate its performance on a probabilistic forecasting task.
Machine Learning (stat.ML); Machine Learning (cs.LG)
arXiv:2610.09045 [stat.ML]
(or arXiv:2610.09045v1 [stat.ML] for this version)
https://doi.org/10.48550/arXiv.2610.09045 Focus to learn more arXiv-issued DOI via DataCite (pending registration)
arXivLabs is a framework that allows collaborators to develop and share new arXiv features directly on our website.
Both individuals and organizations that work with arXivLabs have embraced and accepted our values of openness, community, excellence, and user data privacy. arXiv is committed to these values and only works with partners that adhere to them.
Have an idea for a project that will add value for arXiv's community? Learn more about arXivLabs.
Full text under the publisher's open licence · 212 words
Related coverage
CRNDiff: Count-Native Diffusion Framework via Chemical Reaction Networks
arXiv · Sep 28, 2026
Synthesis Superintelligence: from Semiconductors to Superconductors — Periodic Labs’ Liam Fedus and Ekin Dogus Cubuk
Latent Space · Oct 8, 2026

Runway’s WorldPrompt and the Engineering of Real-Time Worlds
Latent Space · Sep 25, 2026
Flow Matching for Count Data
arXiv · Sep 23, 2026