We exhibit examples of high-dimensional unimodal posterior distributions arising in non-linear regression models with Gaussian process priors for which worst-case (`cold start') initialised MCMC methods typically take an exponential run-time to enter the regions where the bulk of the posterior measure concentrates. The counter-examples hold for general MCMC schemes based on gradient or random walk steps, and the theory is illustrated for Metropolis-Hastings adjusted methods such as pCN and MALA
Abstract. The computational complexity of MCMC methods for the exploration of complex probability me...
We consider Bayesian analysis of data from multivariate linear regression models whose errors have a...
We consider the convergence properties of recently proposed adaptive Markov chain Monte Carlo (MCMC)...
This study investigates the effects of Markov chain Monte Carlo (MCMC) sampling in unsupervised Maxi...
Markov chain Monte Carlo (MCMC) algorithms are commonly used to fit complex hierarchical models to d...
Gaussian processes are valuable tools for non-parametric modelling, where typically an assumption of...
We introduce new Gaussian proposals to improve the efficiency of the standard Hastings-Metropolis al...
The grouped independence Metropolis–Hastings (GIMH) and Markov chain within Metropolis (MCWM) algori...
We study Markov chain Monte Carlo (MCMC) algorithms for target distributions defined on matrix space...
We present a competitive analysis of some non-parametric Bayesian algorithms in a worst-case online ...
International audienceBecause of their multimodality, mixture posterior distributions are difficult ...
Gaussian Process (GP) models are a powerful and flexible tool for non-parametric regression and clas...
Many Bayesian inference problems require exploring the posterior distribution of high-dimensional pa...
Many problems arising in applications result in the need to probe a probability distribution for fun...
We present a competitive analysis of some non-parametric Bayesian algorithms in a worst-case online ...
Abstract. The computational complexity of MCMC methods for the exploration of complex probability me...
We consider Bayesian analysis of data from multivariate linear regression models whose errors have a...
We consider the convergence properties of recently proposed adaptive Markov chain Monte Carlo (MCMC)...
This study investigates the effects of Markov chain Monte Carlo (MCMC) sampling in unsupervised Maxi...
Markov chain Monte Carlo (MCMC) algorithms are commonly used to fit complex hierarchical models to d...
Gaussian processes are valuable tools for non-parametric modelling, where typically an assumption of...
We introduce new Gaussian proposals to improve the efficiency of the standard Hastings-Metropolis al...
The grouped independence Metropolis–Hastings (GIMH) and Markov chain within Metropolis (MCWM) algori...
We study Markov chain Monte Carlo (MCMC) algorithms for target distributions defined on matrix space...
We present a competitive analysis of some non-parametric Bayesian algorithms in a worst-case online ...
International audienceBecause of their multimodality, mixture posterior distributions are difficult ...
Gaussian Process (GP) models are a powerful and flexible tool for non-parametric regression and clas...
Many Bayesian inference problems require exploring the posterior distribution of high-dimensional pa...
Many problems arising in applications result in the need to probe a probability distribution for fun...
We present a competitive analysis of some non-parametric Bayesian algorithms in a worst-case online ...
Abstract. The computational complexity of MCMC methods for the exploration of complex probability me...
We consider Bayesian analysis of data from multivariate linear regression models whose errors have a...
We consider the convergence properties of recently proposed adaptive Markov chain Monte Carlo (MCMC)...