The reviewed record of science sign in
Pith

arxiv: 2208.01893 · v3 · pith:LMGR56AW · submitted 2022-08-03 · cs.LG · q-bio.QM· stat.ML

Flow Annealed Importance Sampling Bootstrap

Reviewed by Pith T0 review T1 audit T2 compute T3 formal T4 kernel pith:LMGR56AWrecord.jsonopen to challenge →

classification cs.LG q-bio.QMstat.ML
keywords samplestargetflowflowsimportancemethodsalphaannealed
0
0 comments X
read the original abstract

Normalizing flows are tractable density models that can approximate complicated target distributions, e.g. Boltzmann distributions of physical systems. However, current methods for training flows either suffer from mode-seeking behavior, use samples from the target generated beforehand by expensive MCMC methods, or use stochastic losses that have high variance. To avoid these problems, we augment flows with annealed importance sampling (AIS) and minimize the mass-covering $\alpha$-divergence with $\alpha=2$, which minimizes importance weight variance. Our method, Flow AIS Bootstrap (FAB), uses AIS to generate samples in regions where the flow is a poor approximation of the target, facilitating the discovery of new modes. We apply FAB to multimodal targets and show that we can approximate them very accurately where previous methods fail. To the best of our knowledge, we are the first to learn the Boltzmann distribution of the alanine dipeptide molecule using only the unnormalized target density, without access to samples generated via Molecular Dynamics (MD) simulations: FAB produces better results than training via maximum likelihood on MD samples while using 100 times fewer target evaluations. After reweighting the samples, we obtain unbiased histograms of dihedral angles that are almost identical to the ground truth.

This paper has not been read by Pith yet.

discussion (0)

Sign in with ORCID, Apple, or X to comment. Anyone can read and Pith papers without signing in.

Forward citations

Cited by 6 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score.

  1. Multi-Armed Sampling Problem and the End of Exploration

    cs.LG 2025-07 conditional novelty 8.0

    Multi-armed sampling framework shows near-optimal regret is achievable with minimal exploration, unlike bandits, and unifies both via a continuous temperature family.

  2. Accelerating Chemical Potential Calculations with Minimal Normalizing Flows

    cond-mat.stat-mech 2026-06 unverdicted novelty 7.0

    Minimal normalizing flows with low-dimensional physically informed transformations accelerate chemical potential calculations by factors of 3-10x in Lennard-Jones and aqueous ion systems while training in one minute on GPU.

  3. Scalable Inference-Time Annealing with Surrogate Likelihood Estimators

    cs.LG 2026-05 unverdicted novelty 6.0

    SITA performs scalable inference-time annealing of flow-based models on molecular systems by substituting energy-based surrogate likelihoods for divergence-based importance weights.

  4. Reliable model selection in the presence of parameter non-identifiability

    stat.ME 2026-05 unverdicted novelty 6.0

    Proposes adaptive multiple importance sampling for robust Bayesian model evidence estimation under parameter non-identifiability, shown to outperform deterministic methods on ecological case studies while being cheape...

  5. Jeffreys Flow: Robust Boltzmann Generators for Rare Event Sampling via Parallel Tempering Distillation

    cs.LG 2026-04 unverdicted novelty 6.0

    Jeffreys Flow distills Parallel Tempering trajectories via Jeffreys divergence to produce robust Boltzmann generators that suppress mode collapse and correct sampling inaccuracies for rare event sampling.

  6. Energy-Weighted Flow Matching: Unlocking Continuous Normalizing Flows for Efficient and Scalable Boltzmann Sampling

    stat.ML 2025-09 unverdicted novelty 6.0

    Energy-Weighted Flow Matching reformulates conditional flow matching with importance sampling to enable continuous normalizing flows to model Boltzmann distributions from energy evaluations alone, with iterative and a...