Bandit history prefix before a round
DefinitionbanditHistoryPrefixbanditsprobabilityucb
For a completed length- history and an index , banditHistoryPrefixAt returns the length- history available immediately before round . It is the input to the policy kernel and UCB indices at that round.
Definition code
import Definitions.Def_BanditPolicy
/-!
The history visible immediately before a round of a fixed finite bandit run.
This is the canonical prefix map used implicitly throughout Lattimore and
Szepesvári, *Bandit Algorithms* (CUP 2020), §4.6 and explicitly in the
time-indexed empirical means in Theorem 8.1, Eq. (8.4), printed p. 119.
-/
namespace BanditAlgorithm
/-- For a completed history `h` and round index `r`, retain precisely the
observations from rounds strictly before `r`. -/
def banditHistoryPrefixAt {k n : ℕ} (h : BanditHistory k n) (r : Fin n) :
BanditHistory k r.val :=
fun s ↦ h ⟨s.val, lt_trans s.isLt r.isLt⟩
end BanditAlgorithm
Source
Lattimore and Szepesvári, Bandit Algorithms (CUP 2020), canonical model §4.6 and Theorem 8.1 Eq. (8.4), printed p. 119 / PDF p. 128.