Variable-Complexity Weighted-Tempered Gibbs Samplers for Bayesian Variable Selection

04/06/2023
by   Lan V. Truong, et al.
0

Subset weighted-Tempered Gibbs Sampler (wTGS) has been recently introduced by Jankowiak to reduce the computation complexity per MCMC iteration in high-dimensional applications where the exact calculation of the posterior inclusion probabilities (PIP) is not essential. However, the Rao-Backwellized estimator associated with this sampler has a high variance as the ratio between the signal dimension and the number of conditional PIP estimations is large. In this paper, we design a new subset weighted-Tempered Gibbs Sampler (wTGS) where the expected number of computations of conditional PIPs per MCMC iteration can be much smaller than the signal dimension. Different from the subset wTGS and wTGS, our sampler has a variable complexity per MCMC iteration. We provide an upper bound on the variance of an associated Rao-Blackwellized estimator for this sampler at a finite number of iterations, T, and show that the variance is O((P/S)^2 log T/T) for a given dataset where S is the expected number of conditional PIP computations per MCMC iteration. Experiments show that our Rao-Blackwellized estimator can have a smaller variance than its counterpart associated with the subset wTGS.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/26/2019

MALA-within-Gibbs samplers for high-dimensional distributions with sparse conditional structure

Markov chain Monte Carlo (MCMC) samplers are numerical methods for drawi...
research
08/02/2017

Complexity Results for MCMC derived from Quantitative Bounds

This paper considers whether MCMC quantitative convergence bounds can be...
research
07/02/2020

Efficient estimation of the ANOVA mean dimension, with an application to neural net classification

The mean dimension of a black box function of d variables is a convenien...
research
06/06/2018

Regenerative Simulation for the Bayesian Lasso

The Gibbs sampler of Park and Casella is one of the most popular MCMC me...
research
12/17/2013

Parallelizing MCMC via Weierstrass Sampler

With the rapidly growing scales of statistical problems, subset based co...
research
11/29/2022

Linear Complexity Gibbs Sampling for Generalized Labeled Multi-Bernoulli Filtering

Generalized Labeled Multi-Bernoulli (GLMB) densities arise in a host of ...
research
06/26/2020

Convergence Rates of Two-Component MCMC Samplers

Component-wise MCMC algorithms, including Gibbs and conditional Metropol...

Please sign up or login with your details

Forgot password? Click here to reset