Amortized Sampling with Transferable Normalizing Flows
Charlie B. Tan, Majdi Hassan, Leon Klein, Saifuddin Syed, Dominique Beaini, Michael M. Bronstein, Alexander Tong, Kirill Neklyudov
Abstract
Efficient equilibrium sampling of molecular conformations remains a core challenge in computational chemistry and statistical inference. Classical approaches such as molecular dynamics or Markov chain Monte Carlo inherently lack amortization; the computational cost of sampling must be paid in full for each system of interest. The widespread success of generative models has inspired interest towards overcoming this limitation through learning sampling algorithms. Despite performing competitively with conventional methods when trained on a single system, learned samplers have so far demonstrated limited ability to transfer across systems. We demonstrate that deep learning enables the design of scalable and transferable samplers by introducing Prose, a 285 million parameter all-atom transferable normalizing flow trained on a corpus of peptide molecular dynamics trajectories up to 8 residues in length. Prose draws zero-shot uncorrelated proposal samples for arbitrary peptide systems, achieving the previously intractable transferability across sequence length, whilst retaining the efficient likelihood evaluation of normalizing flows. Through extensive empirical evaluation we demonstrate the efficacy of Prose as a proposal for a variety of sampling algorithms, finding a simple importance sampling-based fine-tuning procedure to achieve competitive performance to established methods such as sequential Monte Carlo. We open-source the Prose codebase, model weights, and training dataset, to further stimulate research into amortized sampling methods and objectives.
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.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 5fe028af-3d4e-4e8e-b5de-bb6e700b4f91Cited by top-tier papers8
- Progressive Inference-Time Annealing of Diffusion Models for Sampling from Boltzmann DensitiesTara Akhound-Sadegh, Jungyoon Lee, Joey Bose, Valentin De Bortoli et al.NeurIPS 2025 · 28 citations
- FALCON: Few-step Accurate Likelihoods for Continuous FlowsDanyal Rehman, Tara Akhound-Sadegh, Artem Gazizov, Yoshua Bengio et al.ICLR 2026 · 13 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
- Efficient Regression-based Training of Normalizing Flows for Boltzmann GeneratorsDanyal Rehman, Oscar Davis, Jiarui Lu, Jian Tang et al.ICLR 2026 · 7 citations
Related papers
- Timewarp: Transferable Acceleration of Molecular Dynamics by Learning Time-Coarsened DynamicsLeon Klein, Andrew Y. K. Foong, Tor Erlend Fjelde, Bruno Mlodozeniec et al.NeurIPS 2023 · 110 citations
- Scalable Equilibrium Sampling with Sequential Boltzmann GeneratorsCharlie B. Tan, Joey Bose, Chen Lin, Leon Klein et al.ICML 2025
- Stochastic Normalizing FlowsHao Wu, Jonas Köhler, Frank NoéNeurIPS 2020 · 230 citations
- Autoregressive Boltzmann GeneratorsDanyal Rehman, Charlie Tan, Yoshua Bengio, Joey Bose et al.ICML 2026 · 1 citation
- Transferable Boltzmann GeneratorsLeon Klein, Frank NoéNeurIPS 2024 · 64 citations
