6,296 research outputs found
Quasi-Newton Methods for Markov Chain Monte Carlo
The performance of Markov chain Monte Carlo methods is often sensitive to the scaling and correlations between the random variables of interest. An important source of information about the local correlation and scale is given by the Hessian matrix of the target distribution, but this is often either computationally expensive or infeasible. In this paper we propose MCMC samplers that make use of quasi-Newton approximations, which approximate the Hessian of the target distribution from previous samples and gradients generated by the sampler. A key issue is that MCMC samplers that depend on the history of previous states are in general not valid. We address this problem by using limited memory quasi-Newton methods, which depend only on a fixed window of previous samples. On several real world datasets, we show that the quasi-Newton sampler is more effective than standard Hamiltonian Monte Carlo at a fraction of the cost of MCMC methods that require higher-order derivatives.
Quasi-Newton particle Metropolis-Hastings
Particle Metropolis-Hastings enables Bayesian parameter inference in general
nonlinear state space models (SSMs). However, in many implementations a random
walk proposal is used and this can result in poor mixing if not tuned correctly
using tedious pilot runs. Therefore, we consider a new proposal inspired by
quasi-Newton algorithms that may achieve similar (or better) mixing with less
tuning. An advantage compared to other Hessian based proposals, is that it only
requires estimates of the gradient of the log-posterior. A possible application
is parameter inference in the challenging class of SSMs with intractable
likelihoods. We exemplify this application and the benefits of the new proposal
by modelling log-returns of future contracts on coffee by a stochastic
volatility model with -stable observations.Comment: 23 pages, 5 figures. Accepted for the 17th IFAC Symposium on System
Identification (SYSID), Beijing, China, October 201
Getting Started with Particle Metropolis-Hastings for Inference in Nonlinear Dynamical Models
This tutorial provides a gentle introduction to the particle
Metropolis-Hastings (PMH) algorithm for parameter inference in nonlinear
state-space models together with a software implementation in the statistical
programming language R. We employ a step-by-step approach to develop an
implementation of the PMH algorithm (and the particle filter within) together
with the reader. This final implementation is also available as the package
pmhtutorial in the CRAN repository. Throughout the tutorial, we provide some
intuition as to how the algorithm operates and discuss some solutions to
problems that might occur in practice. To illustrate the use of PMH, we
consider parameter inference in a linear Gaussian state-space model with
synthetic data and a nonlinear stochastic volatility model with real-world
data.Comment: 41 pages, 7 figures. In press for Journal of Statistical Software.
Source code for R, Python and MATLAB available at:
https://github.com/compops/pmh-tutoria
Bayesian Estimation of Mixed Multinomial Logit Models: Advances and Simulation-Based Evaluations
Variational Bayes (VB) methods have emerged as a fast and
computationally-efficient alternative to Markov chain Monte Carlo (MCMC)
methods for scalable Bayesian estimation of mixed multinomial logit (MMNL)
models. It has been established that VB is substantially faster than MCMC at
practically no compromises in predictive accuracy. In this paper, we address
two critical gaps concerning the usage and understanding of VB for MMNL. First,
extant VB methods are limited to utility specifications involving only
individual-specific taste parameters. Second, the finite-sample properties of
VB estimators and the relative performance of VB, MCMC and maximum simulated
likelihood estimation (MSLE) are not known. To address the former, this study
extends several VB methods for MMNL to admit utility specifications including
both fixed and random utility parameters. To address the latter, we conduct an
extensive simulation-based evaluation to benchmark the extended VB methods
against MCMC and MSLE in terms of estimation times, parameter recovery and
predictive accuracy. The results suggest that all VB variants with the
exception of the ones relying on an alternative variational lower bound
constructed with the help of the modified Jensen's inequality perform as well
as MCMC and MSLE at prediction and parameter recovery. In particular, VB with
nonconjugate variational message passing and the delta-method (VB-NCVMP-Delta)
is up to 16 times faster than MCMC and MSLE. Thus, VB-NCVMP-Delta can be an
attractive alternative to MCMC and MSLE for fast, scalable and accurate
estimation of MMNL models
- …