Generative Path-Finding Method for Wasserstein Gradient Flow

• URL: http://arxiv.org/abs/2604.11519v1
• Date: Mon, 13 Apr 2026 14:22:20 GMT
• Title: Generative Path-Finding Method for Wasserstein Gradient Flow
• Abstract summary: We propose a generative path finding framework for Wasserstein gradient paths.<n>GenWGP learns a generative flow that transports mass from an initial density to an unknown equilibrium distribution.<n>Experiments on Fokker Planck and aggregation type problems show that GenWGP matches or exceeds high fidelity reference solutions.
• Score: 4.372661069805067
• License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
• Abstract: Wasserstein gradient flows (WGFs) describe the evolution of probability distributions in Wasserstein space as steepest descent dynamics for a free energy functional. Computing the full path from an arbitrary initial distribution to equilibrium is challenging, especially in high dimensions. Eulerian methods suffer from the curse of dimensionality, while existing Lagrangian approaches based on particles or generative maps do not naturally improve efficiency through time step tuning. We propose GenWGP, a generative path finding framework for Wasserstein gradient paths. GenWGP learns a generative flow that transports mass from an initial density to an unknown equilibrium distribution by minimizing a path loss that encodes the full trajectory and its terminal equilibrium condition. The loss is derived from a geometric action functional motivated by Dawson Gartner large deviation theory for empirical distributions of interacting diffusion systems. We formulate both a finite horizon action under physical time parametrization and a reparameterization invariant geometric action based on Wasserstein arclength. Using normalizing flows, GenWGP computes a geometric curve toward equilibrium while enforcing approximately constant intrinsic speed between adjacent network layers, so that discretized distributions remain nearly equidistant in the Wasserstein metric along the path. This avoids delicate time stepping constraints and enables stable training that is largely independent of temporal or geometric discretization. Experiments on Fokker Planck and aggregation type problems show that GenWGP matches or exceeds high fidelity reference solutions with only about a dozen discretization points while capturing complex dynamics.

Related papers

• Wasserstein Residuals: Learning Gradient Flows from Population Dynamics [18.263762660153674]
  Reconstructing population dynamics is a central problem in the physical and data sciences.<n>The dominant algorithmic approach relies on the Jordan--Kinderlehrer--Otto (JKO) scheme.<n>We take a residual approach, enforcing the continuity equations via a non-negative loss function whose minimum is the WGF.<n>This perspective unifies several existing methods and leads to a new particle-based method, stitching, that is simulation-free and robust to large gaps between observations.
  arXiv  Detail & Related papers  (2026-07-06T07:20:30Z)
• The Geometry Behind Diffusion and Flow Matching: Gradient Flows and Geodesics in Wasserstein Space [1.636137854123538]
  It is shown that the gradient flow of the free energy F(rho) = KL(rho ) is exactly the Fokker-Planck equation, and its implicit-Euler discretization is the JKO scheme.<n>Its geodesics are precisely the optimal-transport paths that Flow Matching learns.
  arXiv  Detail & Related papers  (2026-06-23T05:25:24Z)
• A Wasserstein Geometric Framework for Hebbian Plasticity [0.0]
  We introduce a geometric theory of Hebbian plasticity in which memory states are modeled as probability measures evolving through Wasserstein minimizing movements.<n>This variational structure induces a fundamental separation between internal and observable dynamics.
  arXiv  Detail & Related papers  (2026-04-17T13:27:22Z)
• Radon--Wasserstein Gradient Flows for Interacting-Particle Sampling in High Dimensions [0.9940728137241214]
  gradient flows of the Kullback--Leibler divergence evolve a distribution toward a target density known only up to a normalizing constant.<n>We introduce new gradient flows of the KL divergence with a remarkable combination of properties.<n>They admit accurate interacting-particle approximations in high dimensions, and the per-step cost scales linearly in both the number of particles and the dimension.
  arXiv  Detail & Related papers  (2026-02-05T02:38:56Z)
• Hessian-guided Perturbed Wasserstein Gradient Flows for Escaping Saddle Points [54.06226763868876]
  Wasserstein flow (WGF) is a common method to perform optimization over the space of measures.<n>We show that PWGF converges to a global optimum in terms of general non objectives.
  arXiv  Detail & Related papers  (2025-09-21T08:14:20Z)
• Machine learning in and out of equilibrium [58.88325379746631]
  Our study uses a Fokker-Planck approach, adapted from statistical physics, to explore these parallels. We focus in particular on the stationary state of the system in the long-time limit, which in conventional SGD is out of equilibrium. We propose a new variation of Langevin dynamics (SGLD) that harnesses without replacement minibatching.
  arXiv  Detail & Related papers  (2023-06-06T09:12:49Z)
• Neural Wasserstein Gradient Flows for Maximum Mean Discrepancies with Riesz Kernels [1.3654846342364308]
  Wasserstein gradient flows of maximum mean discrepancy (MMD) functionals with non-smooth Riesz kernels show a rich structure. We propose to approximate the backward scheme of Jordan, Kinderlehrer and Otto for computing such Wasserstein gradient flows. We provide analytic formulas for Wasserstein schemes starting at a Dirac measure and show their convergence as the time step size tends to zero.
  arXiv  Detail & Related papers  (2023-01-27T09:57:36Z)
• Large-Scale Wasserstein Gradient Flows [84.73670288608025]
  We introduce a scalable scheme to approximate Wasserstein gradient flows. Our approach relies on input neural networks (ICNNs) to discretize the JKO steps. As a result, we can sample from the measure at each step of the gradient diffusion and compute its density.
  arXiv  Detail & Related papers  (2021-06-01T19:21:48Z)
• Variational Transport: A Convergent Particle-BasedAlgorithm for Distributional Optimization [106.70006655990176]
  A distributional optimization problem arises widely in machine learning and statistics. We propose a novel particle-based algorithm, dubbed as variational transport, which approximately performs Wasserstein gradient descent. We prove that when the objective function satisfies a functional version of the Polyak-Lojasiewicz (PL) (Polyak, 1963) and smoothness conditions, variational transport converges linearly.
  arXiv  Detail & Related papers  (2020-12-21T18:33:13Z)
• Debiased Sinkhorn barycenters [110.79706180350507]
  Entropy regularization in optimal transport (OT) has been the driver of many recent interests for Wasserstein metrics and barycenters in machine learning. We show how this bias is tightly linked to the reference measure that defines the entropy regularizer. We propose debiased Wasserstein barycenters that preserve the best of both worlds: fast Sinkhorn-like iterations without entropy smoothing.
  arXiv  Detail & Related papers  (2020-06-03T23:06:02Z)
• The Wasserstein Proximal Gradient Algorithm [23.143814848127295]
  Wasserstein gradient flows are continuous time dynamics that define curves of steepest descent to minimize an objective function over the space of probability measures. We propose a Forward Backward (FB) discretization scheme that can tackle the case where the objective function is the sum of a smooth and a nonsmooth geodesically convex terms.
  arXiv  Detail & Related papers  (2020-02-07T22:19:32Z)
• A Near-Optimal Gradient Flow for Learning Neural Energy-Based Models [93.24030378630175]
  We propose a novel numerical scheme to optimize the gradient flows for learning energy-based models (EBMs) We derive a second-order Wasserstein gradient flow of the global relative entropy from Fokker-Planck equation. Compared with existing schemes, Wasserstein gradient flow is a smoother and near-optimal numerical scheme to approximate real data densities.
  arXiv  Detail & Related papers  (2019-10-31T02:26:20Z)

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.