arXiv:2606. 11156v1 Announce Type: cross Abstract: Recent one-step generative models accelerate sampling by learning deterministic flow maps of the underlying dynamics.
arXiv:2606. 01086v1 Announce Type: cross Abstract: Flow and diffusion models generate high-quality samples in many modalities; however, many network evaluations are required during inference due to numerical integration of an underlying differential equation.
arXiv:2607. 00535v1 Announce Type: cross Abstract: Few-step flow-map generators, such as consistency models and MeanFlow, accelerate sampling by directly learning long-range transport maps between noise and data.
The paper presents an amortized neural sampler that merges operator learning with flow-based methods to efficiently sample from invariant measures of stochastic differential equations (SDEs). By mapping SDE coefficient functions to pushforwards from a reference measure, the approach shifts the sampling cost to an initial training phase, after which new SDE instances can be sampled with a single encoder pass and a few ODE solver steps, independent of mixing time. The framework incorporates Lagrangian trajectory sensors and cross attention to handle high-dimensional problems, and the authors provide theoretical guarantees of expressivity and resolution invariance, demonstrating competitive accuracy and significant speedups over MCMC in 1D, 2D, and 64D SDE families.
arXiv:2608. 05600v1 Announce Type: cross Abstract: Flow-based generative models are typically sampled by solving a deterministic ordinary differential equation (ODE), whereas online reinforcement learning requires stochastic rollouts for policy exploration and optimization.
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.
Flow-based generative models are typically sampled by solving a deterministic ordinary differential equation (ODE), whereas online reinforcement learning requires stochastic rollouts for policy exploration and optimization. Existing GRPO methods for flow models therefore replace the inference-time ODE with a stochastic differential equation (SDE) during training.
arXiv:2607. 26398v1 Announce Type: new Abstract: Diffusion and flow-based models benefit from simple regression losses, but inference incurs significant overhead because sampling requires integration.
arXiv:2608. 10384v1 Announce Type: new Abstract: This paper studies inverse sampling for L\'evy-driven generative models from the perspective of Markov generators.
The paper introduces Probability‑Flow Distillation (PFD), a new method for matching parameter distributions in diffusion‑based models. It extends the particle variational inference framework of Variational Score Distillation to Score Distillation Sampling (SDS) and Score Distillation via Inversion (SDI), revealing that SDS focuses on mode collapse while SDI converges to a contracted distribution. By replacing a single Euler step in SDI with a full reverse probability‑flow ODE solve and simplifying the gradient, PFD achieves distribution matching with only a forward ODE solve, and experiments on synthetic data, CelebA, and text‑to‑3D tasks confirm its effectiveness.
arXiv:2602.15396v2 Announce Type: replace Abstract: Diffusion models often yield highly curved trajectories and noisy score targets due to an uninformative, memoryless forward process that induces in...
arXiv:2601. 14430v2 Announce Type: replace-cross Abstract: Controlling generative models is computationally expensive.
arXiv:2606. 07835v1 Announce Type: new Abstract: A fundamental tension exists in the large-step inference of diffusion models via their deterministic probability flow ordinary differential equation (PF-ODE) trajectories, which we identify as the contractivity trap: efficient inference favors large step sizes, while aggressive steps and highly expressive denoisers can undermine contraction-based stability certificates for error suppression.