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.
Discrete Beckmann Transport Models (DBTM) are introduced as a new type of discrete diffusion and flow model that can generate language in a single step by mapping any point to a fixed point on the simplex vertices. Unlike previous approaches, DBTM eliminates the need for a pretrained teacher model and time conditioning by minimizing a conservation equation directly from data. The model can be partially trained and iterated until convergence, and it can be extended to a partial‑context interpolant that refines outputs with additional function evaluations. Experiments on language modeling and reasoning tasks show that DBTM achieves higher quality and accuracy than existing discrete diffusion and continuous flow baselines.
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.
arXiv:2606. 27617v1 Announce Type: cross Abstract: Masked Diffusion Models (MDMs) promise fast, parallel language generation, but their reverse transition factorises across token positions -- an approximation that breaks down in the few-step sampling regime where parallel generation ought to provide the greatest efficiency gains.
arXiv:2607. 00714v1 Announce Type: cross Abstract: Self-conditioning is a core technique that enhances continuous flow-based language models, where the model learns to denoise generated text by conditioning on its own denoising estimate.
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 Corrective Forcing (CoF), a post‑training method that aligns diffusion and flow generative models for speech enhancement by training them on self‑generated rollout states. CoF corrects predictions toward ground truth under dynamic sampling schedules and regularizes local evolution with counterfactual transitions, applying a unified objective across both model types. Experiments on SB‑VE and OT‑CFM show improved perceptual quality, reconstruction fidelity, and robustness to varying sampling steps.
arXiv:2609.36324v1 Announce Type: cross Abstract: Flow-matching text-to-speech (TTS) models achieve high synthesis quality but require many neural function evaluations (NFEs) to integrate their gener...
arXiv:2604. 27147v3 Announce Type: replace-cross Abstract: In generative modeling, we often wish to produce samples that maximize a user-specified reward such as aesthetic quality or alignment with human preferences, a problem known as \textit{guidance}.
Continuous-time generative frameworks construct probability paths between base and target domains by optimizing time-dependent velocity fields. While theoretical targets favor straight trajectories, empirical networks develop complex path deformations.
arXiv:2607. 21427v1 Announce Type: new Abstract: Discrete flow matching provides a flexible framework for generative modeling on discrete structures.
arXiv:2607. 12616v1 Announce Type: new Abstract: Continuous-time generative frameworks construct probability paths between base and target domains by optimizing time-dependent velocity fields.