6 citations · 7 across the 8 of their papers we have counts for
6 papers · 1 filter
AutoStep: Locally adaptive involutive MCMC
Tiange Liu, Nikola Surjanovic, Miguel Biron-Lattes +2
Many common Markov chain Monte Carlo (MCMC) kernels can be formulated using a deterministic involutive proposal with a step size parameter. Selecting an appropriate step size is of…
Is Gibbs sampling faster than Hamiltonian Monte Carlo on GLMs?
Son Luu, Zuheng Xu, Nikola Surjanovic +3
The Hamiltonian Monte Carlo (HMC) algorithm is often lauded for its ability to effectively sample from high-dimensional distributions. In this paper we challenge the presumed domin…
autoMALA: Locally adaptive Metropolis-adjusted Langevin algorithm
Miguel Biron-Lattes, Nikola Surjanovic, Saifuddin Syed +2
Selecting the step size for the Metropolis-adjusted Langevin algorithm (MALA) is necessary in order to obtain satisfactory performance. However, finding an adequate step size for a…
Automatic Regenerative Simulation via Non-Reversible Simulated Tempering
Miguel Biron-Lattes, Trevor Campbell, Alexandre Bouchard-Côté
Simulated Tempering (ST) is an MCMC algorithm for complex target distributions that operates on a path between the target and a more amenable reference distribution. Crucially, if…
Pigeons.jl: Distributed Sampling From Intractable Distributions
Nikola Surjanovic, Miguel Biron-Lattes, Paul Tiede +3
We introduce a software package, Pigeons.jl, that provides a way to leverage distributed computation to obtain samples from complicated probability distributions, such as multimoda…
Pseudo-marginal Inference for CTMCs on Infinite Spaces via Monotonic Likelihood Approximations
Miguel Biron-Lattes, Alexandre Bouchard-Côté, Trevor Campbell
Bayesian inference for Continuous-Time Markov Chains (CTMCs) on countably infinite spaces is notoriously difficult because evaluating the likelihood exactly is intractable. One way…