The paper introduces a data‑free learning objective called relative trajectory balance for training diffusion models to sample from a posterior defined by a diffusion prior and an arbitrary black‑box constraint or likelihood. It proves asymptotic correctness of this objective and demonstrates its use across vision, language, and multimodal tasks, including classifier guidance, language infilling, and text‑to‑image generation. Additionally, the method is applied to continuous control with a score‑based behavior prior, achieving state‑of‑the‑art results in offline reinforcement learning.
By Siddarth Venkatraman, Moksh Jain, Luca Scimeca, Minsu Kim, Marcin Sendera, Mohsin Hasan, Luke Rowe, Sarthak Mittal, Pablo Lemos, Emmanuel Bengio, Alexandre Adam, Jarrid Rector-Brooks, Yoshua Bengio, Glen Berseth, Esmeralda S. Whitammer
arXiv:2607. 14398v1 Announce Type: cross Abstract: Constrained generative models aim to produce samples that satisfy complex feasibility constraints while remaining faithful to the data distribution.
By Xiaoxuan Liang, Saeid Naderiparizi, Berend Zwartsenberg, Frank Wood
arXiv:2606. 15048v1 Announce Type: new Abstract: Diffusion models are typically trained with objectives that focus on local denoising targets at individual time steps (or adjacent pairs), which do not enforce consistency between predictions along the denoising trajectory.
By Qizhen Ying, Yangchen Pan, Victor Adrian Prisacariu, Junfeng Wen
arXiv:2605. 13175v2 Announce Type: replace Abstract: Recent works have proposed incorporating heavy-tailed (HT) noise into diffusion- and flow-based generative models, with the goals of better recovering the tails of target distributions and improving generative diversity.
By Hamza Cherkaoui, H\'el\`ene Halconruy, Antonio Ocello
arXiv:2607. 23488v1 Announce Type: new Abstract: Text-to-image diffusion models expose many inference-time sampling parameters, including prompts, negative prompts, classifier-free guidance scales, and noise schedules.
By Arisrei Lim, Yossi Gandelsman
arXiv:2502. 04646v2 Announce Type: replace-cross Abstract: Weighted sampling -- sampling from a probability density function (PDF) proportional to the product of a base PDF and a weight function -- is a fundamental technique with wide-ranging applications in variance reduction, biased sampling, data augmentation, and more.
By Heasung Kim, Taekyun Lee, Hyeji Kim, Gustavo de Veciana
arXiv:2410.01432v3 Announce Type: replace
Abstract: Amortized inference is the task of training a parametric model, such as a neural network, to approximate a distribution with a given unnormalized d...
By Minsu Kim, Sanghyeok Choi, Taeyoung Yun, Emmanuel Bengio, Leo Feng, Jarrid Rector-Brooks, Sungsoo Ahn, Jinkyoo Park, Esmeralda S. Whitammer, Yoshua Bengio
arXiv:2606. 15793v1 Announce Type: cross Abstract: This paper explores policy gradient algorithms for training stochastic policies to sample from structured discrete probability distributions under the Generative Flow Network (GFlowNet) framework.
By Anna Zykova-Myzina, Timofei Gritsaev, Daniil Tiapkin, Nikita Morozov
arXiv:2512. 20685v3 Announce Type: replace-cross Abstract: Diffusion models have recently emerged as powerful learners for simulation-based inference (SBI), enabling fast and accurate estimation of latent parameters from simulated and real data.
By Jonas Arruda, Niels Bracher, Ullrich K\"othe, Jan Hasenauer, Stefan T. Radev
Bridge Matching Sampler (BMS) is a new diffusion-based sampling method that generalizes least-squares matching objectives into fixed-point iterations using Nelson's relation. It learns a stochastic transport map between any prior and target distribution with a single, scalable, and stable objective, and a damped variant adds regularization to reduce mode collapse. Experiments show BMS can sample at unprecedented scales while preserving mode diversity, achieving state‑of‑the‑art results on complex synthetic densities and high‑dimensional molecular benchmarks.
By Denis Blessing, Lorenz Richter, Julius Berner, Egor Malitskiy, Gerhard Neumann
Text-to-image diffusion models expose many inference-time sampling parameters, including prompts, negative prompts, classifier-free guidance scales, and noise schedules. These parameters are typically manually chosen once and then held fixed across prompts and denoising timesteps, even though different prompts and stages of generation can benefit from different parameter values.
The paper introduces OSIS, a one‑step implicit sampler that uses short‑time MCMC dynamics to define a local target for an implicitly modelled distribution. In the asymptotic limit, the model converges to a fixed point of the MCMC kernel, enabling unbiased sampling from the Bayesian posterior. Experiments show OSIS outperforms multi‑step amortised samplers and non‑amortised MCMC baselines while being far more efficient at sampling time.
By Vincent Pauline, Kirill Tamogashev, Arran Carter, Sanghyeok Choi, Stefan Bauer, Esmeralda S. Whitammer