cs.LGOct 4, 2026

Discrete Action Matching: Learning Stochastic Dynamics from Samples via State Graphs

Authors: Mikhail Persiianov, Alexander Korotin

Organizations: Applied AI Institute Moscow, Russia

Abstract

Learning population dynamics from unpaired temporal marginals is an ill-posed inverse problem that requires structural assumptions on the underlying dynamics. We introduce Discrete Action Matching\textit{Discrete Action Matching} (DAM), a finite-state counterpart of Action Matching based on discrete Wasserstein geometry. For a prescribed marginal path and transport geometry, we derive an action-minimization objective for its canonical minimum-kinetic-energy current. Our key observation is that the density dependence of the discrete action reduces to neighboring density ratios. Along an empirical interpolation of the snapshots, DAM first estimates these ratios and then learns an action potential. The learned fields also define a graph-supported Markov sampler. Experiments on controlled synthetic dynamics and real mouse gastrulation data evaluate marginal reconstruction and interpolation. Additional experiments approximate numerical surface-transport paths from paired samples.

Figures & tables

Appendix figures & tables10 assets

Supplementary material from the paper’s appendix.

Appendix

Explore similar work

CardsList
  1. Lagrangian Flow Matching: A Least-Action Framework for Principled Path Design

    May 14, 2026Shukai Du, Junzhe Zhang, Yiming LiConditional Flow MatchingVelocity Field

  2. A Call to Lagrangian Action: Learning Population Mechanics from Temporal Snapshots

    May 8, 2026Vincent Guan, Lazar Atanackovic, Kirill NeklyudovLagrangian MethodsPopulation Dynamics

  3. Multi-Marginal Flow Matching with Adversarially Learnt Interpolants

    Oct 1, 2025Oskar Kviman, Kirill Tamogashev, Nicola Branchini +3Conditional Flow MatchingInterpolation