Measurability of the KL-UCB constraint supremum
ProvedBanditAlgorithm.measurable_klucbIndexSupFix a horizon and a pull count , and write
for the KL-UCB exploration threshold of Algorithm 8, with when under Lean's convention . For a real parameter let
where is the real-valued Bernoulli relative entropy of Definition 10.1, and the two implications encode the book's conventions for and for , which the real-valued cannot express directly.
The assertion is that the map
is Borel measurable on , where the supremum is the Lean , so that and the value at parameters for which is empty or unbounded is the corresponding junk value.
This is the analytic core of the measurability of the KL-UCB index. The index of arm after a history is exactly evaluated at with , so once this parametrised supremum is known to be measurable, measurability of the index follows from measurability of the empirical mean and the pull count together with the fact that , which makes the dependence on a finite measurable partition.
Note that is not assumed to lie in : the empirical mean of an arbitrary real-valued reward sequence need not be a probability, so the statement is made for every real and must accommodate the junk values of outside the unit interval. Note also that can degenerate to a single point, which happens for instance when and , where ; consequently the supremum is not in general approximable from inside by rationals, and an argument by rational exhaustion of the constraint set does not suffice.
import Definitions.Def_bernoulliRelativeEntropy open MeasureTheory ProbabilityTheory
theorem BanditAlgorithm.measurable_klucbIndexSup (n m : ℕ) :
Measurable (fun p : ℝ => sSup {μ' ∈ Set.Icc (0 : ℝ) 1 |
BanditAlgorithm.bernoulliRelativeEntropy p μ' ≤
Real.log (BanditAlgorithm.klucbExploration (n + 1)) / m ∧
(μ' = 0 → p = 0) ∧ (μ' = 1 → p = 1)}) := by
sorry