paper-with-me

홈 › Papers

Efficient Diffusion Models under Nonconvex Equality and Inequality constraints via Landing

2026-04-20 · Kijung Jeon, Michael Muehlebach, Molei Tao arxiv

Generative modeling within constrained sets is essential for scientific and engineering applications involving physical, geometric, or safety requirements (e.g., molecular generation, robotics). We present a unified framework for constrained diffusion models on generic nonconvex feasible sets $Σ$ that simultaneously enforces equality and inequality constraints throughout the diffusion process. Our framework incorporates both overdamped and underdamped dynamics for forward and backward sampling. A key algorithmic innovation is a computationally efficient landing mechanism that replaces costly and often ill-defined projections onto $Σ$, ensuring feasibility without iterative Newton solves or projection failures. By leveraging underdamped dynamics, we accelerate mixing toward the prior distribution, effectively alleviating the high simulation costs typically associated with constrained diffusion. Empirically, this approach reduces function evaluations and memory usage during both training and inference while preserving sample quality. On benchmarks featuring equality and mixed constraints, our method achieves comparable sample quality to state-of-the-art baselines while significantly reducing computational cost, providing a practical and scalable solution for diffusion on nonconvex feasible sets.

📄 PDF Abstract BibTeX arXiv:2604.17838

Code (0)

등록된 구현이 없습니다.

Similar Papers 제목 키워드 기반

Fast Non-Log-Concave Sampling under Nonconvex Equality and Inequality Constraints with Landing

2025-10-24 · Kijung Jeon, Michael Muehlebach, Molei Tao arxiv

Sampling from constrained statistical distributions is a fundamental task in various fields including Bayesian statistics, computational chemistry, and statistical physics. This article considers the cases where the cons…

Efficiently testing local optimality and escaping saddles for ReLU networks

2018-09-28 · ICLR 2019 5 · Chulhee Yun, Suvrit Sra, Ali Jadbabaie

We provide a theoretical algorithm for checking local optimality and escaping saddles at nondifferentiable points of empirical risks of two-layer ReLU networks. Our algorithm receives any parameter value and returns: loc…

Stochastic Smoothed Primal-Dual Algorithms for Nonconvex Optimization with Linear Inequality Constraints

2025-04-10 · Ruichuan Huang, Jiawei Zhang, Ahmet Alacaoglu

We propose smoothed primal-dual algorithms for solving stochastic and smooth nonconvex optimization problems with linear inequality constraints. Our algorithms are single-loop and only require a single stochastic gradien…

A Single-Loop Gradient Descent and Perturbed Ascent Algorithm for Nonconvex Functional Constrained Optimization

2022-07-12 · Songtao Lu

Nonconvex constrained optimization problems can be used to model a number of machine learning problems, such as multi-class Neyman-Pearson classification and constrained Markov decision processes. However, such kinds of …

First-Order Methods for Linearly Constrained Bilevel Optimization

2024-06-18 · Guy Kornowski, Swati Padmanabhan, Kai Wang, Zhe Zhang 외

Algorithms for bilevel optimization often encounter Hessian computations, which are prohibitive in high dimensions. While recent works offer first-order methods for unconstrained bilevel problems, the constrained setting…

Bilevel Optimization