The paper presents a new one‑step generative modeling framework for finite state spaces, leveraging discrete Wasserstein geometry to define a target‑relative KL gradient flow over a reversible Markov kernel. The authors implement this flow at the particle level using Markov jumps and encode the resulting transport updates into a latent‑conditioned generator, enabling one‑step inference after training. Experiments on a controlled setting confirm KL dissipation, consistency between particle dynamics and probability flow, and accurate numerical scaling, while a finite‑capacity neural generator successfully tracks the exact transport targets.
arXiv:2608.29647v1 Announce Type: new Abstract: To mitigate the time complexity of generative models, one-step generative models have recently emerged through direct mapping from noise to data in a s...
Reconstructing population dynamics is a central problem in the physical and data sciences. Often, the dynamics are modeled as a Wasserstein gradient flow (WGF): a curve of distributions driven by an energy functional.
arXiv:2607. 04738v1 Announce Type: cross Abstract: Reconstructing population dynamics is a central problem in the physical and data sciences.
arXiv:2609.15193v1 Announce Type: new Abstract: Drifting models offer a promising route to faster generative AI: they perform gradual transport during training, while generating new samples in a sing...
Drifting models offer a promising route to faster generative AI: they perform gradual transport during training, while generating new samples in a single step. This paper asks whether the underlying d...
arXiv:2609.38364v1 Announce Type: cross Abstract: Discrete diffusion models and flow matching have emerged as powerful frameworks for generative modeling over discrete state spaces, yet efficient few...
The paper introduces block‑triangular joint drifting, a method that applies a projected drift field to the joint distribution of consecutive states, enabling one‑step generative surrogate models for stochastic transition dynamics. This architecture preserves the current‑state marginal while directly sampling the conditional distribution of next states, allowing stochastic trajectories to be generated with a single model evaluation per time step. Experiments show that the approach achieves accurate marginal and trajectory‑dependent statistics with favorable accuracy‑cost tradeoffs compared to deterministic, diffusion, flow, and distillation‑based generative surrogates.
arXiv:2606. 07481v1 Announce Type: new Abstract: While Computational Fluid Dynamics (CFD) provides high-fidelity flow fields for optimizing indoor environments, its computational cost limits rapid exploration.
arXiv:2602.19600v2 Announce Type: replace Abstract: Many high-dimensional datasets concentrate near a low-dimensional structure embedded in the ambient space. Generative models for such data must con...
arXiv:2606. 08953v1 Announce Type: new Abstract: Modern generative models often define an entire probability path from a simple prior to the data law, rather than only an endpoint map.
arXiv:2604. 04342v2 Announce Type: replace Abstract: Many data-driven decision problems are formulated using a nominal distribution estimated from historical data, while performance is ultimately determined by a deployment distribution that may be shifted, context-dependent, partially observed, or stress-induced.
Particle-based variational inference (ParVI) methods approximate an intractable target distribution by evolving an ensemble of interacting samples. Existing approaches rely predominantly on kernel-based repulsion (e.