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:2602.12624v2 Announce Type: replace
Abstract: Diffusion-based generative models have achieved remarkable performance across various domains, yet their practical deployment is often limited by h...
By Sangwoo Jo, Sungjoon Choi
arXiv:2606. 24140v1 Announce Type: new Abstract: Discrete flow matching (DFM) provides a principled framework for generative modeling on discrete state spaces via continuous-time Markov chain dynamics.
By Feiyang Fu, Hehe Fan
arXiv:2608. 13096v1 Announce Type: new Abstract: Limit order book (LOB) simulators are most useful to practitioners when they combine realistic market dynamics, computationally efficient sampling, controllable scenario generation, and the ability to generalize beyond the instruments seen during training---properties that existing agent-based and deep generative simulators provide only partially.
By Zhuohan Wang, Andreea Bacalum, Ollie Olby, Carmine Ventre, Namid Stillman
arXiv:2610.01193v1 Announce Type: cross
Abstract: Counterfactual generation seeks to sample outcomes under a hypothetical intervention or decision using observational data collected under the factual...
By Yunrui Guan, Krishnakumar Balasubramanian, Shiva Prasad Kasiviswanathan
The paper introduces Flow Divergence Sampler (FDS), a training‑free method that refines intermediate states in flow‑matching models by using the divergence of the marginal velocity field to detect and correct misguidance toward low‑density regions. FDS operates during inference, requires no additional training, and can be applied as a plug‑and‑play module with standard solvers and existing flow backbones. Experiments show that FDS consistently improves fidelity in tasks such as text‑to‑image synthesis and inverse problems.
By Yeonwoo Cha, Jaehoon Yoo, Semin Kim, Yunseo Park, Jinhyeon Kwon, Seunghoon Hong
The paper introduces CAT-Flow, a pair of lightweight, training‑free algorithms—CAT‑OV and CAT‑OT—that adapt step‑sizes during Flow Matching inference by estimating curvature in time or state space. These methods avoid extra neural evaluations and achieve constant‑order truncation error bounds. Experiments show that CAT‑OV and CAT‑OT improve image quality metrics across four text‑to‑image Flow Matching models, cutting the required generation steps by up to 40%.
By Qinchan Li, Pedro Cisneros-Velarde, Keru Fu, Samuel Antunes Miranda, Sharan Vaswani, Hao Zhang
arXiv:2610.02260v1 Announce Type: new
Abstract: Flow matching models excel at generative modeling, and many downstream applications require their samples to satisfy prescribed constraints, such as ob...
By Yesom Park, Kelvin Kan, Qifan Chen, Thomas Flynn, Hayden Schaeffer. Xihaier Luo
arXiv:2607. 06114v1 Announce Type: cross Abstract: Diffusion and flow matching models generate high-quality samples, but their ODE samplers often need tens to hundreds of neural function evaluations (NFEs).
By Xin Peng, Ang Gao
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.
By Yingqing Guo, Hui Yuan, Zijian He, Mengdi Wang, Zheng Ding
Diffusion models rely on numerical solvers requiring time-discretization, which has a large influence on the tradeoff between sampling cost and quality. However, the computational difficulty of the re...
arXiv:2610.03503v1 Announce Type: new
Abstract: Training-free posterior sampling methods, also known as Plug-and-Play methods, leverage pretrained unconditional diffusion or flow-matching models to s...
By Liam Moroy, Jean-Fran\c{c}ois Giovannelli, Yoann Altmann, Steve McLaughlin, Fr\'ed\'eric Champagnat, Guillaume Bourmaud