The Cosine Schedule is Fisher-Rao-Optimal for Masked Discrete Diffusion Models
On the map: Diffusion models → Diffusion foundations and sampling
Abstract (arXiv)
In this work, we study the problem of choosing the discretisation schedule for sampling from masked discrete diffusion models in terms of the information geometry of the induced probability path. Specifically, we show that the optimal schedule under the Fisher-Rao geometry recovers the popularly-used cosine schedule.
Key facts. Cited by 11 papers in the map (data through 14 Oct 2026). Placed in Diffusion foundations and sampling, one of 14 directions in Diffusion models. Builds on 17 of its 24 references that are in the map. First posted on arXiv 6 Aug 2025.
Builds on
17 of 24 references.
Closest ancestors · 10
Same direction, newest first
- 2024Score-Optimal Diffusion Schedules10 Dec
- 2024textitJump Your Steps: Optimizing Sampling Schedule of Discrete Diffusion Models10 Oct
- 2024Align Your Steps: Optimizing Sampling Schedules in Diffusion Models22 Apr
- 2023Using Ornstein-Uhlenbeck Process to understand Denoising Diffusion Probabilistic Model and its Noise Schedules29 Nov
- 2023Image generation with shortest path diffusion1 Jun
- 2022A Continuous Time Framework for Discrete Denoising Models30 May
- 2021Structured Denoising Diffusion Models in Discrete State-Spaces7 Jul
- 2021Learning to Efficiently Sample from Diffusion Probabilistic Models7 Jun
- 2021Improved Denoising Diffusion Probabilistic Models18 Feb
- 2020Score-Based Generative Modeling through Stochastic Differential Equations26 Nov
Other references · 7
- 2022Flow Matching for Generative Modelingcited by 5,702
- 2023Stochastic Interpolants: A Unifying Framework for Flows and Diffusionscited by 939
- 2024Simple and Effective Masked Diffusion Language Modelscited by 848
- 2024Simplified and Generalized Masked Diffusion for Discrete Datacited by 626
- 2025Train for the Worst, Plan for the Best: Understanding Token Ordering in Masked Diffusionscited by 214
- 2025The Diffusion Dualitycited by 135
- 2023Provable benefits of annealing for estimating normalizing constants: Importance Sampling, Noise-Contrastive Estimation, and beyondcited by 13
Built on by
Citing papers per year: 2025: 4; 2026: 7.
11 papers.
- 2025Error Bounds and Optimal Schedules for Masked Diffusions with Factorized Approximationscited by 14
- 2025Learning Boltzmann Generators via Constrained Mass Transportcited by 9
- 2025Learnable Sampler Distillation for Discrete Diffusion Modelscited by 8
- 2025On the Design of One-step Diffusion via Shortcutting Flow Pathscited by 4
- 2026Discrete-WAM: Unified Discrete Vision-Action Token Editing for World-Policy Learningcited by 4
- 2026Accelerating Discrete Diffusion Models with Parallel-In-Time Samplingcited by 4
- 2026AnCoder: Anchored Code Generation via Discrete Diffusion Modelscited by 1
- 2026Kinetic-Optimal Scheduling with Moment Correction for Metric-Induced Discrete Flow Matching in Zero-Shot Text-to-Speechcited by 1
- 2026A Gaussian Perspective for Distributional Discrepancy in Generative Diffusion Modelscited by 0
- 2026The Loss Floor of Denoising Score Matching: Fisher Geometry from Schr"odinger Bridgescited by 0
- 2026Schedule optimization for tau-leaping in masked discrete diffusioncited by 0
- 2026Schedule optimization for tau-leaping in masked discrete diffusion18 Sep 2026
- 2026The Loss Floor of Denoising Score Matching: Fisher Geometry from Schr"odinger Bridges24 Aug 2026
- 2026Accelerating Discrete Diffusion Models with Parallel-In-Time Sampling1 Jul 2026
- 2026Discrete-WAM: Unified Discrete Vision-Action Token Editing for World-Policy Learning4 Jun 2026
- 2026Kinetic-Optimal Scheduling with Moment Correction for Metric-Induced Discrete Flow Matching in Zero-Shot Text-to-Speech10 May 2026
- 2026AnCoder: Anchored Code Generation via Discrete Diffusion Models5 Feb 2026
- 2026A Gaussian Perspective for Distributional Discrepancy in Generative Diffusion Models20 Jan 2026
- 2025On the Design of One-step Diffusion via Shortcutting Flow Paths3 Dec 2025
- 2025Error Bounds and Optimal Schedules for Masked Diffusions with Factorized Approximations29 Oct 2025
- 2025Learning Boltzmann Generators via Constrained Mass Transport21 Oct 2025
- 2025Learnable Sampler Distillation for Discrete Diffusion Models24 Sep 2025
Similar, not cited
Close in wording, no citation either way
- 2025Why Masking Diffusion Works: Condition on the Jump Schedule for Improved Discrete Diffusion
- 2026The data geometry of masking diffusion: Certified-optimal schedules via unmasking growth complexity
- 2026Efficient Sampling with Discrete Diffusion Models: Sharp and Adaptive Guarantees
- 2025Masked Diffusion Models as Energy Minimization
- 2025Masked Diffusion Models are Secretly Learned-Order Autoregressive Models
- 2026Noise Schedule Design for Diffusion Models: An Optimal Control Perspective
- 2025Path Planning for Masked Diffusion Model Sampling
- 2025Optimal Inference Schedules for Masked Diffusion Models