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: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.
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: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 proposes a deep learning framework that learns priors for inverse problems by exploiting the relationship between proximal operators and Hamilton–Jacobi partial differential equations. Unlike existing methods that require inverting the prior after training, this approach learns the prior directly, enabling efficient evaluation in a single forward pass. Numerical experiments demonstrate the method’s effectiveness in dimensions up to 64.
arXiv:2607. 04775v1 Announce Type: cross Abstract: Score-based Generative Models (SGMs) have achieved impressive performance in data generation across a wide range of applications.
arXiv:2605. 25811v2 Announce Type: replace-cross Abstract: We study counterfactual distribution learning for high-dimensional outcomes whose laws may concentrate near lower-dimensional structure.
Score-based Generative Models (SGMs) have achieved impressive performance in data generation across a wide range of applications. While the statistical properties of their sampling procedures are increasingly well understood, the optimization dynamics underlying their training remain less explored.
The paper introduces a novel technique called "persistence of memory" to enhance stochastic subspace methods for large‑scale optimisation. By using a weakly correlated guidance vector that is refreshed only at wide intervals, the method provides a structured direction for random subspace descent. The authors demonstrate that this guidance can be efficiently computed in sparse or minibatch settings and present the first theoretical analysis of classical SSD methods for sparse functions, showing alignment with low‑lying Hessian eigenvectors near the optimum.
arXiv:2501. 12982v3 Announce Type: replace-cross Abstract: This paper investigates how diffusion generative models leverage (unknown) low-dimensional structure to accelerate sampling.
arXiv:2606. 30230v1 Announce Type: cross Abstract: Learned reconstruction operators for inverse problems are typically trained under a fixed noise model, and generalize poorly when the distribution during testing differs from the one assumed during training.
arXiv:2607. 26562v1 Announce Type: cross Abstract: We study optimization under performative prediction, where deploying a model affects the future data distribution.