Conditional-Flow Nested Sampling for Neural Energy Landscapes
Implementation & benchmark of arXiv:2609.03193 — Generative Nested Sampling of Atomistic Thermodynamic Landscapes
Source paper: Generative Nested Sampling of Atomistic Thermodynamic Landscapes arXiv:2609.03193 ⓘ · analyzed Sep 4, 2026
AI-generated research hypothesis, automatically tested. Not peer-reviewed.
Idea description
Use a conditional normalizing flow to replace inner-loop MCMC when sampling states or parameters under progressively tighter neural energy or likelihood constraints. The flow is trained online from recent live sets, and proposals are corrected by importance weighting and resampling, so flow bias does not directly corrupt the nested estimate.
Formulas
Mathematical statement
Let $x\in\mathbb{R}^d$ be a neural-network state, latent code, parameter vector, or generated sample, and let $\ell_\phi(x)$ be a score such as negative energy or log likelihood. At nested level $i$, the constrained prior is $\pi_i(x)=p_0(x)\mathbf{1}[\ell_\phi(x)>\lambda_i]/X_i$, where $p_0$ is the base prior, $\lambda_i$ is the current threshold, and $X_i$ is the remaining prior volume. A conditional invertible flow $q_\theta(x\mid\lambda_i)$ proposes candidates. Their unnormalized importance weights are $w_j=p_0(x_j)\mathbf{1}[\ell_\phi(x_j)>\lambda_i]/q_\theta(x_j\mid\lambda_i)$. Weighted resampling approximates the constrained target even when the flow is imperfect. With $N$ live points, ideal nested-volume shrinkage satisfies $X_i=t_iX_{i-1}$ with $t_i\sim\mathrm{Beta}(N,1)$ and expected log shrinkage $-1/N$. The flow is trained by maximum likelihood on a sliding window of recent live sets.
Implementation notes
1. Integration point: wrap an existing neural energy model, diffusion latent model, VAE decoder, or Bayesian neural network inside a nested sampler. Define $\ell_\phi(x)$ as negative energy, log likelihood, or negative validation loss. Initialize $N=256$ to $1024$ live points from $p_0$ and use a conditional RealNVP, masked autoregressive flow, or neural spline flow with the threshold $\lambda$ supplied through FiLM or concatenated conditioning layers. 2. Pseudocode: sample live points $x_k\sim p_0$; identify the worst point and set $\lambda_i=\min_k\ell_\phi(x_k)$; draw $M$ candidates from $q_\theta(\cdot\mid\lambda_i)$; reject candidates below the threshold; compute exact prior and flow log densities; calculate importance weights; resample one replacement proportionally to those weights; append the live set to FIFO window $\mathcal{W}_i$; update the flow by the displayed likelihood loss; repeat. 3. Exact quantities are flow Jacobian densities, neural scores, constraints, and importance weights. Estimate only ESS, acceptance rate, and computational cost empirically. 4. First experiment: compare this method with slice or Metropolis nested sampling on a 16-dimensional eight-well neural energy landscape at equal score evaluations. The prediction is at least a $5\times$ reduction in score evaluations per accepted replacement after warm-up, with evidence error within two independent nested-sampling standard deviations. The measured volume trajectory should satisfy $\mathbb{E}[\log X_i]\approx-i/N$ within 20%; larger deviation indicates proposal failure.
Verification
This idea has not been verified yet.
Verification happens in two stages: Stage 1 — a mechanism check on a toy system confirms the claimed mathematical phenomenon reproduces; Stage 2 — a benchmark implements the idea on a real (small) neural network task and compares it against a tuned baseline over 8 paired seeds with a permutation test.
Artifacts
Artifacts unavailable.