×

Coordinate selection rules for Gibbs sampling. (English) Zbl 0855.60060

Summary: This paper studies several differential plans for selecting coordinates for updating via Gibbs sampling. It exploits the inherent features of the Gibbs sampling formulation, most notably its neighborhood structure, to characterize and compare the plans with regard to convergence to equilibrium and variance of the sample mean. Some of the plans rely completely or almost completely on random coordinate selection. Others use completely or almost completely deterministic coordinate selection rules. We show that neighborhood structure induces idempotency for the individual coordinate transition matrices and commutativity among subsets of these matrices. These properties lead to bounds on eigenvalues for the Gibbs sampling transition matrices corresponding to several of the plans. For a frequently encountered neighborhood structure, we give necessary and sufficient conditions for a commonly employed deterministic coordinate selection plan to induce faster convergence to equilibrium than the random coordinate selection plans. When these conditions hold, we also show that this deterministic selection rule achieves the same worst-case bound on the variance of the sample mean as that arising from the random selection rules when the number of coordinates grows without bound. This last result encourages the belief that faster convergence for the deterministic selection rule may also imply a variance of the sample mean no larger than that arising for random selection rules.

MSC:

60J05 Discrete-time Markov processes on general state spaces
65C05 Monte Carlo methods
PDFBibTeX XMLCite
Full Text: DOI

References:

[1] Amit, Y. (1991). On rates of convergence of stochastic relaxation for Gaussian and non-Gaussian distributions. J. Multivariate Anal. 38 82-89. · Zbl 0735.60036 · doi:10.1016/0047-259X(91)90033-X
[2] Amit, Y. and Grenander, U. (1989). Comparing sweeping strategies for stochastic relaxation. J. Multivariate Anal. 37 197-222. · Zbl 0735.60035 · doi:10.1016/0047-259X(91)90080-L
[3] Barone, P. and Frigessi, A. (1990). Improving stochastic relaxation for Gaussian random fields. Problems in the Informational Sciences 4 369-389. · Zbl 1134.60347 · doi:10.1017/S0269964800001674
[4] Fan, K. (1949). On a theorem of Wey l concerning eigenvalues of linear transformations. I. Proc. Nat. Acad. Sci. U.S.A. 35 652-655. JSTOR: · Zbl 0041.00602 · doi:10.1073/pnas.35.11.652
[5] Fan, K. and Hoffman, A. (1955). Some metric inequalities in the space of matrices. Proc. Amer. Math. Soc. 6 111-116. JSTOR: · Zbl 0064.01402 · doi:10.2307/2032662
[6] Fishman, G. S. (1994). Coordinate selection rules for Gibbs sampling. Report UNC/OR TR-92/15, Operations Research Dept., Univ. North Carolina at Chapel Hill. · Zbl 0855.60060
[7] Frigessi, A., Hwang, C.-R., Sheu, S.-J. and di Stefano, P. (1993). Convergence rates of the Gibbs sampler, Metropolis algorithm and other single-site updating dy namics. J. Roy. Statist. Soc. Ser. B 55 205-219. JSTOR: · Zbl 0781.60039
[8] Gelfand, A. E. and Smith, A. F. M. (1990). Sample-based approaches to calculating marginal densities. J. Amer. Statist. Assoc. 85 398-409. JSTOR: · Zbl 0702.62020 · doi:10.2307/2289776
[9] Horn, R. A. and Johnson, C. A. (1985). Matrix Analy sis. Cambridge Univ. Press.
[10] Johnson, V. (1989). On statistical image reconstruction. Ph.D. dissertation, Dept. Statistics, Univ. Chicago.
[11] Kemeny, J. G. and Snell, J. L. (1960). Finite Markov Chains. Van Nostrand, New York. · Zbl 0089.13704
[12] Liu, J., Wong, W. H. and Kong, A. (1994). Covariance structure of the Gibbs sampler with applications to the comparison of estimators and augmentation schemes. Biometrika 81 27-40. JSTOR: · Zbl 0811.62080 · doi:10.1093/biomet/81.1.27
[13] Liu, J., Wong, W. H. and Kong, A. (1995). Covariance structure and convergence rate of the Gibbs sampler with various scans. J. Roy. Statist. Soc. Ser. B 57 157-169. JSTOR: · Zbl 0811.60056
[14] MacEachern, S. and Berliner, L. M. (1994). Subsampling the Gibbs sampler. Amer. Statist. 48 188-190.
[15] Marcus, M. and Minc, H. (1964). A Survey of Matrix Theory and Matrix Inequalities. Ally n and Bacon, Boston. · Zbl 0126.02404
[16] Marshall, A. W. and Olkin, I. (1979). Inequalities: Theory of Majorization and Its Applications. Academic Press, New York. · Zbl 0437.26007
[17] Roberts, G. O. and Polson, N. G. (1991). A note on the geometric convergence of the Gibbs sampler. Dept. Mathematics, Univ. Nottingham. · Zbl 0796.62029
[18] Roberts, G. O. and Smith, A. F. M. (1992). Simple conditions for the convergence of the Gibbs sampler and Metropolis-Hastings algorithms. Research Report 92-30, Statistical Laboratory, Univ. Cambridge. · Zbl 0803.60067
[19] Schervish, M. J. and Carlin, B. P. (1993). On the convergence of successive substitution sampling. Dept. Statistics, Carnegie Mellon Univ. JSTOR: · doi:10.2307/1390836
This reference list is based on information provided by the publisher or from digital mathematics libraries. Its items are heuristically matched to zbMATH identifiers and may contain data conversion errors. In some cases that data have been complemented/enhanced by data from zbMATH Open. This attempts to reflect the references listed in the original paper as accurately as possible without claiming completeness or a perfect matching.