s1 s2 s3 s4 s5 - of Marcus Hutter

Sample ComplexityAn algorithm A is (ɛ, δ)-correct with sample complexity N if for allM ∈ M := {(S, A, p, r, γ) : p transition probabilities},{ ∑∞}Pt=1 [V M ∗ (s t) − VM A(s 1:t) > ɛ] > N < δ# time-steps where A is not ɛ-optimal“The probability that I am ’badly’ suboptimal for morethan N time-steps is at most δ!”