Real-Time Likelihood-free Inference of Roman Binary Microlensing Events with Amortized Neural Posterior Estimation

by   Keming Zhang, et al.

Fast and automated inference of binary-lens, single-source (2L1S) microlensing events with sampling-based Bayesian algorithms (e.g., Markov Chain Monte Carlo; MCMC) is challenged on two fronts: high computational cost of likelihood evaluations with microlensing simulation codes, and a pathological parameter space where the negative-log-likelihood surface can contain a multitude of local minima that are narrow and deep. Analysis of 2L1S events usually involves grid searches over some parameters to locate approximate solutions as a prerequisite to posterior sampling, an expensive process that often requires human-in-the-loop and domain expertise. As the next-generation, space-based microlensing survey with the Roman Space Telescope is expected to yield thousands of binary microlensing events, a new fast and automated method is desirable. Here, we present a likelihood-free inference (LFI) approach named amortized neural posterior estimation, where a neural density estimator (NDE) learns a surrogate posterior p̂(θ|x) as an observation-parametrized conditional probability distribution, from pre-computed simulations over the full prior space. Trained on 291,012 simulated Roman-like 2L1S simulations, the NDE produces accurate and precise posteriors within seconds for any observation within the prior support without requiring a domain expert in the loop, thus allowing for real-time and automated inference. We show that the NDE also captures expected posterior degeneracies. The NDE posterior could then be refined into the exact posterior with a downstream MCMC sampler with minimal burn-in steps.


page 4

page 5

page 7

page 8

page 9

page 11

page 12


Automating Inference of Binary Microlensing Events with Neural Density Estimation

Automated inference of binary microlensing events with traditional sampl...

Sequential Neural Posterior and Likelihood Approximation

We introduce the sequential neural posterior and likelihood approximatio...

Sequential Likelihood-Free Inference with Implicit Surrogate Proposal

Bayesian inference without the access of likelihood, called likelihood-f...

Efficient MCMC for Gibbs Random Fields using pre-computation

Bayesian inference of Gibbs random fields (GRFs) is often referred to as...

Deep Learning-enabled MCMC for Probabilistic State Estimation in District Heating Grids

Flexible district heating grids form an important part of future, low-ca...

Bayesian Parameter Inference for Partially Observed SDEs driven by Fractional Brownian Motion

In this paper we consider Bayesian parameter inference for partially obs...

VaiPhy: a Variational Inference Based Algorithm for Phylogeny

Phylogenetics is a classical methodology in computational biology that t...

Please sign up or login with your details

Forgot password? Click here to reset