Reference · The Applied Higher-Order Functions catalogue

rainbow.algorithms.proofs.ahof.cross-entropy-is

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

AHoF V29 Cross-Entropy Importance Sampling: iteratively fit the sampling distribution to the rare failure region by keeping the elite samples -- those whose cost falls at or below the current elite quantile threshold: elite? cost threshold = decide (cost <= threshold). 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.cross-entropy-is` prints this classification.

ce-is/elite? :
  (x₁ x₂ : ℚ≥0)
  → data/Bool

ce-is/low-cost-is-elite :
  → ce-is/elite? 1/4 1/2 = data/true

ce-is/boundary-is-elite :
  → ce-is/elite? 1/2 1/2 = data/true

ce-is/elite-certificate :
  → 1/4 ≤ 1/2

ce-is/high-cost-not-elite :
  → ce-is/elite? 3/4 1/2 = data/false