arXiv AI
Discrete MeanFlow: One-Step Generation via Conditional Transition Kernels
Read the original on arXiv AI →The Flow has not summarised this story yet — read it at arXiv AI.
Related stories
arXiv AI
Oct 1
Acceleration of Diffusion Language Model through Discrete Average Generator
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...
arXiv AI
Jul 2
Flow-Map GRPO: Reinforcement Learning for Few-Step Flow-Map Generators via Anchored Stochastic Composition
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.
arXiv AI
Oct 9
Finsler Flow Matching: Dynamics-Aware Geodesic Interpolation for Single-Snapshot Trajectory Inference
The paper introduces Finsler Flow Matching (FFM), a method for learning continuous stochastic dynamics from discrete Markov transition graphs in single‑cell snapshot data. FFM constructs a Finsler geometry using first and second local moments, learns directed geodesics via neural networks, and employs these to build geometry‑aware stochastic paths that can be simulated without explicit score or flow matching. Benchmark tests show that FFM better recovers intermediate cellular states, especially when dynamics are directional or anisotropic.
Hugging Face Trending Papers
Jun 23
A Time-Reparameterized Cumulative Intensity Extrapolation Sampler for Discrete Flow Matching
Discrete flow matching (DFM) provides a principled framework for generative modeling on discrete state spaces via continuous-time Markov chain dynamics. In practice, sampling for DFM commonly employs discretizations such as $τ$-leaping, yet efficient sampling methods under a limited number of function evaluations (NFE) remain less studied.
arXiv Machine Learning
Jul 17
MeanFlowNFT: Bringing Forward-Process RL to Average-Velocity Generators
arXiv:2607. 15273v1 Announce Type: cross Abstract: MeanFlow generators achieve fast few-step sampling by predicting average velocities over time intervals, making them attractive for efficient generation.
arXiv AI
Oct 2
Discrete Wasserstein Flows for One-Step Generative Modeling
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.