.png){kind=icon}
Return
An efficient sampling algorithm with adaptations for Bayesian variable selection
.png){kind=icon}
PRE
AI
DOI：10.1016/j.neunet.2014.09.010.png)
.png){kind=icon}
.png){kind=icon}
Share.png){kind=icon}
Save
Abstract
En 中文
In Bayesian variable selection, indicator model selection (IMS) is a class of well-known sampling algorithms, which has been used in various models. The IMS is a class of methods that uses pseudo-priors and it contains specific methods such as Gibbs variable selection (GVS) and Kuo and Mallick's (KM) method. However, the efficiency of the IMS strongly depends on the parameters of a proposal distribution and the pseudo-priors. Specifically, the GVS determines their parameters based on a pilot run for a full model and the KM method sets their parameters as those of priors, which often leads to slow mixings of them. In this paper, we propose an algorithm that adapts the parameters of the IMS during running. The parameters obtained on the fly provide an appropriate proposal distribution and pseudo-priors, which improve the mixing of the algorithm. We also prove the convergence theorem of the proposed algorithm, and confirm that the algorithm is more efficient than the conventional algorithms by experiments of the Bayesian variable selection. (C) 2014 Elsevier Ltd. All rights reserved.
Keywords:
Indicator model selection
Gibbs variable selection
Kuo and Mal lick's method
Adaptive Markoy chain Monte Carlo
Convergence
Bayesian logistic regression model
Journal
IF:
6.3
Papers:
8.3K
Citations:
3.7W
Organization
Cited Papers
ShareSaveCatalytic etherification of hydroxyl compounds to methyl ethers with 1,2-dimethoxyethane.png)
RSC Advances
RSC AdvancesIF0
PREAI
ShareSaveShareSaveShareSaveAdaptive Markov chain Monte Carlo for auxiliary variable method and its application to parallel temperingNEURAL NETWORKS
OAAI
NEURAL NETWORKSIF6.3
OAAIShareSave
ShareSaveShareSave
View more