Optimistic Bellman solution over compact confidence sets
ProvedBanditAlgorithm.mdp_compact_confidence_optimistic_bellman_solutionFix states and actions, a reward function , and for each state-action pair a nonempty compact set of probability vectors on the state space. Suppose some genuine finite MDP with reward function and finite diameter has all of its transition rows in the confidence sets, . Then the average-reward Bellman optimality equation of the extended MDP has a solution: there are a gain , a value function , an action map and optimistic rows with
and is optimistic: .
This is the guarantee that extended value iteration in UCRL2 converges to a solution of the optimality equation of the extended MDP, together with the two properties the regret analysis consumes: optimism, and the bound on the span of the optimistic value function by the diameter of the true MDP. The extended MDP is not a finite MDP, since its action set — the pairs with in a confidence set — is a continuum; the hypotheses replace finiteness of the action set by compactness of the confidence sets.
The proof is the vanishing-discount argument. For let solve the discounted extended Bellman equation and put . Splitting as shows that solves the average-reward Bellman inequality for every member of the confidence region — in particular for the genuine MDP , whence uniformly in . So the recentred functions range in the compact cube , the gains range in and the optimistic rows range in the compact confidence sets, while the maximising actions range over a finite set. Along a subsequence the action map is therefore a fixed and everything else converges; the inequality persists in the limit, and the defect in the greedy equality — which equals and so lies between and — vanishes. Optimism is then the verification half of Theorem 38.2 applied to , whose rows lie in the confidence sets.
Finiteness of the diameter of the true MDP is exactly what makes the limit exist: without a uniform span bound the recentred discounted value functions need not be bounded.
import Definitions.Def_FiniteMDPLearning import Mathlib.Probability.Kernel.Composition.IntegralCompProd import Mathlib.Analysis.SpecificLimits.Basic open MeasureTheory ProbabilityTheory
theorem BanditAlgorithm.mdp_compact_confidence_optimistic_bellman_solution
{S A : ℕ} (hS : 0 < S) (hA : 0 < A)
(r : Fin S → Fin A → ℝ) (hr : ∀ s a, r s a ∈ Set.Icc (0 : ℝ) 1)
(C : Fin S → Fin A → Set (Fin S → ℝ)) (hCne : ∀ s a, (C s a).Nonempty)
(hCcomp : ∀ s a, IsCompact (C s a))
(hCprob : ∀ s a, ∀ p ∈ C s a, (∀ s', 0 ≤ p s') ∧ ∑ s', p s' = 1)
(M : FiniteMDP S A) (hMr : M.r = r) (hMD : mdpDiameterENN M ≠ ⊤)
(hMC : ∀ s a, (fun s' ↦ ((M.P s a s' : ℝ))) ∈ C s a) :
∃ (ρ : ℝ) (v : Fin S → ℝ) (f : Fin S → Fin A) (q : Fin S → Fin S → ℝ),
0 ≤ ρ ∧ ρ ≤ 1 ∧
(∀ s s', v s - v s' ≤ ρ * mdpDiameter M) ∧
(∀ s a, ∀ p ∈ C s a, r s a + ∑ s', p s' * v s' ≤ ρ + v s) ∧
(∀ s, q s ∈ C s (f s)) ∧
(∀ s, ρ + v s = r s (f s) + ∑ s', q s s' * v s') ∧
mdpOptimalGain M ≤ ρ := by
sorry