๐ค AI Summary
This work addresses the high computational cost and poor scalability of multivariate Monte Carlo error estimation in Markov chain Monte Carlo (MCMC), particularly in high-dimensional settings. We propose an efficient multivariate initial sequence estimator grounded in a unified framework tailored for parallel MCMC chains. Our method integrates vector autoregressive (VAR) preprocessing, spectral density truncation, and covariance sparsity modeling, and leverages fast inversion of block-Toeplitz matrices to drastically reduce computational complexityโwhile preserving asymptotic optimality and finite-sample superiority. Empirical evaluation demonstrates that the proposed estimator achieves 10โ50ร speedup over existing approaches and yields tighter error control than state-of-the-art multivariate methods such as multivariate batch means. It is successfully applied to high-dimensional Bayesian inference tasks, confirming its practical efficacy and scalability.
๐ Abstract
Estimating Monte Carlo error is critical to valid simulation results in Markov chain Monte Carlo (MCMC) and initial sequence estimators were one of the first methods introduced for this. Over the last few years, focus has been on multivariate assessment of simulation error, and many multivariate generalizations of univariate methods have been developed. The multivariate initial sequence estimator is known to exhibit superior finite-sample performance compared to its competitors. However, the multivariate initial sequence estimator can be prohibitively slow, limiting its widespread use. We provide an efficient alternative to the multivariate initial sequence estimator that inherits both its asymptotic properties as well as the finite-sample superior performance. The effectiveness of the proposed estimator is shown via some MCMC example implementations. Further, we also present univariate and multivariate initial sequence estimators for when parallel MCMC chains are run and demonstrate their effectiveness over a popular alternative.