Affiliation:
1. Center for AI Project RIKEN Tokyo Japan
Abstract
AbstractWe address the problem of estimating the mixing time of a Markov chain from a single trajectory of observations. Unlike most previous works which employed Hilbert space methods to estimate spectral gaps, we opt for an approach based on contraction with respect to total variation. Specifically, we estimate the contraction coefficient introduced in Wolfer (2020), inspired from Dobrushin's. This quantity, unlike the spectral gap, controls the mixing time up to strong universal constants and remains applicable to nonreversible chains. We improve existing fully data‐dependent confidence intervals around this contraction coefficient, which are both easier to compute and thinner than spectral counterparts. Furthermore, we introduce a novel analysis beyond the worst‐case scenario by leveraging additional information about the transition matrix. This allows us to derive instance‐dependent rates for estimating the matrix with respect to the induced uniform norm, and some of its mixing properties.
Subject
Statistics, Probability and Uncertainty,Statistics and Probability
Reference26 articles.
1. Non-reversible Metropolis-Hastings
2. Statistical Methods in Markov Chains
3. Markov Chains
4. Learning discrete distributions with infinite support;Cohen D.;Advances in Neural Information Processing Systems,2020