Abstract
The mixing time tmix of an ergodic Markov chain measures the rate of convergence towards its stationary distribution π. We consider the problem of estimating tmix from one single trajectory of m observations (X1, . . ., Xm), in the case where the transition kernel M is unknown, a research program started by Hsu et al. (2015). The community has so far focused primarily on leveraging spectral methods to estimate the relaxation time trel of a reversible Markov chain as a proxy for tmix. Although these techniques have recently been extended to tackle non-reversible chains, this general setting remains much less understood. Our new approach based on contraction methods is the first that aims at directly estimating tmix up to multiplicative small universal constants instead of trel. It does so by introducing a generalized version of Dobrushin’s contraction coefficient κgen, which is shown to control the mixing time regardless of reversibility. We subsequently design fully data-dependent high confidence intervals around κgen that generally yield better convergence guarantees and are more practical than state-of-the-art.
| Original language | English |
|---|---|
| Pages (from-to) | 890-905 |
| Number of pages | 16 |
| Journal | Proceedings of Machine Learning Research |
| Volume | 117 |
| State | Published - 1 Jan 2020 |
| Event | 31st International Conference on Algorithmic Learning Theory, ALT 2020 - San Diego, United States Duration: 8 Feb 2020 → 11 Feb 2020 |
Keywords
- Dobrushin contraction coefficient
- Ergodic Markov chain
- mixing time
ASJC Scopus subject areas
- Artificial Intelligence
- Software
- Control and Systems Engineering
- Statistics and Probability