paper-with-me

Papers

Diffusion Models as Constrained Samplers for Optimization with Unknown Constraints

2024-02-28 · Lingkai Kong, Yuanqi Du, Wenhao Mu, Kirill Neklyudov, Valentin De Bortoli, Dongxia Wu, Haorui Wang, Aaron Ferber, Yi-An Ma, Carla P. Gomes, Chao Zhang

Addressing real-world optimization problems becomes particularly challenging when analytic objective functions or constraints are unavailable. While numerous studies have addressed the issue of unknown objectives, limited research has focused on scenarios where feasibility constraints are not given explicitly. Overlooking these constraints can lead to spurious solutions that are unrealistic in practice. To deal with such unknown constraints, we propose to perform optimization within the data manifold using diffusion models. To constrain the optimization process to the data manifold, we reformulate the original optimization problem as a sampling problem from the product of the Boltzmann distribution defined by the objective function and the data distribution learned by the diffusion model. Depending on the differentiability of the objective function, we propose two different sampling methods. For differentiable objectives, we propose a two-stage framework that begins with a guided diffusion process for warm-up, followed by a Langevin dynamics stage for further correction. For non-differentiable objectives, we propose an iterative importance sampling strategy using the diffusion model as the proposal distribution. Comprehensive experiments on a synthetic dataset, six real-world black-box optimization datasets, and a multi-objective molecule optimization dataset show that our method achieves better or comparable performance with previous state-of-the-art baselines.

📄 PDF Abstract BibTeX arXiv:2402.18012

Code (0)

등록된 구현이 없습니다.

Methods 이 논문이 사용한 방법론

Diffusion Diffusion models generate samples by gradually removing noise from a signal, and their training objective can be expressed as a reweighted variational lower-bound…

Similar Papers 제목 키워드 기반

Score-based constrained generative modeling via Langevin diffusions with boundary conditions

2025-10-28 · Adam Nordenhög, Akash Sharma arxiv

Score-based generative models based on stochastic differential equations (SDEs) achieve impressive performance in sampling from unknown distributions, but often fail to satisfy underlying constraints. We propose a constr…

D2PO: Optimizing Diffusion Samplers via Dynamic Preference

2026-07-07 · Jinkyu Kim, Jinyoung Choi, Bohyung Han arxiv

We propose D2PO (Dynamic Direct Preference Optimization), a principled framework for optimizing diffusion sampling policies with respect to timestep schedules and classifier-free guidance (CFG) weights. Our work is motiv…

Manifold Sampling via Entropy Maximization

2026-05-12 · Cornelius V. Braun, Tilman Burghoff, Marc Toussaint arxiv

Sampling from constrained distributions has a wide range of applications, including in Bayesian optimization and robotics. Prior work establishes convergence and feasibility guarantees for constrained sampling, but assum…

Density Estimation

Metropolis Sampling for Constrained Diffusion Models

2023-07-11 · NeurIPS 2023 11

Denoising diffusion models have recently emerged as the predominant paradigm for generative modelling on image domains. In addition, their extension to Riemannian manifolds has facilitated a range of applications across …

Computational EfficiencyDenoisingProtein Designvalid

FlowAWR: Online Adaptive Flow Reinforcement via Advantage-Weighted Rectification

2026-06-29 · Zheming Fu, Ruizhe He, Wei Shang, Xiaoxiao Ma 외 arxiv

Aligning generative flow models on continuous spaces via online reinforcement learning is constrained by intractable trajectory likelihoods. Existing density-approximated policy gradient methods rely on stochastic SDE sa…

Reinforcement Learning