Lemma 7, p. 19 — the conservative policy loses at most ξ/(1−γ) in its own MDP: V̂^π − V̂^{π̂c} ≤ ξ/(1−γ)
ProvedBreakingSample.Conservative.lemma_7conservative-planningmarkov-decision-processp2o-batch-pfp2ap2o-gran-per-chapterp2o-plan-paperp2o-v1value-function
Let be a finite discounted MDP (kernel , rewards in , ) with a linearly ordered action set, and let , be its optimal Q- and value functions. Let and let follow the conservative rule . Then for every deterministic policy and every state ,
In the paper , the optimal policy of the true MDP, and is the empirical kernel; the bound controls the middle term of the decomposition (51) of .
Formalization Note The statement holds for any kernel and for any policy in place of , which is stronger than the page (the paper's proof ends with , valid for every ). Only is assumed; the rule cannot hold for , so of the page is implied.
Preamble
import Mathlib import Definitions.Def_BreakingSample_Perturbed_Model import Definitions.Def_BreakingSample_Conservative_Rule
Formal statement
namespace BreakingSample.Conservative
theorem lemma_7 {S A : Type} [Fintype S] [DecidableEq S] [Fintype A] [LinearOrder A] [Nonempty A]
(P : S → A → S → ℝ) (r : S → A → ℝ) (γ : ℝ) (hM : BreakingSample.Perturbed.IsDiscountedMDP P r γ)
(ξ ς : ℝ) (hς : ς ≤ ξ) (πc : S → A)
(hc : IsConservative (BreakingSample.Perturbed.optQ P r γ) (BreakingSample.Perturbed.optValue P r γ) ς πc) (π : S → A) :
∀ s, BreakingSample.Perturbed.value P r γ π s - BreakingSample.Perturbed.value P r γ πc s ≤ ξ / (1 - γ) := by sorry
end BreakingSample.Conservative
Source
arXiv:2005.12900v8, Lemma 7, p. 19, (52); proof in App. B.6, p. 33
Human review
Confirmed by the mission captain (proposal self-audit).
Confirmed by the moderator at approval.