We introduce a suite of new particle-based algorithms for sampling on
co...
We introduce two new particle-based algorithms for learning latent varia...
In recent years, particle-based variational inference (ParVI) methods su...
Stochastic gradient MCMC (SGMCMC) offers a scalable alternative to
tradi...
We introduce a new framework for efficient sampling from complex probabi...
Divide-and-conquer strategies for Monte Carlo algorithms are an increasi...
Network data arises through observation of relational information betwee...
Measuring the distance between data points is fundamental to many statis...
We develop a new efficient methodology for Bayesian global sensitivity
a...
In this article we focus on dynamic network data which describe interact...
We derive a Matern Gaussian process (GP) on the vertices of a hypergraph...
Stochastic gradient Markov chain Monte Carlo (SGMCMC) is a popular class...
Spike-and-slab and horseshoe regression are arguably the most popular
Ba...
In March 2020 the United Kingdom (UK) entered a nationwide lockdown peri...
We show how to use Stein variational gradient descent (SVGD) to carry ou...
The increasing prevalence of relational data describing interactions amo...
Markov chain Monte Carlo (MCMC) algorithms are generally regarded as the...
State space models (SSMs) provide a flexible framework for modeling comp...
Gaussian processes are a class of flexible nonparametric Bayesian tools ...
Stochastic gradient Markov chain Monte Carlo (SGMCMC) has become a popul...
This paper introduces the R package sgmcmc; which can be used for Bayesi...
Sampling from the posterior distribution using Markov chain Monte Carlo
...
It is well known that Markov chain Monte Carlo (MCMC) methods scale poor...
Markov chain Monte Carlo (MCMC) algorithms have become powerful tools fo...
This paper proposes a new sampling scheme based on Langevin dynamics tha...
Poyiadjis et al. (2011) show how particle methods can be used to estimat...