Multi-Marginal Flow Matching with Adversarially Learnt Interpolants

• URL: http://arxiv.org/abs/2510.01159v1
• Date: Wed, 01 Oct 2025 17:47:27 GMT
• Title: Multi-Marginal Flow Matching with Adversarially Learnt Interpolants
• Authors: Oskar Kviman, Kirill Tamogashev, Nicola Branchini, Víctor Elvira, Jens Lagergren, Nikolay Malkin,
• Abstract summary: This paper proposes a novel flow matching method that overcomes the limitations of existing multi-marginal trajectory inference algorithms.<n>Our proposed method, ALI-CFM, uses a GAN-inspired adversarial loss to fit neurally parametrised interpolant curves between source and target points.<n>We showcase the versatility and scalability of our method by outperforming the existing baselines on spatial transcriptomics and cell tracking datasets.
• Score: 27.294164408278448
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Learning the dynamics of a process given sampled observations at several time points is an important but difficult task in many scientific applications. When no ground-truth trajectories are available, but one has only snapshots of data taken at discrete time steps, the problem of modelling the dynamics, and thus inferring the underlying trajectories, can be solved by multi-marginal generalisations of flow matching algorithms. This paper proposes a novel flow matching method that overcomes the limitations of existing multi-marginal trajectory inference algorithms. Our proposed method, ALI-CFM, uses a GAN-inspired adversarial loss to fit neurally parametrised interpolant curves between source and target points such that the marginal distributions at intermediate time points are close to the observed distributions. The resulting interpolants are smooth trajectories that, as we show, are unique under mild assumptions. These interpolants are subsequently marginalised by a flow matching algorithm, yielding a trained vector field for the underlying dynamics. We showcase the versatility and scalability of our method by outperforming the existing baselines on spatial transcriptomics and cell tracking datasets, while performing on par with them on single-cell trajectory prediction. Code: https://github.com/mmacosha/adversarially-learned-interpolants.

Related papers

• Longitudinal Flow Matching for Trajectory Modeling [7.063657100587108]
  We propose Interpolative Multi-Marginal Flow Matching (IMMFM), a framework that learns continuous dynamics jointly consistent with multiple observed time points.<n>IMMFM captures intrinsicity, handles irregular sparse sampling, and yields subject-specific trajectories.<n> Experiments on synthetic benchmarks and real-world longitudinal datasets show that IMMFM outperforms existing methods in both forecasting accuracy and further downstream tasks.
  arXiv  Detail & Related papers  (2025-10-03T23:33:50Z)
• GeoMM: On Geodesic Perspective for Multi-modal Learning [55.41612200877861]
  This paper introduces geodesic distance as a novel distance metric in multi-modal learning for the first time.<n>Our approach incorporates a comprehensive series of strategies to adapt geodesic distance for the current multimodal learning.
  arXiv  Detail & Related papers  (2025-05-16T13:12:41Z)
• Multi-Agent Path Finding in Continuous Spaces with Projected Diffusion Models [57.45019514036948]
  Multi-Agent Path Finding (MAPF) is a fundamental problem in robotics.<n>This work proposes a novel approach that integrates constrained optimization with diffusion models for MAPF in continuous spaces.
  arXiv  Detail & Related papers  (2024-12-23T21:27:19Z)
• Trajectory Anomaly Detection with Language Models [21.401931052512595]
  This paper presents a novel approach for trajectory anomaly detection using an autoregressive causal-attention model, termed LM-TAD. By treating trajectories as sequences of tokens, our model learns the probability distributions over trajectories, enabling the identification of anomalous locations with high precision. Our experiments demonstrate the effectiveness of LM-TAD on both synthetic and real-world datasets.
  arXiv  Detail & Related papers  (2024-09-18T17:33:31Z)
• Efficient Trajectory Inference in Wasserstein Space Using Consecutive Averaging [3.8623569699070353]
  Trajectory inference deals with reconstructing continuous processes from such observations.<n>We propose methods for B-spline approximation and of point clouds through consecutive averaging that is intrinsic to the Wasserstein space.<n>We prove linear convergence rates and rigorously evaluate our method on cell data characterized by bifurcations, merges, and trajectory splitting scenarios.
  arXiv  Detail & Related papers  (2024-05-30T04:19:20Z)
• Embedding Trajectory for Out-of-Distribution Detection in Mathematical Reasoning [50.84938730450622]
  We propose a trajectory-based method TV score, which uses trajectory volatility for OOD detection in mathematical reasoning. Our method outperforms all traditional algorithms on GLMs under mathematical reasoning scenarios. Our method can be extended to more applications with high-density features in output spaces, such as multiple-choice questions.
  arXiv  Detail & Related papers  (2024-05-22T22:22:25Z)
• Diffusion Generative Flow Samplers: Improving learning signals through partial trajectory optimization [87.21285093582446]
  Diffusion Generative Flow Samplers (DGFS) is a sampling-based framework where the learning process can be tractably broken down into short partial trajectory segments. Our method takes inspiration from the theory developed for generative flow networks (GFlowNets)
  arXiv  Detail & Related papers  (2023-10-04T09:39:05Z)
• Score-based Data Assimilation [7.215767098253208]
  We introduce score-based data assimilation for trajectory inference. We learn a score-based generative model of state trajectories based on the key insight that the score of an arbitrarily long trajectory can be decomposed into a series of scores over short segments.
  arXiv  Detail & Related papers  (2023-06-18T14:22:03Z)
• Manifold Interpolating Optimal-Transport Flows for Trajectory Inference [64.94020639760026]
  We present a method called Manifold Interpolating Optimal-Transport Flow (MIOFlow) MIOFlow learns, continuous population dynamics from static snapshot samples taken at sporadic timepoints. We evaluate our method on simulated data with bifurcations and merges, as well as scRNA-seq data from embryoid body differentiation, and acute myeloid leukemia treatment.
  arXiv  Detail & Related papers  (2022-06-29T22:19:03Z)
• Learning while Respecting Privacy and Robustness to Distributional Uncertainties and Adversarial Data [66.78671826743884]
  The distributionally robust optimization framework is considered for training a parametric model. The objective is to endow the trained model with robustness against adversarially manipulated input data. Proposed algorithms offer robustness with little overhead.
  arXiv  Detail & Related papers  (2020-07-07T18:25:25Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.