The UCRL2 confidence sets fail with probability at most
ProvedBanditAlgorithm.mdp_ucrl2_confidence_event_complement_prob_leFor every finite MDP with states and actions, every horizon , every confidence level , every policy and every initial state distribution,
that is, the complement of mdpConfidenceGoodEvent has probability at most .
This is the statistical content of the analysis of UCRL2 (Lattimore--Szepesvari, Section 38.6, Step 1; Lemma 38.8), and it is a statement about the estimates alone -- it holds uniformly over policies, because the confidence balls are built from the trajectory and no property of the action-selection rule enters.
The argument is a union bound over the state-action pairs, over the possible values of the number of observations, and over the events of the categorical concentration inequality: conditionally on having been played times, the empirical row of a pair is the empirical distribution of independent draws from the true row, so it deviates by in with probability at most ; at equal to the confidence radius this is , and the slack in absorbs the union.
Formalization Note The subtlety the statement hides, and the reason it is not a direct application of the fixed-sample-size inequality, is that the number of observations of a pair is itself random -- a stopping time -- so the concentration must be applied along the peeling over rather than to a fixed sample.
import Definitions.Def_UCRL2ConfidenceSets open MeasureTheory ProbabilityTheory ENNReal
theorem BanditAlgorithm.mdp_ucrl2_confidence_event_complement_prob_le
(S A n : ℕ) (hS : 2 ≤ S) (hA : 0 < A) (hn : 0 < n)
(δ : ℝ) (hδ : δ ∈ Set.Ioo (0 : ℝ) 1)
(M : FiniteMDP S A) (π : MDPPolicy S A) (μ0 : MDPStateDistribution S) :
mdpMeasure M μ0 π n (mdpConfidenceGoodEvent M n δ)ᶜ ≤ ENNReal.ofReal (δ / 2) := by
sorry