← Back to all news
arXiv Machine Learning By Yang Hu, Na Li

D-IMPL: A Diffusion-based Solver for Parameterized BBOs

Read the original on arXiv Machine Learning →

arXiv:2609. 22752v1 Announce Type: new Abstract: Diffusion models have demonstrated strong power in generative modeling tasks across multiple domains, exhibiting a remarkable capability of learning complex distributions from samples.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv Machine Learning.

Related stories

arXiv Machine Learning
Aug 31

Amortizing intractable inference in diffusion models for vision, language, and control

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
llmsdiffusionreinforcement-learningmultimodalbenchmarks
More like this →
arXiv Machine Learning
Oct 5

Learn Feasibility Once, Optimize All Objectives: Derivative-Free Diffusion Models for Chance-Constrained Programming

The paper introduces D$^3$Opt, a derivative‑free diffusion‑based framework that separates constraint modeling from objective optimization in chance‑constrained programs. It learns a risk‑conditioned diffusion model once on constraint‑filtered decisions, then uses an annealed, particle‑based Feynman–Kac correction to optimize any post‑specified objective without retraining. The method is proven to preserve feasibility and provides an error bound, and experiments show effective optimization across smooth, non‑smooth, and non‑convex objectives, including objective transfer tasks.

By Ziwen Liu, Yan Liu, Congying Han, Tiande Guo, Yao Yan, Weichen Zhao
diffusion
More like this →