The paper introduces a new method for conditioning degenerate diffusion models, which are generative models that rely on diffusion processes with singular diffusion coefficients. Traditional approaches use score functions for guidance, but this work employs causal optimal transport to define approximate loss functions that can identify a minimum‑entropy control even when conditional densities are non‑existent or non‑smooth. The method hinges on the predictable representation property of conditioned diffusion processes and the well‑posedness of their martingale problem, following the framework of "Ust"unel.
By U\u{g}ur Ayd{\i}n, Tamer Ba\c{s}ar
arXiv:2602. 05533v3 Announce Type: replace Abstract: We study conditional generation in diffusion models under hard constraints, where generated samples must satisfy prescribed events with probability one.
By Zhengyi Guo, Wenpin Tang, Renyuan Xu
arXiv:2608. 03117v1 Announce Type: new Abstract: The performance of generative diffusion models is determined by the choice of the reference diffusion process connecting the empirical and prior distributions.
By Kentaro Kaba, Masayuki Ohzeki, Yuki Sughiyama
arXiv:2606. 13240v1 Announce Type: cross Abstract: A key strength of diffusion models lies in their flexibility, since their outputs can be controlled at sampling time through guidance.
By Rapha\"el Razafindralambo, R\'emy Sun, Fr\'ed\'eric Precioso, Jes Frellsen, Pierre-Alexandre Mattei
arXiv:2607. 10067v1 Announce Type: new Abstract: While autoregressive models optimize the exact data likelihood via the chain rule, diffusion models are typically trained with denoising objectives.
By Ziv Aharoni, Henry D. Pfister
arXiv:2608. 19504v1 Announce Type: new Abstract: We propose a conditioning mechanism for diffusion models based on multi-speed joint diffusion of the target and the condition.
By Libo Chen, Souvik Ghosh, Teo Deveney, Chris Budd, Vinay P. Namboodiri
Many modern generative modeling methods, including diffusion models, normalizing flows, and flow matching, estimate transport maps or plans between distributions without explicitly targeting an optimal transport (OT) map. In applications like generative modeling, the transport cost itself is irrelevant, and this makes it natural to target maps which are more tractable from either a statistical or computational standpoint.
arXiv:2606. 30574v1 Announce Type: new Abstract: Many modern generative modeling methods, including diffusion models, normalizing flows, and flow matching, estimate transport maps or plans between distributions without explicitly targeting an optimal transport (OT) map.
By Sivaraman Balakrishnan
arXiv:2506. 00849v2 Announce Type: replace Abstract: Despite the empirical success of Diffusion Models (DMs) and Variational Autoencoders (VAEs), their generalization performance remains theoretically underexplored, especially lacking a full consideration of the shared encoder-generator structure.
By Qi Chen, Jierui Zhu, Florian Shkurti
arXiv:2607. 23226v1 Announce Type: new Abstract: Despite the empirical success of score-based diffusion models, a complete theoretical understanding of how finite-sample learning, network parameterization, and numerical discretization jointly dictate generative quality remains underdeveloped.
By Jinshu Huang, Yiming Jiang, Chunlin Wu
arXiv:2606. 08953v1 Announce Type: new Abstract: Modern generative models often define an entire probability path from a simple prior to the data law, rather than only an endpoint map.
By Lei Luo, Yingzhen Zhang, Jian Yang
arXiv:2606. 16610v1 Announce Type: cross Abstract: Diffusion Flow Matching (DFM) has recently emerged as a versatile framework for generative modeling, yet its theoretical convergence properties remain only partially understood.
By Marta Gentiloni Silveri, Giovanni Conforti, Alain Durmus