Edit-Based Flow Matching for Temporal Point Processes

David Lüdke, Marten Lienen, Marcel Kollovieh, Stephan Günnemann
10/7/2025
cs.LG

No confident code implementation found for this paper. 1 possible match can be shown below.

Abstract

Temporal point processes (TPPs) are a fundamental tool for modeling event sequences in continuous time, but most existing approaches rely on autoregressive parameterizations that are limited by their sequential sampling. Recent non-autoregressive, diffusion-style models mitigate these issues by jointly interpolating between noise and data through event insertions and deletions in a discrete Markov chain. In this work, we generalize this perspective and introduce an Edit Flow process for TPPs that transports noise to data via insert, delete, and substitute edit operations. By learning the instantaneous edit rates within a continuous-time Markov chain framework, we attain a flexible and efficient model that effectively reduces the total number of necessary edit operations during generation. Empirical results demonstrate the generative flexibility of our unconditionally trained model in a wide range of unconditional and conditional generation tasks on benchmark TPPs.

View on arXivView PDF

Code Implementations

No confident code match yet

We couldn't find an author-owned or strongly-evidenced community implementation for this paper. 1 weaker match is hidden by default — verify before relying on them.

No code implementations found yet.

Know of an implementation? Let us know in the comments below!

Similar Papers

Cite this paper

@article{ldke2025editbased,
  title  = {Edit-Based Flow Matching for Temporal Point Processes},
  author = {David Lüdke and Marten Lienen and Marcel Kollovieh and Stephan Günnemann},
  year   = {2025},
  eprint = {2510.06050},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2510.06050v2}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2510.06050.svg)](https://codeofpaper.com/paper/2510.06050)

Discussion