Mixing Time Estimation in Ergodic Markov Chains from a Single Trajectory with Contraction Methods

12/14/2019
by   Geoffrey Wolfer, et al.
0

The mixing time t_mix of an ergodic Markov chain measures the rate of convergence towards its stationary distribution π. We consider the problem of estimating t_mix from one single trajectory of m observations (X_1, . . . , X_m), 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 t_rel of a reversible Markov chain as a proxy for t_mix. 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 t_mix up to multiplicative small universal constants instead of t_rel. 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.

READ FULL TEXT

page 1

page 2

page 3

page 4

research
08/24/2017

Mixing time estimation in reversible Markov chains from a single sample path

The spectral gap γ of a finite, ergodic, and reversible Markov chain is ...
research
02/01/2019

Estimating the Mixing Time of Ergodic Markov Chains

We address the problem of estimating the mixing time t_mix of an arbitra...
research
02/16/2023

A Geometric Reduction Approach for Identity Testing of Reversible Markov Chains

We consider the problem of testing the identity of a reversible Markov c...
research
06/26/2021

Optimal prediction of Markov chains with and without spectral gap

We study the following learning problem with dependent data: Observing a...
research
09/12/2018

On Markov Chain Gradient Descent

Stochastic gradient methods are the workhorse (algorithms) of large-scal...
research
08/18/2019

Quantitative convergence rates for reversible Markov chains via strong random times

Let (X_t) be a discrete time Markov chain on a general state space. It i...
research
10/28/2018

On Learning Markov Chains

The problem of estimating an unknown discrete distribution from its samp...

Please sign up or login with your details

Forgot password? Click here to reset