NAUTILUS: boosting Bayesian importance nested sampling with deep learning

Johannes U. Lange
6/29/2023
astro-ph.IMastro-ph.COastro-ph.EP

Official code: johannesulf/nautilus (109 stars, MIT, last commit 2026-03-30).

Abstract

We introduce a novel approach to boost the efficiency of the importance nested sampling (INS) technique for Bayesian posterior and evidence estimation using deep learning. Unlike rejection-based sampling methods such as vanilla nested sampling (NS) or Markov chain Monte Carlo (MCMC) algorithms, importance sampling techniques can use all likelihood evaluations for posterior and evidence estimation. However, for efficient importance sampling, one needs proposal distributions that closely mimic the posterior distributions. We show how to combine INS with deep learning via neural network regression to accomplish this task. We also introduce NAUTILUS, a reference open-source Python implementation of this technique for Bayesian posterior and evidence estimation. We compare NAUTILUS against popular NS and MCMC packages, including EMCEE, DYNESTY, ULTRANEST and POCOMC, on a variety of challenging synthetic problems and real-world applications in exoplanet detection, galaxy SED fitting and cosmology. In all applications, the sampling efficiency of NAUTILUS is substantially higher than that of all other samplers, often by more than an order of magnitude. Simultaneously, NAUTILUS delivers highly accurate results and needs fewer likelihood evaluations than all other samplers tested. We also show that NAUTILUS has good scaling with the dimensionality of the likelihood and is easily parallelizable to many CPUs.

View on arXivView PDF

Code Implementations(1)

MIT

Neural Network-Boosted Importance Nested Sampling for Bayesian Statistics

10916PythonAug 23, 20216 months agoMIT
bayesian-statisticsinferencemachine-learningpythonsampling

Similar Papers

Cite this paper

@article{lange2023nautilus,
  title  = {NAUTILUS: boosting Bayesian importance nested sampling with deep learning},
  author = {Johannes U. Lange},
  year   = {2023},
  eprint = {2306.16923},
  archivePrefix = {arXiv},
  url    = {http://arxiv.org/abs/2306.16923v1}
}

Add a badge to your README

Shows whether official code is linked for this paper.

Code of Paper badge
[![Code of Paper](https://codeofpaper.com/badge/2306.16923.svg)](https://codeofpaper.com/paper/2306.16923)

Discussion