cs.AIOct 31, 2026

A Discrete-Time Variational Objective for Degenerate Diffusion and Equivalence to Flow Matching

Authors: Rares Dolga, Harshad Dahake, David Barber

Organizations: Foundational AI CDT, University College London · Centre for Artificial Intelligence, University College London · Centre for Artificial Intelligence, University College London, UIPath

Abstract

Diffusion models and more recently Flow models have widespread application. In this work we consider degenerate Diffusion models in which the per-step generator is deterministic. We construct a modified variational framework and show a formal equivalence between Flow models and Degenerate Diffusion models. For our discrete-time variational objective we show that the optimal degenerate generator recovers the data distribution in the limit of an infinite number of generator steps. Our work therefore provides a unified perspective, showing that discrete-time implementations of flow matching and the discrete-time Degenerate Diffusion model can be considered within the same simple variational framework, removing the need for the continuous-time machinery normally used to justify flow matching models.

Explore similar work

CardsList
  1. A Unified Measure-Theoretic View of Diffusion, Score-Based, and Flow Matching Generative Models

    May 7, 2026Aditya Ranganath, Mukesh SinghalFlow MatchingGenerative Modeling

  2. Generative Modeling with Continuous Flows: Sample Complexity of Flow Matching

    Nov 1, 2026Mudit Gaur, Prashant Trivedi, Shuchin Aeron +3Flow MatchingFlow-Based Generative Modeling

  3. Discrete Flow Matching: Convergence Guarantees Under Minimal Assumptions

    May 9, 2026Le-Tuyet-Nhi Pham, Giovanni Conforti, Zhenjie Ren +1Flow MatchingGenerative Modeling