What does The Explanatory-Depth Razor conclude, in numbers, about “Scoring the Assumption List and the Value of Information: Which Assumption to Test First”?

Answer: Now the value of information. At a prior of 0.400 the current decision is to hold; EVPI is 24.00 and the pilot's EVSI is 8.40, about 0.350 of the value of perfect information. At a prior of 0.550 EVSI rises to 19.05. Exactly at the break-even point of 0.625, EVSI reaches its maximum of 24.38, which is 0.650 of the value of perfect information. Past the break-even point the current decision is already to launch, and EVSI falls: 17.70 at a prior of 0.700, 8.80 at 0.800, and 0.00 at 0.900.

Scope of the numbers: Parameters are illustrative, all data are synthetic, and every calculation is generated by the book's programs. Chapter 1 measures, in synthetic data, a drop of 1.283 points in self-rated understanding of devices against an interval for facts from -0.263 to 0.063 that includes zero.

中文版

Data table

The numbers below are printed verbatim by the chapter's Python program and can be reproduced by running it. printed values that match the answer: 0.00, 0.350, 0.400, 0.550, 0.625, 0.650

prior pact nowvalue nowEVPIEVSIEVSI/EVPI
0.400hold0.0024.008.400.350
0.550hold0.0033.0019.050.577
0.625hold0.0037.5024.380.650
0.700launch12.0030.0017.700.590
0.800launch28.0020.008.800.440
0.900launch44.0010.000.000.000
break-even prior where launch and hold tie: 0.625
Show the full program
# Chapter 4. p42: value of information for one key assumption.
# Launch decision: if the assumption is true the launch earns G = 60;
# if false it loses L = 100; not launching is 0. Prior P(true) = p.
# A pilot test reports "true" with sensitivity se and specificity sp.
# EVPI = value with perfect knowledge - value now; EVSI uses the imperfect
# pilot (Howard 1966). The pilot is worth running only if EVSI > its cost.
# Units are illustrative.
G, L = 60.0, 100.0
SE, SP = 0.85, 0.80


def best(p):
    return max(0.0, p * G - (1.0 - p) * L)


def evsi(p):
    pos = p * SE + (1.0 - p) * (1.0 - SP)
    neg = 1.0 - pos
    p_pos = p * SE / pos
    p_neg = p * (1.0 - SE) / neg
    return pos * best(p_pos) + neg * best(p_neg) - best(p)


print("prior p   act now   value now   EVPI    EVSI   EVSI/EVPI")
for p in (0.40, 0.55, 0.625, 0.70, 0.80, 0.90):
    now = best(p)
    evpi = p * G - now
    act = "launch" if now > 0 else "hold"
    e = evsi(p)
    print(" {:5.3f}    {:<6}    {:6.2f}   {:6.2f}  {:6.2f}   {:6.3f}"
          .format(p, act, now, evpi, e, e / evpi if evpi else 0.0))
print("break-even prior where launch and hold tie: {:.3f}".format(
    L / (G + L)))

Single source and citation

Fan, Y. (2026). Shattering the Illusion of Explanatory Depth, Epistemic Calibration and the Razor Separating True Knowledge from Assumed Familiarity (Version 1.0.0), Chapter 4: Scoring the Assumption List and the Value of Information: Which Assumption to Test First. 5D Library. DOI pending

DOI pending · monograph page goes live after publication · 5DL-B-396 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026396,
  author    = {Fan, Yafu},
  title     = {Shattering the Illusion of Explanatory Depth, Epistemic Calibration and the Razor Separating True Knowledge from Assumed Familiarity},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book