mlsanityData to 14 Oct 2026

Neural Wasserstein Splines: Representation-Invariant Second-Order Priors for Trajectory Inference

arXiv 2610.19878 ↗First posted 14 Oct 2026cs.LG cs.AI stat.MLcited by 0

Not on the map. Why?

Abstract (arXiv)

Population dynamics are often observed only as unpaired snapshots, which leave the evolution between measurements underdetermined. Second-order regularization can constrain it, but a penalty on the accelerations of sampled particles is a prior on joint particle paths, and different particle representations of the same marginal curve can have different acceleration costs. We therefore introduce Neural Wasserstein Splines (NWSP), a sample-based method that learns a continuous population curve under a Wasserstein smoothness prior. A neural network maps latent variables to the control points of a cubic spline in time, so samples at any time come from the spline basis without numerical integration. We project the generator's velocity onto gradients of a finite dictionary of scalar potentials and differentiate this measure-dependent projection in time, obtaining a finite-dimensional surrogate for the intrinsic Wasserstein acceleration, trained jointly with distributional fit losses. For a fixed dictionary and ridge parameter, we prove that the population penalty depends only on the marginal curve and bound its sensitivity to moment-estimation errors. Learned potentials (NWSP-N) sharpen acceleration estimates. On various synthetic and single-cell benchmarks, NWSP is highly competitive with transport and flow-based methods, ranking in the top two in 11 of 16 settings. The penalty improves on an unregularized spline in 13 of 16 settings and, while competitive with a particle-acceleration penalty, adds provable representation invariance.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 23 of its 39 references that are in the map. First posted on arXiv 14 Oct 2026.

Builds on

23 of 39 references.

References · 23

  1. 2022Flow Matching for Generative Modelingcited by 5,702
  2. 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,316
  3. 2023Improving and generalizing flow-based generative models with minibatch optimal transportcited by 879
  4. 2020TrajectoryNet: A Dynamic Optimal Transport Network for Modeling Cellular Dynamicscited by 160
  5. 2022Action Matching: Learning Stochastic Dynamics from Samplescited by 98
  6. 2024Metric Flow Matching for Smooth Interpolations on the Data Manifoldcited by 77
  7. 2022Manifold Interpolating Optimal-Transport Flows for Trajectory Inferencecited by 64
  8. 2023A Computational Framework for Solving Wasserstein Lagrangian Flowscited by 46
  9. 2023Deep Momentum Multi-Marginal Schr"odinger Bridgecited by 42
  10. 2024Learning stochastic dynamics from snapshots through regularized unbalanced optimal transportcited by 33
  11. 2020Fast and Smooth Interpolation on Wasserstein Spacecited by 22
  12. 2018Second order models for optimal transport and cubic splines on the Wasserstein spacecited by 20
11 more
  1. 2025Trajectory Inference with Smooth Schr"odinger Bridgescited by 11
  2. 2025Momentum Multi-Marginal Schr"odinger Bridge Matchingcited by 11
  3. 2024Efficient Trajectory Inference in Wasserstein Space Using Consecutive Averagingcited by 10
  4. 2022Wasserstein-Fisher-Rao Splinescited by 6
  5. 2026A Call to Lagrangian Action: Learning Population Mechanics from Temporal Snapshotscited by 5
  6. 2025Multi-Marginal Flow Matching with Adversarially Learnt Interpolantscited by 4
  7. 2026SplineFlow: Flow Matching for Dynamical Systems with B-Spline Interpolantscited by 4
  8. 2022Wassersplines for Neural Vector Field--Controlled Animationcited by 3
  9. 2026PACE: Geometry-Aware Bridge Transport for Single-Cell Trajectory Inferencecited by 1
  10. 2026Trajectory inference via Acceleration Matchingcited by 1
  11. 2026TracingFlow: A Simulation-Free Trajectory Inference Framework Based on Second-Order Dynamicscited by 1

Built on by

Not cited yet.