arXiv:2608. 19504v1 Announce Type: new Abstract: We propose a conditioning mechanism for diffusion models based on multi-speed joint diffusion of the target and the condition.
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.
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.
arXiv:2604. 17838v2 Announce Type: replace Abstract: Generative modeling within constrained sets is essential for scientific and engineering applications involving physical, geometric, or safety requirements (e.
The paper introduces a Posterior‑Dynamics Framework that leverages pretrained diffusion models as multiscale priors for linear imaging inverse problems such as deblurring, super‑resolution, and inpainting. By constructing a surrogate likelihood centered on the clean image and incorporating diffusion uncertainty, the authors derive continuous posterior dynamics and a tunable Langevin component for adaptive exploration. They prove theoretical guarantees (endpoint consistency, finite‑horizon tracking, weak accuracy) and present the PD‑IMEX sampler, which achieves high‑quality reconstructions with only 100 score evaluations and controllable fidelity‑diversity trade‑offs.
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.
arXiv:2607. 14522v1 Announce Type: new Abstract: We formulate reinforcement learning (RL) in continuous time with discrete state spaces and possibly arbitrary action spaces via a stochastic control approach, where the state dynamics are modeled as a controlled continuous-time Markov chain (CTMC).
arXiv:2606. 15359v1 Announce Type: new Abstract: Diffusion models have emerged as powerful tools for planning and control by learning multimodal distributions over actions and trajectories.
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.
We study the problem of sampling from target distributions whose potentials are simultaneously non-smooth, subject to superlinear gradient growth, and non-convex. We introduce the Subgradient Tamed Unadjusted Langevin Algorithm (SG-TULA), a discretisation of the Langevin diffusion that operates directly on subgradients, without relying on computationally demanding smoothing procedures.
The paper introduces ZeNOVA, a gradient‑free method for aligning initial noise in generative models. It uses annealed soft‑value guidance, manifold‑constrained hyperspherical Langevin dynamics, and Metropolis‑Hastings jumps to address instability in black‑box reward settings. Experiments on image and video models show ZeNOVA outperforms existing zeroth‑order baselines by more stably optimizing noise toward higher rewards.
Recent advances in distillation and flow-map models have enabled deterministic one- or few-step generation for high-quality data, facilitating a new branch of reward alignment approaches that directly...