English

Empirical PAC-Bayes Bounds for Markov Chains

Machine Learning 2026-03-12 v3 Machine Learning

Abstract

The core of generalization theory was developed for independent observations. Some PAC and PAC-Bayes bounds are available for data that exhibit a temporal dependence. However, there are constants in these bounds that depend on properties of the data-generating process: mixing coefficients, mixing time, spectral gap... Such constants are unknown in practice. In this paper, we prove a new PAC-Bayes bound for Markov chains. This bound depends on a quantity called the pseudo-spectral gap. The main novelty is that we can provide an empirical bound on the pseudo-spectral gap when the state space is finite. Thus, we obtain the first fully empirical PAC-Bayes bound for Markov chains. This extends beyond the finite case, although this requires additional assumptions. On simulated experiments, the empirical version of the bound is essentially as tight as the non-empirical one.

Cite

@article{arxiv.2509.20985,
  title  = {Empirical PAC-Bayes Bounds for Markov Chains},
  author = {Vahe Karagulyan and Pierre Alquier},
  journal= {arXiv preprint arXiv:2509.20985},
  year   = {2026}
}

Comments

To appear in the proceedings of AISTATS 2026

R2 v1 2026-07-01T05:55:49.056Z