This paper discusses the convergence of the Gibbs sampling algorithm when it is applied to the problem of outlier detection in regression models. Given any vector of initial conditions, theoretically, the algorithm converges to the true posterior distribution. However, the speed of convergence may slow down in a high dimensional parameter space where the parameters are highly correlated. We show that the effect of the leverage in regression models makes very difficult the convergence of the Gibbs sampling algorithm in sets of data with strong masking. The problem is illustrated in several examples
The aim of this thesis is to study the convergence properties of specific MCMC algorithms for sampli...
this paper we consider two Gibbs sampling algorithms. These have been proposed by Escobar (1994) and...
Inference is a central problem in probabilistic graphical models, and is often the main sub-step in ...
This paper discusses the convergence of the Gibbs sampling algorithm when it is applied to the probl...
This pa¡wr discusses tlJe convergence of the Gibbs sampIing algorithm when it is applied to the prob...
We propose a Bayesian procedure for multiple outlier detection in linear models avoiding the masking...
We propose a Bayesian procedure for multiple outlier detection in linear models avoiding the maskin...
Abstract. We examine the convergence properties of some simple Gibbs sampler examples under various ...
We characterize the convergence of the Gibbs sampler which samples from the joint posterior distribu...
this article we investigate the relationship between the two popular algorithms, the EM algorithm an...
In this paper many convergence issues concerning the implementation of the Gibbs sampler are investi...
In this article we investigate the relationship between the EM algorithm and the Gibbs sampler. We s...
This paper proposed a procedure to identify patches of outliers in an autoregressive process. The pr...
The Gibbs sampler is one of the most popular algorithms for inference in statistical models. In this...
Exploration of the intractable posterior distributions associated with Bayesian versions of the gene...
The aim of this thesis is to study the convergence properties of specific MCMC algorithms for sampli...
this paper we consider two Gibbs sampling algorithms. These have been proposed by Escobar (1994) and...
Inference is a central problem in probabilistic graphical models, and is often the main sub-step in ...
This paper discusses the convergence of the Gibbs sampling algorithm when it is applied to the probl...
This pa¡wr discusses tlJe convergence of the Gibbs sampIing algorithm when it is applied to the prob...
We propose a Bayesian procedure for multiple outlier detection in linear models avoiding the masking...
We propose a Bayesian procedure for multiple outlier detection in linear models avoiding the maskin...
Abstract. We examine the convergence properties of some simple Gibbs sampler examples under various ...
We characterize the convergence of the Gibbs sampler which samples from the joint posterior distribu...
this article we investigate the relationship between the two popular algorithms, the EM algorithm an...
In this paper many convergence issues concerning the implementation of the Gibbs sampler are investi...
In this article we investigate the relationship between the EM algorithm and the Gibbs sampler. We s...
This paper proposed a procedure to identify patches of outliers in an autoregressive process. The pr...
The Gibbs sampler is one of the most popular algorithms for inference in statistical models. In this...
Exploration of the intractable posterior distributions associated with Bayesian versions of the gene...
The aim of this thesis is to study the convergence properties of specific MCMC algorithms for sampli...
this paper we consider two Gibbs sampling algorithms. These have been proposed by Escobar (1994) and...
Inference is a central problem in probabilistic graphical models, and is often the main sub-step in ...