Reinforced sequential Monte Carlo for amortised sampling
Not on the map. Why?
Abstract (arXiv)
This paper proposes a synergy of amortised and particle-based methods for sampling from distributions defined by unnormalised density functions. We state a connection between sequential Monte Carlo (SMC) and neural sequential samplers trained by maximum-entropy reinforcement learning (MaxEnt RL), wherein learnt sampling policies and value functions define proposal kernels and twist functions. Exploiting this connection, we introduce an off-policy RL training procedure for the sampler that uses samples from SMC -- using the learnt sampler as a proposal -- as a behaviour policy that better explores the target distribution. We describe techniques for stable joint training of proposals and twist functions and an adaptive weight tempering scheme to reduce training signal variance. Furthermore, building upon past attempts to use experience replay to guide the training of neural samplers, we derive a way to combine historical samples with annealed importance sampling weights within a replay buffer. On synthetic multi-modal targets (in both continuous and discrete spaces) and the Boltzmann distribution of alanine dipeptide conformations, we demonstrate improvements in approximating the true distribution as well as training stability compared to both amortised and Monte Carlo methods.
Key facts. Cited by 6 papers in the map (data through 14 Oct 2026). Builds on 86 of its 127 references that are in the map. First posted on arXiv 13 Oct 2025.
Builds on
86 of 127 references.
References · 86
- 2014Adam: A Method for Stochastic Optimizationcited by 37,240
- 2020Denoising Diffusion Probabilistic Modelscited by 21,076
- 2020Score-Based Generative Modeling through Stochastic Differential Equationscited by 9,122
- 2015Deep Unsupervised Learning using Nonequilibrium Thermodynamicscited by 7,058
- 2018Soft Actor-Critic: Off-Policy Maximum Entropy Deep Reinforcement Learning with a Stochastic Actorcited by 4,885
- 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,316
- 2015Prioritized Experience Replaycited by 1,099
- 2021Maximum Likelihood Training of Score-Based Diffusion Modelscited by 672
- 2017Reinforcement Learning with Deep Energy-Based Policiescited by 669
- 2021Flow Network based Generative Models for Non-Iterative Diverse Candidate Generationcited by 392
- 2021GFlowNet Foundationscited by 290
- 2022Trajectory balance: Improved credit assignment in GFlowNetscited by 251
38 more
- 2024Adjoint Matching: Fine-tuning Flow and Diffusion Generative Models with Memoryless Stochastic Optimal Controlcited by 233
- 2025A General Framework for Inference-time Scaling and Steering of Diffusion Modelscited by 224
- 2017Bridging the Gap Between Value and Policy Based Reinforcement Learningcited by 182
- 2021Path Integral Sampler: a stochastic control approach for samplingcited by 181
- 2021Maximum Entropy RL (Provably) Solves Some Robust RL Problemscited by 176
- 2022Biological Sequence Design with GFlowNetscited by 174
- 2020Stochastic Normalizing Flowscited by 157
- 2022Bayesian Structure Learning with Generative Flow Networkscited by 153
- 2023Denoising Diffusion Samplerscited by 149
- 2022An optimal control perspective on diffusion-based generative modelingcited by 147
- 2022Learning GFlowNets from partial episodes for improved convergence and stabilitycited by 132
- 2022Flow Annealed Importance Sampling Bootstrapcited by 127
- 2014Neural Variational Inference and Learning in Belief Networkscited by 117
- 2022Generative Flow Networks for Discrete Probabilistic Modelingcited by 114
- 2022GFlowNets and variational inferencecited by 106
- 2023Improved sampling via learned diffusionscited by 104
- 2022Optimal Transport Tools (OTT): A JAX Toolbox for all things Wassersteincited by 101
- 2023A theory of continuous generative flow networkscited by 101
- 2024Understanding Reinforcement Learning-Based Fine-Tuning of Diffusion Models: A Tutorial and Reviewcited by 98
- 2022Design-Bench: Benchmarks for Data-Driven Offline Model-Based Optimizationcited by 97
- 2023Amortizing intractable inference in large language modelscited by 97
- 2025Feynman-Kac Correctors in Diffusion: Annealing, Guidance, and Product of Expertscited by 96
- 2025Test-time Alignment of Diffusion Models without Reward Over-optimizationcited by 93
- 2024Probabilistic Inference in Language Models via Twisted Sequential Monte Carlocited by 90
- 2015Hierarchical Variational Modelscited by 89
- 2025Adjoint Sampling: Highly Scalable Diffusion Samplers via Adjoint Matchingcited by 85
- 2016Variational inference for Monte Carlo objectivescited by 84
- 2020Solving high-dimensional Hamilton-Jacobi-Bellman PDEs using neural networks: perspectives from the theory of controlled diffusions and measures on path spacecited by 82
- 2023Sequential Monte Carlo Steering of Large Language Models using Probabilistic Programscited by 80
- 2020VarGrad: A Low-Variance Gradient Estimator for Variational Inferencecited by 75
- 2023Towards Understanding and Improving GFlowNet Trainingcited by 75
- 2024Amortizing intractable inference in diffusion models for vision, language, and controlcited by 72
- 2024NETS: A Non-Equilibrium Transport Samplercited by 69
- 2020AdaLead: A simple and robust adaptive greedy search algorithm for sequence designcited by 65
- 2019Elements of Sequential Monte Carlocited by 64
- 2023Generative Flow Networks as Entropy-Regularized RLcited by 64
- 2023Diffusion Generative Flow Samplers: Improving learning signals through partial trajectory optimizationcited by 57
- 2021Bayesian Learning via Neural Schr"odinger-F"ollmer Flowscited by 56
50 most cited of 86 All 86 (JSON)
Built on by
Citing papers per year: 2026: 6.
6 papers.
- 2026Discrete diffusion samplers and bridges: Off-policy algorithms and applications in latent spacescited by 2
- 2026Stop the Sampler! Classifier-Based Adaptive Stopping for Sampling Kernelscited by 0
- 2026Particle GFlowNets: Rethinking Generative Marginalization Modelscited by 0
- 2026FestDPO: Few-step Generator Alignment with Direct Preference Optimizationcited by 0
- 2026One Proposal for Every Margin: Zero-Shot Amortized Sequential Importance Sampling for Binary Matricescited by 0
- 2026Amortised Inference through One-Step Implicit Samplingcited by 0
- 2026Amortised Inference through One-Step Implicit Sampling8 Oct 2026
- 2026One Proposal for Every Margin: Zero-Shot Amortized Sequential Importance Sampling for Binary Matrices28 Sep 2026
- 2026FestDPO: Few-step Generator Alignment with Direct Preference Optimization28 Sep 2026
- 2026Particle GFlowNets: Rethinking Generative Marginalization Models10 Sep 2026
- 2026Stop the Sampler! Classifier-Based Adaptive Stopping for Sampling Kernels15 Jun 2026
- 2026Discrete diffusion samplers and bridges: Off-policy algorithms and applications in latent spaces5 Feb 2026
Similar, not cited
Close in wording, no citation either way
- 2025Scalable Discrete Diffusion Samplers: Combinatorial Optimization and Statistical Physics
- 2023Gibbs Sampling the Posterior of Neural Networks
- 2025Continuously Tempered Diffusion Samplers
- 2026Non-Asymptotic Error Bounds for SMC with Biased Proposals: Application to Conditional Diffusion Sampling
- 2026Learning To Sample From Diffusion Models Via Inverse Reinforcement Learning
- 2026Hierarchical Variational Policies for Reward-Guided Diffusion
- 2025Accelerated Parallel Tempering via Neural Transports
- 2026Self-Rewarding Sequential Monte Carlo for Masked Diffusion Language Models