Variable selection by perfect sampling (Q1348861)
From MaRDI portal
scientific article
Language | Label | Description | Also known as |
---|---|---|---|
English | Variable selection by perfect sampling |
scientific article |
Statements
Variable selection by perfect sampling (English)
0 references
11 February 2003
0 references
Summary: Variable selection is very important in many fields, and for its resolution many procedures have been proposed and investigated. Among them are Bayesian methods that use Markov chain Monte Carlo (MCMC) sampling algorithms. A problem with MCMC sampling, however, is that it cannot guarantee that the samples are exactly from the target distributions. This drawback is overcome by related methods known as perfect sampling algorithms. In this paper, we propose the use of two perfect sampling algorithms to perform variable selection within the Bayesian framework. They are the sandwiched coupling from the past (CFTP) algorithm and the Gibbs coupler. We focus our attention to scenarios where the model coefficients and noise variance are known. We indicate the condition under which the sandwiched CFTP can be applied. Most importantly, we design a detailed scheme to adapt the Gibbs coupler algorithm to variable selection. In addition, we discuss the possibilities of applying perfect sampling when the model coefficients and noise variance are unknown. Test results that show the performance of the algorithms are provided.
0 references
Markov chain Monte Carlo sampling
0 references
Gibbs sampler
0 references
coupling from the past algorithm
0 references
perfect sampling algorithms
0 references
variable selection
0 references
Gibbs coupler
0 references