On scalable and efficient training of diffusion samplers
Minkyu Kim, Kiyoung Seong, Dongyeop Woo, Sungsoo Ahn, Minsu Kim
Abstract
We address the challenge of training diffusion models to sample from unnormalized energy distributions in the absence of data, the so-called diffusion samplers.
Although these approaches have shown promise, they struggle to scale in more demanding scenarios where energy evaluations are expensive and the sampling space is high-dimensional. To address this limitation, we propose a scalable and sample-efficient framework that properly harmonizes the powerful classical sampling method and the diffusion sampler. Specifically, we utilize Monte Carlo Markov chain (MCMC) samplers with a novelty-based auxiliary energy as a Searcher to collect off-policy samples, using an auxiliary energy function to compensate for exploring modes the diffusion sampler rarely visits. These off-policy samples are then combined with on-policy data to train the diffusion sampler, thereby expanding its coverage of the energy landscape. Furthermore, we identify primacy bias, i.e., the preference of samplers for early experience during training, as the main cause of mode collapse during training, and introduce a periodic re-initialization trick to resolve this issue. Our method significantly improves sample efficiency on standard benchmarks for diffusion samplers and also excels at higher-dimensional problems and real-world molecular conformer generation.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Cited by top-tier papers6
- Trust Region Constrained Measure Transport in Path Space for Stochastic Optimal Control and InferenceDenis Blessing, Julius Berner, Lorenz Richter, Carles Domingo-Enrich et al.NeurIPS 2025 · 24 citations
- Enhancing Diffusion-Based Sampling with Molecular Collective VariablesJuno Nam, Bálint Máté, Artur P. Toshev, Manasa Kaniselvan et al.ICLR 2026 · 15 citations
- Learning Boltzmann Generators via Constrained Mass TransportChristopher von Klitzing, Denis Blessing, Henrik Schopmans, Pascal Friederich et al.ICLR 2026 · 9 citations
- Bridge Matching Sampler: Scalable Sampling via Generalized Fixed-Point Diffusion MatchingDenis Blessing, Lorenz Richter, Julius Berner, Egor Malitskiy et al.ICML 2026 · 8 citations
- Reinforced Sequential Monte Carlo for Amortised SamplingSanghyeok Choi, Sarthak Mittal, Víctor Elvira, Jinkyoo Park et al.ICML 2026 · 2 citations
Builds on24
- E(n) Equivariant Graph Neural NetworksVictor Garcia Satorras, Emiel Hoogeboom, Max WellingICML 2021 · 1,432 citations
- Equivariant Diffusion for Molecule Generation in 3DEmiel Hoogeboom, Victor Garcia Satorras, Clément Vignac, Max WellingICML 2022 · 865 citations
- Flow Network based Generative Models for Non-Iterative Diverse Candidate GenerationEmmanuel Bengio, Moksh Jain, Maksym Korablyov, Doina Precup et al.NeurIPS 2021 · 565 citations
- The Primacy Bias in Deep Reinforcement LearningEvgenii Nikishin, Max Schwarzer, Pierluca D'Oro, Pierre-Luc Bacon et al.ICML 2022 · 269 citations
- Sample-Efficient Optimization in the Latent Space of Deep Generative Models via Weighted RetrainingAustin Tripp, Erik A. Daxberger, José Miguel Hernández-LobatoNeurIPS 2020 · 186 citations
Related papers
- Adjoint Sampling: Highly Scalable Diffusion Samplers via Adjoint MatchingAaron J. Havens, Benjamin Kurt Miller, Bing Yan, Carles Domingo-Enrich et al.ICML 2025
- Flow Sampling : Learning to Sample from Unnormalized Densities via Denoising Conditional ProcessesAaron Havens, Brian Karrer, Neta ShaulICML 2026 · 2 citations
- Efficient Training of Boltzmann Generators Using Off-Policy Log-Dispersion RegularizationHenrik Schopmans, Christopher von Klitzing, Pascal FriederichICML 2026 · 1 citation
- Adjoint Schrödinger Bridge SamplerGuan-Horng Liu, Jaemoo Choi, Yongxin Chen, Benjamin Kurt Miller et al.NeurIPS 2025 · 21 citations
- Non-equilibrium Annealed Adjoint SamplerJaemoo Choi, Yongxin Chen, Molei Tao, Guan-Horng LiuNeurIPS 2025 · 9 citations
