DeepAI AI Chat
Log In Sign Up

Inference Trees: Adaptive Inference with Exploration

06/25/2018
by   Tom Rainforth, et al.
Northeastern University
University of Oxford
KAIST 수리과학과
The University of British Columbia
2

We introduce inference trees (ITs), a new class of inference methods that build on ideas from Monte Carlo tree search to perform adaptive sampling in a manner that balances exploration with exploitation, ensures consistency, and alleviates pathologies in existing adaptive methods. ITs adaptively sample from hierarchical partitions of the parameter space, while simultaneously learning these partitions in an online manner. This enables ITs to not only identify regions of high posterior mass, but also maintain uncertainty estimates to track regions where significant posterior mass may have been missed. ITs can be based on any inference method that provides a consistent estimate of the marginal likelihood. They are particularly effective when combined with sequential Monte Carlo, where they capture long-range dependencies and yield improvements beyond proposal adaptation alone.

READ FULL TEXT
01/17/2020

Multifidelity Approximate Bayesian Computation with Sequential Monte Carlo Parameter Sampling

Multifidelity approximate Bayesian computation (MF-ABC) is a likelihood-...
05/10/2018

Unbiased and Consistent Nested Sampling via Sequential Monte Carlo

We introduce a new class of sequential Monte Carlo methods called Nested...
06/10/2015

Neural Adaptive Sequential Monte Carlo

Sequential Monte Carlo (SMC), or particle filtering, is a popular class ...
11/06/2017

Adaptive Bayesian Sampling with Monte Carlo EM

We present a novel technique for learning the mass matrices in samplers ...
03/25/2021

Active Tree Search in Large POMDPs

Model-based planning and prospection are widely studied in both cognitiv...
10/31/2018

On Exploration, Exploitation and Learning in Adaptive Importance Sampling

We study adaptive importance sampling (AIS) as an online learning proble...
10/09/2017

New Insights into History Matching via Sequential Monte Carlo

The aim of the history matching method is to locate non-implausible regi...