Journal of Applied Probability
previous :: next

Fixed precision MCMC estimation by median of products of averages

Wojciech Niemiro and Piotr Pokarowski

Source: J. Appl. Probab. Volume 46, Number 2 (2009), 309-329.

Abstract

The standard Markov chain Monte Carlo method of estimating an expected value is to generate a Markov chain which converges to the target distribution and then compute correlated sample averages. In many applications the quantity of interest 𝜽 is represented as a product of expected values, θ = µ1µk, and a natural estimator is a product of averages. To increase the confidence level, we can compute a median of independent runs. The goal of this paper is to analyze such an estimator θ̂, i.e. an estimator which is a `median of products of averages' (MPA). Sufficient conditions are given for θ̂ to have fixed relative precision at a given level of confidence, that is, to satisfy P(|θ̂ - θ| ≤ θ ∈) ≥ 1 - β. Our main tool is a new bound on the mean-square error, valid also for nonreversible Markov chains on a finite state space.

Primary Subjects: 60J10, 65C05
Secondary Subjects: 68W20, 82B80
Keywords: Markov chain Monte Carlo; rare-event simulation; mean-square error; bias; confidence estimation

Full-text: Access denied (no subscription detected)

We're sorry, but we are unable to provide you with the full text of this article because we are not able to identify you as a subscriber.
If you have a personal subscription to this journal, then please login. If you are already logged in, then you may need to update your profile to register your subscription. Read more about accessing full-text
Links and Identifiers

Permanent link to this document: http://projecteuclid.org/euclid.jap/1245676089
Digital Object Identifier: doi:10.1239/jap/1245676089
Zentralblatt MATH identifier: 05578808

References

Aldous. D. (1987). On the Markov chain simulation method for uniform combinatorial distributions and simulated annealing. Prob. Eng. Inf. Sci. 1, 33--46.
Asmussen, S. (2000). Ruin Probabilities (Adv. Ser. Statist. Sci. Appl. Prob. 2). World Scientific, River Edge, NJ.
Mathematical Reviews (MathSciNet): MR1794582
Asmussen, S. and Binswanger, K. (1997). Simulation of ruin probabilities for subexponential claims. ASTIN Bull. 27, 297--318.
Asmussen, S. and Glynn, P. W. (2007). Stochastic Simulation: Algorithms and Analysis (Stoch. Modelling Appl. Prob. 57). Springer, New York.
Mathematical Reviews (MathSciNet): MR2331321
Zentralblatt MATH: 1126.65001
Asmussen, S. and Kroese, D. P. (2006). Improved algorithms for rare event simulation with heavy tails. Adv. Appl. Prob. 38, 545--558.
Mathematical Reviews (MathSciNet): MR2264957
Digital Object Identifier: doi:10.1239/aap/1151337084
Project Euclid: euclid.aap/1151337084
Zentralblatt MATH: 1097.65017
Bernstein, S. N. (1924). On a modification of Chebyshev's inequality and of the error formula of Laplace. Ann. Sci. Inst. Savantes Ukraine, Sect. Math. 1, 38--49.
Bremaud, P. (1999). Markov Chains. Springer, New York.
Mathematical Reviews (MathSciNet): MR1689633
Diaconis, P. and Strook, D. (1991). Geometric bounds for eigenvalues of Markov chains. Ann. Appl. Prob. 1, 36--61.
Mathematical Reviews (MathSciNet): MR1097463
Digital Object Identifier: doi:10.1214/aoap/1177005980
Project Euclid: euclid.aoap/1177005980
Zentralblatt MATH: 0731.60061
Diaconis, P., Holmes, S. and Neal, R. M. (2000). Analysis of a nonreversible Markov chain sampler. Ann. Appl. Prob. 10, 726--752.
Mathematical Reviews (MathSciNet): MR1789978
Digital Object Identifier: doi:10.1214/aoap/1019487508
Project Euclid: euclid.aoap/1019487508
Zentralblatt MATH: 1083.60516
Dinwoodie, I. H. (1995). A probability inequality for the occupation measure of a reversible Markov chain. Ann. Appl. Prob. 5, 37--43.
Mathematical Reviews (MathSciNet): MR1325039
Digital Object Identifier: doi:10.1214/aoap/1177004826
Project Euclid: euclid.aoap/1177004826
Zentralblatt MATH: 0829.60022
Dyer, M. and Frieze, A. (1991). Computing the volume of convex bodies: a case where randomness provably helps. In Probabilistic Combinatorics and its Applications (Proc. AMS Symp. Appl. Math. 44), American Mathematical Society, Providence, RI, pp. 123--169.
Mathematical Reviews (MathSciNet): MR1141926
Zentralblatt MATH: 0754.68052
Dyer, M., Goldberg, L. A. and Jerrum, M. (2006). Systematic scan for sampling colorings. Ann. Appl. Prob. 16, 185--230.
Mathematical Reviews (MathSciNet): MR2209340
Digital Object Identifier: doi:10.1214/105051605000000683
Project Euclid: euclid.aoap/1141654285
Zentralblatt MATH: 1095.60024
Ferrenberg, A. M. and Swendsen, R. H. (1989). Optimized Monte Carlo data analysis. Phys. Rev. Lett. 63, 1195--1198.
Fill, J. A. (1991). Eigenvalue bounds on convergence to stationarity for nonreversible Markov chains, with an application to the exclusion process. Ann. Appl. Prob. 1, 62--87.
Mathematical Reviews (MathSciNet): MR1097464
Digital Object Identifier: doi:10.1214/aoap/1177005981
Project Euclid: euclid.aoap/1177005981
Zentralblatt MATH: 0726.60069
Gillman, D. (1998). A Chernoff bound for random walks on expander graphs. SIAM J. Comput. 27, 1203--1220.
Mathematical Reviews (MathSciNet): MR1621958
Digital Object Identifier: doi:10.1137/S0097539794268765
Zentralblatt MATH: 0911.60016
Hartinger, J. and Kortschak, D. (2006). On the efficiency of Asmussen--Kroese-estimator and its applications to stop-loss transforms. In 6th Internat. Workshop on Rare Event Simulation (Bamberg, October 2006), pp. 162--171.
Hoeffding, W. (1963). Probability inequalities for sums of bounded random variables. J. Amer. Statist. Assoc. 58, 13--30.
Mathematical Reviews (MathSciNet): MR144363
Digital Object Identifier: doi:10.2307/2282952
Zentralblatt MATH: 0127.10602
Horn, R. and Johnson, C. R. (1985). Matrix Analysis. Cambridge University Press.
Mathematical Reviews (MathSciNet): MR832183
Jerrum, M. (2003). Counting, Sampling and Integrating: Algorithms and Complexity, Birkhäuser, Basel.
Mathematical Reviews (MathSciNet): MR1960003
Zentralblatt MATH: 1011.05001
Jerrum, M. and Sinclair, A. (1993). Polynomial-time approximation algorithms for the Ising model. SIAM. J. Comput. 22, 1087--1116.
Mathematical Reviews (MathSciNet): MR1237164
Digital Object Identifier: doi:10.1137/0222066
Zentralblatt MATH: 0782.05076
Jerrum, M. and Sinclair, A. (1996). The Markov chain Monte Carlo method: an approach to approximate counting and integration, In Approximation Algorithms for NP-hard Problems, ed. D. Hochbaum, PWS, Boston, pp. 482--520.
Mathematical Reviews (MathSciNet): MR1419096
Jerrum, M., Sinclair, A. and Vigoda, E. (2004). A polynomial-time approximation algorithm for the permanent of a matrix with nonnegative entries. J. Assoc. Comput. Mach. 51, 671--697.
Mathematical Reviews (MathSciNet): MR2147852
Digital Object Identifier: doi:10.1145/1008731.1008738
Jerrum, M. R., Valiant, L. G. and Vazirani, V. V. (1986). Random generation of combinatorial structures from a uniform distribution. Theoret. Comput. Sci. 43, 169--188.
Mathematical Reviews (MathSciNet): MR855970
Digital Object Identifier: doi:10.1016/0304-3975(86)90174-X
Zentralblatt MATH: 0597.68056
Lezaud, P. (1998). Chernoff-type bound for finite Markov chains. Ann. Appl. Prob. 8, 849--867.
Mathematical Reviews (MathSciNet): MR1627795
Digital Object Identifier: doi:10.1214/aoap/1028903453
Project Euclid: euclid.aoap/1028903453
Zentralblatt MATH: 0938.60027
Niemiro, W. (2008). Nonasymptotic bounds on the estimation error for regenerative MCMC algorithm under a drift condition. Submitted.
Newman, M. E. J. and Barkema, G. T. (1999). Monte Carlo Methods in Statistical Physics. Clarendon Press, New York.
Mathematical Reviews (MathSciNet): MR1691513
Zentralblatt MATH: 1012.82019
Pokarowski, P., Droste, K. and Kolinski, A. (2005). A minimal protein-like lattice model: an alpha-helix motif. J. Chem. Phys. 122, 214915.
Pokarowski, P., Kolinski, A. and Skolnick, J. (2003). A minimal physically realistic protein-like lattice model: designing an energy landscape that ensures all-or-none folding to a unique native state. Biophysical J. 84, 1518--1526.
Sandman, W. (ed.) (2006). Proceedings of the 6th International Workshop on Rare Event Simulation (Bamberg, October 2006), University of Bamberg, Germany.
Sinclair, A. J. and Jerrum, M. R. (1989). Approximate counting, uniform generation and rapidly mixing Markov chains. Inf. Comput. 82, 93--133.
Mathematical Reviews (MathSciNet): MR1003059
Digital Object Identifier: doi:10.1016/0890-5401(89)90067-9
Zentralblatt MATH: 0668.05060
Sokal, A. D. (1989). Monte Carlo methods in statistical mechanics: foundations and new algorithm. Lecture Notes: Cours de Troisieme Cycle de la Physique en Suisse Romande (Lausanne, June 1989). Unpublished manuscript.
previous :: next

2009 © Applied Probability Trust