pith. sign in

arxiv: 2505.23215 · v1 · pith:EIPODJP5new · submitted 2025-05-29 · 🧮 math.NA · cs.LG· cs.NA

Trajectory Generator Matching for Time Series

classification 🧮 math.NA cs.LGcs.NA
keywords seriestimeprocesseshandlejumpmatchingmodelingtrajectory
0
0 comments X
read the original abstract

Accurately modeling time-continuous stochastic processes from irregular observations remains a significant challenge. In this paper, we leverage ideas from generative modeling of image data to push the boundary of time series generation. For this, we find new generators of SDEs and jump processes, inspired by trajectory flow matching, that have the marginal distributions of the time series of interest. Specifically, we can handle discontinuities of the underlying processes by parameterizing the jump kernel densities by scaled Gaussians that allow for closed form formulas of the corresponding Kullback-Leibler divergence in the loss. Unlike most other approaches, we are able to handle irregularly sampled time series.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Is Flow Matching Just Trajectory Replay for Sequential Data?

    stat.ML 2026-02 unverdicted novelty 7.0

    Flow matching on time series targets a closed-form nonparametric velocity field that is a similarity-weighted mixture of observed transition velocities, making neural models approximations to an ideal memory-augmented...

  2. Flow Matching: Markov Kernels, Stochastic Processes and Transport Plans

    cs.LG 2025-01 unverdicted novelty 2.0

    A mathematical review of flow matching techniques for generative models, showing characterizations via couplings, kernels, and processes, with application to inverse problems.