Table of Contents
Fetching ...

Empirical PAC-Bayes Bounds for Markov Chains

Vahe Karagulyan, Pierre Alquier

TL;DR

The main novelty is that this paper can provide an empirical bound on the pseudo-spectral gap when the state space is finite, the first fully empirical PAC-Bayes bound for Markov chains.

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.

Empirical PAC-Bayes Bounds for Markov Chains

TL;DR

The main novelty is that this paper can provide an empirical bound on the pseudo-spectral gap when the state space is finite, the first fully empirical PAC-Bayes bound for Markov chains.

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.

Paper Structure

This paper contains 26 sections, 14 theorems, 138 equations, 11 figures.

Key Result

Theorem 2.1

Assume $\{U_t\}_{t =1}^n$ is a stationary Markov chain with pseudo-spectral gap $\gamma_{ps}>0$. Then for any constants $0<\lambda<\frac{n}{10}$, $\delta\in(0,1)$, and prior $\mu\in\mathcal{P}(\Theta)$,

Figures (11)

  • Figure 1: Estimation of $\gamma_{ps}(R_t)$ when $d=20$. In red, the actual values of $\gamma_{ps}(R_t)$, as a function of our interpolation parameter $t$, see \ref{['interpol']}. In green, the value of the estimator $\widehat{\gamma}_{ps}$.
  • Figure 2: Value of the PAC-Bayes bounds evaluated on a single trajectory, for $d=20$. In red, the non-empirical PAC-Bayes bound, as a function of $t$. In green, the empirical PAC-Bayes bound. In blue, the true value of the risk.
  • Figure 3: Mean Square Error of $k=100$ estimations of $\widehat{\gamma}_{ps}$.
  • Figure 4: Estimation of $\gamma_{\text{ps}}$ when $d=4$.
  • Figure 5: Estimation of $\gamma_{\text{ps}}$ when $d=10$.
  • ...and 6 more figures

Theorems & Definitions (33)

  • Definition 1.1
  • Definition 1.2
  • Theorem 2.1
  • Corollary 3.1
  • Proposition 3.1
  • Proposition 3.2
  • Proposition 3.3
  • Corollary 3.2
  • Definition 3.1
  • Theorem 3.1
  • ...and 23 more