arXiv AI

Conditional Diffusion Guidance under Hard Constraint: A Stochastic Analysis Approach

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.

arXiv Machine Learning
Jun 17

Constrained Diffusion Models with Primal-Dual Inference

arXiv:2606. 17192v1 Announce Type: new Abstract: This paper develops constrained diffusion models with primal-dual inference (PDI) to sample from optimal distributions of entropy-regularized optimization problems with \emph{average} constraints.

By Samar Hadou, Yigit Berkay Uslu, Alejandro Ribeiro
arXiv Machine Learning
Sep 4

Conditioning Degenerate Diffusion Models

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
Hugging Face Trending Papers
Sep 3

Conditioning Degenerate Diffusion Models

The paper addresses the challenge of guiding conditioned generative models that are diffusion processes with singular diffusion coefficients, where traditional conditional densities may be nonexistent or non‑smooth. It proposes using causal optimal transport to construct approximate loss functions that identify a minimum‑entropy control for guidance, relying on the predictable representation property of conditioned diffusion processes and well‑posed martingale problems à la Üstünel.

arXiv AI
Jun 10

MMD Guidance: Training-Free Distribution Adaptation for Diffusion Models via Maximum Mean Discrepancy Guidance

arXiv:2601. 08379v2 Announce Type: replace-cross Abstract: Pre-trained diffusion models have emerged as powerful generative priors for both unconditional and conditional sample generation, yet their outputs often deviate from the characteristics of user-specific target data.

By Matina Mahdizadeh Sani, Nima Jamali, Mohammad Jalali, Farzan Farnia
arXiv Machine Learning
1d ago

Learned End-to-End Guidance Schedules for Diffusion Models

The paper introduces Learned End-to-End Guidance Schedules (LEEGS) for diffusion models, which train a time‑dependent guidance schedule to balance data quality and requirement satisfaction while reducing sampling steps. LEEGS minimizes the guidance function over a small set of examples using stochastic gradient descent and employs a gradient approximation to cut training time by a factor of four. Experiments on tasks such as image inpainting, noisy image inverse problems, face‑ID‑guided generation, and PDE problems show that LEEGS outperforms baselines at the same computational budget or matches constant guidance with only 10% of the steps.

By Aneesh Barthakur, Mathias Niepert, Luiz F. O. Chamon