Sequential monte carlo: A unified review
Sequential Monte Carlo methods—also known as particle filters—offer approximate
solutions to filtering problems for nonlinear state-space systems. These filtering problems …
solutions to filtering problems for nonlinear state-space systems. These filtering problems …
An invitation to sequential Monte Carlo samplers
ABSTRACT Statisticians often use Monte Carlo methods to approximate probability
distributions, primarily with Markov chain Monte Carlo and importance sampling. Sequential …
distributions, primarily with Markov chain Monte Carlo and importance sampling. Sequential …
Approximate leave-future-out cross-validation for Bayesian time series models
One of the common goals of time series analysis is to use the observed series to inform
predictions for future observations. In the absence of any actual new data to predict, cross …
predictions for future observations. In the absence of any actual new data to predict, cross …
Probabilistic programs as an action description language
Actions description languages (ADLs), such as STRIPS, PDDL, and RDDL specify the input
format for planning algorithms. Unfortunately, their syntax is familiar to planning experts only …
format for planning algorithms. Unfortunately, their syntax is familiar to planning experts only …
Optimizing insect metabarcoding using replicated mock communities
Metabarcoding (high‐throughput sequencing of marker gene amplicons) has emerged as a
promising and cost‐effective method for characterizing insect community samples. Yet, the …
promising and cost‐effective method for characterizing insect community samples. Yet, the …
Smcp3: Sequential monte carlo with probabilistic program proposals
This paper introduces SMCP3, a method for automatically implementing custom sequential
Monte Carlo samplers for inference in probabilistic programs. Unlike particle filters and …
Monte Carlo samplers for inference in probabilistic programs. Unlike particle filters and …
Universal probabilistic programming offers a powerful approach to statistical phylogenetics
Statistical phylogenetic analysis currently relies on complex, dedicated software packages,
making it difficult for evolutionary biologists to explore new models and inference strategies …
making it difficult for evolutionary biologists to explore new models and inference strategies …
Structural foundations for probabilistic programming languages
DM Stein - 2021 - ora.ox.ac.uk
Probability theory and statistics are fundamental disciplines in a data-driven world. Synthetic
probability theory is a general, axiomatic formalism to describe their underlying structures …
probability theory is a general, axiomatic formalism to describe their underlying structures …
Affine monads and lazy structures for Bayesian programming
We show that streams and lazy data structures are a natural idiom for programming with
infinite-dimensional Bayesian methods such as Poisson processes, Gaussian processes …
infinite-dimensional Bayesian methods such as Poisson processes, Gaussian processes …
Past, Present and Future of Software for Bayesian Inference
Software tools for Bayesian inference have undergone rapid evolution in the past three
decades, following popularisation of the first generation MCMC-sampler implementations …
decades, following popularisation of the first generation MCMC-sampler implementations …