arXiv subjects

S. A. Sisson

Publications and source records attributed to S. A. Sisson.

23 records · Page 2Linked to original sources

arXiv2010

Adaptive Optimal Scaling of Metropolis-Hastings Algorithms Using the Robbins-Monro Process

We present an adaptive method for the automatic scaling of Random-Walk Metropolis-Hastings algorithms, which quickly and robustly identifies the scaling factor that yields a specified overall sampler acceptance probability. Our method relies on the use of the Robbins-Monro search process, whose performance is determined by an unknown steplength constant. We give a very simple estimator of this constant for proposal distributions that are univariate or multivariate normal, together with a sampling algorithm for automating the method. The effectiveness of the algorithm is demonstrated with both simulated and real data examples. This approach could be implemented as a useful component in more complex adaptive Markov chain Monte Carlo algorithms, or as part of automated software packages.

stat.ME↗

arXiv2010

A note on target distribution ambiguity of likelihood-free samplers

Methods for Bayesian simulation in the presence of computationally intractable likelihood functions are of growing interest. Termed likelihood-free samplers, standard simulation algorithms such as Markov chain Monte Carlo have been adapted for this setting. In this article, by presenting generalisations of existing algorithms, we demonstrate that likelihood-free samplers can be ambiguous over the form of the target distribution. We also consider the theoretical justification of these samplers. Distinguishing between the forms of the target distribution may have implications for the future development of likelihood-free samplers.

stat.CO↗

arXiv2009

Likelihood-free Bayesian inference for alpha-stable models

$α$-stable distributions are utilised as models for heavy-tailed noise in many areas of statistics, finance and signal processing engineering. However, in general, neither univariate nor multivariate $α$-stable models admit closed form densities which can be evaluated pointwise. This complicates the inferential procedure. As a result, $α$-stable models are practically limited to the univariate setting under the Bayesian paradigm, and to bivariate models under the classical framework. In this article we develop a novel Bayesian approach to modelling univariate and multivariate $α$-stable distributions based on recent advances in "likelihood-free" inference. We present an evaluation of the performance of this procedure in 1, 2 and 3 dimensions, and provide an analysis of real daily currency exchange rate data. The proposed approach provides a feasible inferential methodology at a moderate computational cost.

stat.CO↗

arXiv2009

On sequential Monte Carlo, partial rejection control and approximate Bayesian computation

We present a sequential Monte Carlo sampler variant of the partial rejection control algorithm, and show that this variant can be considered as a sequential Monte Carlo sampler with a modified mutation kernel. We prove that the new sampler can reduce the variance of the incremental importance weights when compared with standard sequential Monte Carlo samplers. We provide a study of theoretical properties of the new algorithm, and make connections with some existing algorithms. Finally, the sampler is adapted for application under the challenging "likelihood free," approximate Bayesian computation modelling framework, where we demonstrate superior performance over existing likelihood-free samplers.

stat.CO↗

arXiv2009

On Bayesian Curve Fitting Via Auxiliary Variables

In this article we revisit the auxiliary variable method introduced in Smith and kohn (1996) for the fitting of P-th order spline regression models with an unknown number of knot points. We introduce modifications which allow the location of knot points to be random, and we further consider an extension of the method to handle models with non-Gaussian errors. We provide a new algorithm for the MCMC sampling of such models. Simulated data examples are used to compare the performance of our method with existing ones. Finally, we make a connection with some change-point problems, and show how they can be re-parameterised to the variable selection setting.

stat.ME↗