1 citations · 1 across the 13 of their papers we have counts for
13 papers
Optimal Slice-Adaptive Tuning of Hybrid Slice Sampling
Trevor Campbell
Slice sampling is a Markov chain Monte Carlo algorithm that draws its next state uniformly from a "slice"---a super-level set of the target density function---at each iteration, th…
Large-scale empirical tuning and comparison of default optimizers for variational inference
Trevor Campbell, Jonathan H. Huggins, Kyurae Kim +1
Black-box variational inference (BBVI) is a methodology for posterior approximation that relies on stochastic optimization. In practice, the stochastic optimizers underpinning BBVI…
Hessian-informed, Coordinate Friendly Hamiltonian Monte Carlo in Linear Time
Son Luu, Nikola Surjanovic, Zuheng Xu +2
Riemannian Hamiltonian Monte Carlo (RHMC) is a promising MCMC methodology thanks to its ability to accommodate position-dependent preconditioning and multi-step proposals. While RH…
Stochastic Gradient Variational Inference with Price's Gradient Estimator from Bures-Wasserstein to Parameter Space
Kyurae Kim, Qiang Fu, Yi-An Ma +2
For approximating a target distribution given only its unnormalized log-density, stochastic gradient-based variational inference (VI) algorithms are a popular approach. For example…
AutoGD: Automatic Learning Rate Selection for Gradient Descent
Nikola Surjanovic, Alexandre Bouchard-Côté, Trevor Campbell
The performance of gradient-based optimization methods, such as standard gradient descent (GD), greatly depends on the choice of learning rate. However, it can require a non-trivia…
AutoSGD: Automatic Learning Rate Selection for Stochastic Gradient Descent
Nikola Surjanovic, Alexandre Bouchard-Côté, Trevor Campbell
The learning rate is an important tuning parameter for stochastic gradient descent (SGD) and can greatly influence its performance. However, appropriate selection of a learning rat…
On the Orbit of the Binary Brown Dwarf Companion GL229 Ba and Bb
William Thompson, Dori Blakely, Jerry W. Xuan +21
The companion GL229B was recently resolved by Xuan et al. (2024) as a tight binary of two brown dwarfs (Ba and Bb) through VLTI-GRAVITY interferometry and VLT-CRIRES+ RV measuremen…
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…
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…
MCMC-driven learning
Alexandre Bouchard-Côté, Trevor Campbell, Geoff Pleiss +1
This paper is intended to appear as a chapter for the Handbook of Markov Chain Monte Carlo. The goal of this chapter is to unify various problems at the intersection of Markov chai…
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…