Reconstructing the Universe with Variational self-Boosted Sampling

06/28/2022
by   Chirag Modi, et al.
16

Forward modeling approaches in cosmology have made it possible to reconstruct the initial conditions at the beginning of the Universe from the observed survey data. However the high dimensionality of the parameter space still poses a challenge to explore the full posterior, with traditional algorithms such as Hamiltonian Monte Carlo (HMC) being computationally inefficient due to generating correlated samples and the performance of variational inference being highly dependent on the choice of divergence (loss) function. Here we develop a hybrid scheme, called variational self-boosted sampling (VBS) to mitigate the drawbacks of both these algorithms by learning a variational approximation for the proposal distribution of Monte Carlo sampling and combine it with HMC. The variational distribution is parameterized as a normalizing flow and learnt with samples generated on the fly, while proposals drawn from it reduce auto-correlation length in MCMC chains. Our normalizing flow uses Fourier space convolutions and element-wise operations to scale to high dimensions. We show that after a short initial warm-up and training phase, VBS generates better quality of samples than simple VI approaches and reduces the correlation length in the sampling phase by a factor of 10-50 over using only HMC to explore the posterior of initial conditions in 64^3 and 128^3 dimensional problems, with larger gains for high signal-to-noise data observations.

READ FULL TEXT
research
09/26/2016

Variational Inference with Hamiltonian Monte Carlo

Variational inference lies at the core of many state-of-the-art algorith...
research
06/01/2019

Variational Langevin Hamiltonian Monte Carlo for Distant Multi-modal Sampling

The Hamiltonian Monte Carlo (HMC) sampling algorithm exploits Hamiltonia...
research
10/13/2019

Deep Markov Chain Monte Carlo

We propose a new computationally efficient sampling scheme for Bayesian ...
research
03/09/2019

NeuTra-lizing Bad Geometry in Hamiltonian Monte Carlo Using Neural Transport

Hamiltonian Monte Carlo is a powerful algorithm for sampling from diffic...
research
08/02/2017

Hamiltonian Monte Carlo with Energy Conserving Subsampling

Hamiltonian Monte Carlo (HMC) has recently received considerable attenti...
research
06/09/2015

Variational consensus Monte Carlo

Practitioners of Bayesian statistics have long depended on Markov chain ...
research
12/10/2021

Frozen Gaussian Sampling: A Mesh-free Monte Carlo Method For Approximating Semiclassical Schrödinger Equations

In this paper, we develop a Monte Carlo algorithm named the Frozen Gauss...

Please sign up or login with your details

Forgot password? Click here to reset