What does Birth-Time Error and Boundary Flips conclude, in numbers, about “Bayesian Updating and Choosing Items by Information Gain”?

Answer: Expected information gain gives a transparent rule for choosing items: always ask the one that lowers the posterior entropy most on average. In the illustrative bank no item gains more than 0.1564 bits, far below the prior entropy of 1.5219 bits; a person's posterior can swing widely during a session, and where one stops changes the conclusion. Averaged over ten thousand people, the greedy error after four items is 0.2808 against 0.3648 for a random order; after all twelve, every policy reaches the same floor of about one in five. Respondents' misdating and yea-saying weaken every item further: with a misdating probability of 0.3, an item that needed 7 repetitions needs 15. The next chapter takes up the most dangerous case: items with no power at all, and after-the-fact matches that still appear again and again.

Scope of the numbers: Its parameters are illustrative, and all calculations are generated by its programs. Chapter 1 shows that in the illustrative model 0.2782 of remembered times fall exactly on a double-hour boundary, against 0.0083 without rounding.

中文版

Data table

The numbers below are printed verbatim by the chapter's Python program and can be reproduced by running it. standard-library Python onlyprinted values that match the answer: 0.1564, 1.5219

expected gain at the prior (bits), H(prior)1.5219
Q1 Q2 Q3 Q4 Q5 Q6
0.1141 0.1141 0.0768 0.0777 0.1564 0.0058
Q7 Q8 Q9 Q10 Q11 Q12
0.1564 0.0000 0.1510 0.1510 0.0633 0.0763
trace, true candidate Si
step item gain answer Chen Si Wu
1 Q70.1564 yes 0.1818 0.4545 0.3636
2 Q50.1431 no 0.0656 0.4098 0.5246
3 Q40.1246 yes 0.1008 0.6303 0.2689
4 Q20.1109 yes 0.0548 0.7991 0.1461
5 Q30.0601 yes 0.0459 0.6688 0.2854
6 Q120.0973 yes 0.0346 0.5043 0.4611
7 Q90.0615 yes 0.0678 0.3296 0.6026
8 Q100.0626 yes 0.0300 0.4371 0.5329
9 Q10.0142 yes 0.0673 0.4203 0.5124
10 Q110.0167 yes 0.1181 0.3974 0.4845
11 Q60.0032 yes 0.1336 0.3680 0.4984
12 Q80.0000 yes 0.1336 0.3680 0.4984
stopped after 12 items; top candidate Wu
Show the full program
# Chapter 5. p51: choose the next question by expected information gain.
# Three candidates (Chen, Si, Wu) with the "morning 07-12" prior of p41.
# A bank of twelve abstract past-event items; row k gives P(yes | Chen),
# P(yes | Si), P(yes | Wu). These numbers are illustrative only: no
# published study shows that any such item discriminates between
# double hours, and Chapter 6 shows what happens when none does. The
# expected gain of an item is I = H(post) - E[H(post | answer)]. We
# list the gains at the prior, then trace one simulated person whose
# true candidate is Si, asking greedily without repeating an item and
# stopping when one candidate reaches 0.95. Fixed seed.
import math
import random

NAMES = ["Chen", "Si", "Wu"]
PRIOR = [0.4, 0.4, 0.2]
BANK = [(0.70, 0.30, 0.30), (0.30, 0.70, 0.30), (0.30, 0.30, 0.70),
        (0.60, 0.60, 0.20), (0.80, 0.50, 0.20), (0.55, 0.45, 0.50),
        (0.20, 0.50, 0.80), (0.50, 0.50, 0.50), (0.75, 0.25, 0.50),
        (0.25, 0.75, 0.50), (0.65, 0.35, 0.35), (0.35, 0.35, 0.75)]


def entropy(p):
    return -math.fsum(x * math.log2(x) for x in p if x > 0)


def update(post, item, yes):
    w = [p * (y if yes else 1 - y) for p, y in zip(post, item)]
    z = math.fsum(w)
    return [x / z for x in w], z


def gain(post, item):
    py_post, py = update(post, item, True)
    pn_post, pn = update(post, item, False)
    return entropy(post) - py * entropy(py_post) - pn * entropy(pn_post)


print("expected gain at the prior (bits), H(prior) = %.4f"
      % entropy(PRIOR))
gains = [gain(PRIOR, it) for it in BANK]
print("  " + " ".join("Q%-5d" % (k + 1) for k in range(6)))
print("  " + " ".join("%.4f" % g for g in gains[:6]))
print("  " + " ".join("Q%-5d" % (k + 1) for k in range(6, 12)))
print("  " + " ".join("%.4f" % g for g in gains[6:]))
rng = random.Random(20261113)
truth = 1
post, used = list(PRIOR), []
print("trace, true candidate Si")
print("step item  gain    answer   Chen    Si      Wu")
while max(post) < 0.95 and len(used) < len(BANK):
    k = max((gain(post, BANK[j]), -j) for j in range(len(BANK))
            if j not in used)[1] * -1
    g = gain(post, BANK[k])
    yes = rng.random() < BANK[k][truth]
    post, _ = update(post, BANK[k], yes)
    used.append(k)
    print("%3d  Q%-3d %7.4f  %-6s %7.4f %7.4f %7.4f"
          % (len(used), k + 1, g, "yes" if yes else "no", *post))
print("stopped after %d items; top candidate %s"
      % (len(used), NAMES[post.index(max(post))]))

Single source and citation

Fan, Y. (2026). Error Propagation from Remembered Birth Times and Robust Chart Fixing: Flip Probabilities at Double-Hour Boundaries and the Fewest Past-Event Questions (Version 1.0.0), Chapter 5: Bayesian Updating and Choosing Items by Information Gain. 5D Library. DOI pending

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

BibTeX
@book{fan2026284,
  author    = {Fan, Yafu},
  title     = {Error Propagation from Remembered Birth Times and Robust Chart Fixing: Flip Probabilities at Double-Hour Boundaries and the Fewest Past-Event Questions},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book