Neural Approximate Mirror Maps for Constrained Diffusion Models
Berthy T. Feng, Ricardo Baptista, Katherine L. Bouman

TL;DR
This paper introduces neural approximate mirror maps (NAMMs) that enable diffusion models to handle complex, non-convex constraints by transforming data into an unconstrained space, improving constraint satisfaction and inverse problem solving.
Contribution
We propose a novel neural approach to approximate mirror maps for non-convex constraints, extending the applicability of constrained diffusion models beyond convex sets.
Findings
NAMM-based models significantly improve constraint satisfaction.
The method effectively handles non-convex constraints.
Enhanced performance in constrained inverse problems.
Abstract
Diffusion models excel at creating visually-convincing images, but they often struggle to meet subtle constraints inherent in the training data. Such constraints could be physics-based (e.g., satisfying a PDE), geometric (e.g., respecting symmetry), or semantic (e.g., including a particular number of objects). When the training data all satisfy a certain constraint, enforcing this constraint on a diffusion model makes it more reliable for generating valid synthetic data and solving constrained inverse problems. However, existing methods for constrained diffusion models are restricted in the constraints they can handle. For instance, recent work proposed to learn mirror diffusion models (MDMs), but analytical mirror maps only exist for convex constraints and can be challenging to derive. We propose neural approximate mirror maps (NAMMs) for general, possibly non-convex constraints. Our…
Peer Reviews
Decision·ICLR 2025 Poster
- The method is applicable to more general constraints than previous works. - The cycle-consistency loss tailored for mirror maps and diffusion models is sound. - The experiments are conducted on diverse settings, including constrained DPS. - The ablation studies are comprehensive.
- The experiments are primarily toy. It is not clear whether the proposed method can scale to high dimensions and apply to domains such as images.
1. NAMMs generalize the concept of true mirror maps to learn approximate mirror maps to handle non-convex constraints. 2. NAMMs can handle physics-based, geometric and semantic constraints, while existing methods are restricted in the types of constraints they can handle. 3. NAMMs not only help diffusion models, but also help VAEs to improve constraint satisfaction, showing the potential to be compatible for other generative models. And NAMMs are also helpful to diffusion-based inverse-problem s
1. Theoretically, NAMMs lack the guarantee of the existence and uniqueness of the mirror maps when applied to non-convex problems. 2. The proposed method is validated on five benchmark problems in the main experiments to show the superiority of applying NAMMs to diffusion models in generating constrained data. However, in the experiments to solve inverse problems, ablation experiments, and the experiments applied to VAE, this method is only carried out on partial problems and does not fully demo
- The method is well motivated. Proper constraint satisfaction is challenging in diffusion generation, limiting many important applications in engineering, physics and computer vision. - The proposed approach is sensible, and to the best of my knowledge novel. It improves the flexibility of mirror diffusion models by obviating the need for analytical mirror maps. - The experimental results are promising on a wide array of problems. - The paper overall is well-written and easy to follow.
- It is unclear how complex of a constraint the proposed method can handle, as the gap between NAMM and the baseline is less significant for the semantic problem. - It is unclear if there is a systematic way to tune the introduced hyperparameters, and how sensitive the performance is in higher dimensions to $\sigma_{max}$.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsNeural Networks and Applications · Model Reduction and Neural Networks
MethodsSparse Evolutionary Training · Diffusion
