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.
arXiv:2607. 27169v1 Announce Type: new Abstract: Solving a continuous algebraic constraint system requires two decisions: which values satisfy the constraints, and which structural augmentation renders an unsolvable system solvable.
arXiv:2606. 28301v1 Announce Type: new Abstract: Inference-time scaling is a promising paradigm to improve generative models, especially when outputs must satisfy structural constraints or optimize downstream rewards.
arXiv:2610.22763v1 Announce Type: new Abstract: Bayesian optimization (BO) over discrete spaces is challenging due to missing gradients and the sparsity of valid solutions. Latent-space BO sidesteps...
The paper introduces a new method for perturbing data distributions in a way that respects equality constraints, allowing generative models to better handle constrained data. By adjusting the distribution while preserving the manifold geometry, the approach ensures support matches the ambient space dimension. Experiments with diffusion models and normalizing flows demonstrate improved data recovery and stable sampling across several tasks.
The paper introduces Decomposition-Aware Distributional Optimization (DADO), a new algorithm that exploits decomposability in property predictors to improve in‑silico design of discrete objects such as proteins, circuits, and materials. DADO uses a soft‑factorized search distribution and graph message‑passing to coordinate optimization across linked factors defined by a junction tree over design variables. The method aims to make distributional optimization over combinatorial design spaces more efficient by leveraging the structure of the predictive model.
arXiv:2506. 00849v2 Announce Type: replace Abstract: Despite the empirical success of Diffusion Models (DMs) and Variational Autoencoders (VAEs), their generalization performance remains theoretically underexplored, especially lacking a full consideration of the shared encoder-generator structure.
The paper explores using denoising diffusion generative models as plug‑and‑play priors for high‑dimensional inference problems. By combining a pre‑trained diffusion prior with a differentiable auxiliary constraint, the authors enable approximate inference through iterative differentiation across multiple noisy versions of the data. This framework opens possibilities for conditional generation, image segmentation, and novel combinatorial optimization algorithms.
arXiv:2606. 23920v1 Announce Type: cross Abstract: The task of compositional generation involves using a conditional generative model, trained only on a subset of the possible conditions, to produce samples from compositionally-defined target distributions such as a geometric combination of the source distributions.
arXiv:2607. 23226v1 Announce Type: new Abstract: Despite the empirical success of score-based diffusion models, a complete theoretical understanding of how finite-sample learning, network parameterization, and numerical discretization jointly dictate generative quality remains underdeveloped.
arXiv:2609.40235v1 Announce Type: cross Abstract: Continuous diffusion language models generate all tokens in parallel, yet high-quality generation can still require hundreds of network evaluations (...
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.