Entropy rate estimation for Markov chains with large state space

Entropy estimation is one of the prototypical problems in distribution property testing. To consistently estimate the Shannon entropy of a distribution on S elements with independent samples, the optimal sample complexity scales sublinearly with S as Θ(_log^S_S ) as shown by Valiant and Valiant [4]. Extending the theory and algorithms for entropy estimation to dependent data, this paper considers the problem of estimating the entropy rate of a stationary reversible Markov chain with S states from a sample path of n observations. We show that • Provided the Markov chain mixes not too slowly, i.e., the relaxation time is at most O(_ln^S_{3 S} ), consistent estimation is achievable when n_{log S} . S² • Provided the Markov chain has some slight dependency, i.e., the relaxation time is at least 1 + Ω(^ln2_S^S ), consistent estimation is impossible when n . S² log_S . Under both assumptions, the optimal estimation accuracy is shown to be Θ(_nlog^S2_S ). In comparison, the empirical entropy rate requires at least Ω(S²) samples to be consistent, even when the Markov chain is memoryless. In addition to synthetic experiments, we also apply the estimators that achieve the optimal sample complexity to estimate the entropy rate of the English language in the Penn Treebank and the Google One Billion Words corpora, which provides a natural benchmark for language modeling and relates it directly to the widely used perplexity measure.