70 citations · 108 across the 11 of their papers we have counts for
12 papers
Steering Diffusion Models to Rare Events with Sequential Monte Carlo
Aavash Subedi, Tim Reichelt, Christopher Williams +3
Diffusion models are increasingly used as surrogates for expensive simulators in weather prediction, molecular dynamics, and materials design. In these models, computing the probab…
Accelerated Parallel Tempering via Neural Transports
Leo Zhang, Peter Potaptchik, Jiajun He +5
Markov Chain Monte Carlo (MCMC) algorithms are essential tools in computational statistics for sampling from unnormalised probability distributions, but can be fragile when targeti…
Score-Optimal Diffusion Schedules
Christopher Williams, Andrew Campbell, Arnaud Doucet +1
Denoising diffusion models (DDMs) offer a flexible framework for sampling from high dimensional data distributions. DDMs generate a path of probability distributions interpolating…
Optimised Annealed Sequential Monte Carlo Samplers
Saifuddin Syed, Alexandre Bouchard-Côté, Kevin Chern +1
Annealed Sequential Monte Carlo (ASMC) samplers are special cases of SMC samplers where the sequence of distributions can be embedded in a smooth path of distributions. Using this…
Uniform Ergodicity of Parallel Tempering With Efficient Local Exploration
Nikola Surjanovic, Saifuddin Syed, Alexandre Bouchard-Côté +1
Non-reversible parallel tempering (NRPT) is an effective algorithm for sampling from target distributions with complex geometry, such as those arising from posterior distributions…
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…
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…
A Unified Framework for U-Net Design and Analysis
Christopher Williams, Fabian Falck, George Deligiannidis +3
U-Nets are a go-to, state-of-the-art neural architecture across numerous tasks for continuous signals on a square such as images and Partial Differential Equations (PDE), however t…
Parallel Tempering With a Variational Reference
Nikola Surjanovic, Saifuddin Syed, Alexandre Bouchard-Côté +1
Sampling from complex target distributions is a challenging task fundamental to Bayesian inference. Parallel tempering (PT) addresses this problem by constructing a Markov chain on…
Parallel Tempering on Optimized Paths
Saifuddin Syed, Vittorio Romaniello, Trevor Campbell +1
Parallel tempering (PT) is a class of Markov chain Monte Carlo algorithms that constructs a path of distributions annealing between a tractable reference and an intractable target,…
Local Exchangeability
Trevor Campbell, Saifuddin Syed, Chiao-Yu Yang +2
Exchangeability -- in which the distribution of an infinite sequence is invariant to reorderings of its elements -- implies the existence of a simple conditional independence struc…
Non-Reversible Parallel Tempering: a Scalable Highly Parallel MCMC Scheme
Saifuddin Syed, Alexandre Bouchard-Côté, George Deligiannidis +1
Parallel tempering (PT) methods are a popular class of Markov chain Monte Carlo schemes used to sample complex high-dimensional probability distributions. They rely on a collection…