G. Garcia-Donato, M. E. Castellanos Nueda

In this talk we introduce an exact algorithm that allows the exact implementation of the Gibbs algorithm for variable selection when the number of covariates is large or very large. We illustrate its performance in real datasets. We also introduce a new artificial experiment based on real data and sensible arguments. It has also the property that inclusion probabilities can be exactly calculated making it possible to evaluate the performance of numerical algorithms.

Keywords: Bayes factors, Large p, Multiplicity, Parallel computing


GT11.BAYES1 Variable Selection
November 7, 2023  4:50 PM
CC1: Audience

Other papers in the same session

Cookie policy

We use cookies in order to be able to identify and authenticate you on the website. They are necessary for the correct functioning of it, and therefore they can not be disabled. If you continue browsing the website, you are agreeing with their acceptance, as well as our Privacy Policy.

Additionally, we use Google Analytics in order to analyze the website traffic. They also use cookies and you can accept or refuse them with the buttons below.

You can read more details about our Cookie Policy and our Privacy Policy.