Extension of the PAC framework to finite and countable Markov Chains

We consider a model of learning in which the successive observations follow a certain Markov chain. The observations are labeled according to a membership to some unknown target set. For a Markov chain with finitely many states we show that, if the target set belongs to a family of sets with a finite Vapnik-Chervonenkis (VC) dimension, then probably approximately correct learning of this set is possible with polynomially large samples. Specifically for observations following a random walk with a state space χ and uniform stationary distribution, the sample size required is no more than Ω(t0/1-λ2 log(t0 |χ| 1/δ)), where δ is the confidence level, λ2 is the second largest eigenvalue of the transition matrix, and t0 is the sample size sufficient for learning from independent and identically distributed (i.i.d.) observations. We then obtain similar results for Markov chains with countably many states using Lyapunov function technique and recent results on mixing properties of infinite state Markov chains.