mlsanityData to 13 Oct 2026

Corrected Samplers for Discrete Flow Models

arXiv 2601.22519 ↗First posted 30 Jan 2026stat.ML cs.LGcited by 3

On the map: Diffusion models → Diffusion foundations and sampling

Abstract (arXiv)

Discrete flow models (DFMs) have been proposed to learn the data distribution on finite state space, offering a flexible framework as an alternative to discrete diffusion models. A line of recent work has studied samplers for discrete diffusion models, such as tau-leaping and Euler solver. However, these samplers require a large number of iterations to control discretization error, since the transition rates are frozen in time and evaluated at the initial state within each time interval. Moreover, theoretical results for these samplers often require boundedness conditions of the transition rate or they focus on a specific type of source distributions. To address those limitations, we establish non-asymptotic discretization error bounds for those samplers without any restriction on transition rates and source distributions, under the framework of discrete flow models. Furthermore, by analyzing a one-step lower bound of the Euler sampler, we propose two corrected samplers: textittime-corrected sampler and textitlocation-corrected sampler, which can reduce the discretization error of tau-leaping and Euler solver with almost no additional computational cost. We rigorously show that the location-corrected sampler has a lower complexity than existing parallel samplers. We validate the effectiveness of the proposed method by achieving better generation quality with reduced inference time on simulations and text-to-image generation tasks. Code can be found in https://github.com/WanZhengyan/Corrected-Samplers-for-Discrete-Flow-Models.

Key facts. Cited by 3 papers in the map (data through 13 Oct 2026). Placed in Diffusion foundations and sampling, one of 14 directions in Diffusion models. Builds on 35 of its 43 references that are in the map. First posted on arXiv 30 Jan 2026.

Builds on

35 of 43 references.

Closest ancestors · 12

Same direction, newest first

  1. 2025Discrete Guidance Matching: Exact Guidance for Discrete Flow Matching26 Sep
  2. 2025Discrete Diffusion Models: Novel Analysis and New Sampler Guarantees20 Sep
  3. 2025Absorb and Converge: Provable Convergence Guarantee for Absorbing Discrete Diffusion Models2 Jun
  4. 2025Almost Linear Convergence under Minimal Score Assumptions: Quantized Transition Diffusion28 May
  5. 2025Fast Solvers for Discrete Diffusion Models: Theory and Applications of High-Order Algorithms1 Feb
  6. 2024How Discrete and Continuous Diffusion Meet: Comprehensive Analysis of Discrete Diffusion Models via a Stochastic Integral Framework4 Oct
  7. 2024Convergence of Score-Based Discrete Diffusion Models: A Discrete-Time Analysis3 Oct
  8. 2024Convergence Analysis of Discrete Diffusion Model: Exact Implementation through Uniformization12 Feb
  9. 2022Score-based Continuous-time Discrete Diffusion Models30 Nov
  10. 2022A Continuous Time Framework for Discrete Denoising Models30 May
  11. 2021Structured Denoising Diffusion Models in Discrete State-Spaces7 Jul
  12. 2020Score-Based Generative Modeling through Stochastic Differential Equations26 Nov

Other references · 23

  1. 2022Flow Matching for Generative Modelingcited by 5,542
  2. 2022Flow Straight and Fast: Learning to Generate and Transfer Data with Rectified Flowcited by 3,607
  3. 2022Building Normalizing Flows with Stochastic Interpolantscited by 979
  4. 2025Large Language Diffusion Modelscited by 888
  5. 2024Simple and Effective Masked Diffusion Language Modelscited by 816
  6. 2023Discrete Diffusion Modeling by Estimating the Ratios of the Data Distributioncited by 725
  7. 2024Simplified and Generalized Masked Diffusion for Discrete Datacited by 614
  8. 2025Mean Flows for One-step Generative Modelingcited by 541
  9. 2024Your Absorbing Discrete Diffusion Secretly Models the Conditional Distributions of Clean Datacited by 377
  10. 2024Discrete Flow Matchingcited by 309
  11. 2024Generative Flows on Discrete State-Spaces: Enabling Multimodal Flows with Applications to Protein Co-Designcited by 299
  12. 2024Flow Matching Guide and Codecited by 295
11 more
  1. 2021Autoregressive Diffusion Modelscited by 209
  2. 2022Concrete Score Matching: Generalized Score Matching for Discrete Datacited by 146
  3. 2024Generator Matching: Generative modeling with arbitrary Markov processescited by 84
  4. 2024DeFoG: Discrete Flow Matching for Graph Generationcited by 78
  5. 2024Flow Matching with General Discrete Paths: A Kinetic-Optimal Perspectivecited by 56
  6. 2025FUDOKI: Discrete Flow-based Unified Understanding and Generation via Kinetic-Optimal Velocitiescited by 46
  7. 2025FS-DFM: Fast and Accurate Long Text Generation with Few-Step Diffusion Language Modelscited by 16
  8. 2025A Theoretical Analysis of Discrete Flow Matching Generative Modelscited by 13
  9. 2025MaskFlow: Discrete Flows For Flexible and Efficient Long Video Generationcited by 12
  10. 2025Uniform Discrete Diffusion with Metric Path for Video Generationcited by 11
  11. 2025Error Analysis of Discrete Flow with Generator Matchingcited by 9

Built on by

Cited by year (2026 to 13 Oct)

Citing papers per year: 2026: 3.

3 papers.

Similar, not cited

Close in wording, no citation either way

  1. 2026Provably adaptive sampling with uniform and remasking discrete diffusion models
  2. 2026Asymptotic Preservation and Uniform Accuracy of Diffusion and Flow-Matching Samplers
  3. 2026Efficient Sampling with Discrete Diffusion Models: Sharp and Adaptive Guarantees
  4. 2024A Sharp Convergence Theory for The Probability Flow ODEs of Diffusion Models
  5. 2025Elucidating Rectified Flow with Deterministic Sampler: Polynomial Discretization Complexity for Multi and One-step Models
  6. 2026High-accuracy and dimension-free sampling with diffusions
  7. 2026Schedule optimization for tau-leaping in masked discrete diffusion
  8. 2026A Time-Reparameterized Cumulative Intensity Extrapolation Sampler for Discrete Flow Matching