Reference · The Applied Higher-Order Functions catalogue

rainbow.algorithms.proofs.ahof.sarsop

The Applied Higher-Order Functions cataloguesrc/rainbow/algorithms/proofs/ahof/sarsop.clj1 definitions, 4 theorems

AHoF D74 SARSOP (Successive Approximations of the Reachable Space under Optimal Policies): a point-based POMDP solver that samples beliefs reachable under the optimal policy and tightens value bounds; it has converged when the bound gap is within the target precision: converged? gap epsilon = decide (gap <= epsilon). Proved native and axiom-free (decision, two positive instances, at-most certificate, negative instance). Requires audit/decide-nnrat-at-most, nnrat/at-most, nnrat/decide-at-most-true-sound (all in the D63 checkpoint). Scope (measured by the kernel): this module has 4 worked instances (statements about specific values). None of its theorems is a guarantee about the algorithm for all inputs; `lein verify rainbow.algorithms.proofs.ahof.sarsop` prints this classification.

sarsop/converged? :
  (x₁ x₂ : ℚ≥0)
  → data/Bool

sarsop/small-gap-converged :
  → lis/extends? 1/4 1/2 = data/true

sarsop/boundary-gap-converged :
  → lis/extends? 1/2 1/2 = data/true

sarsop/gap-certificate :
  → 1/4 ≤ 1/2

sarsop/large-gap-unconverged :
  → lis/extends? 3/4 1/2 = data/false