What does The Fewest Questions conclude, in numbers, about “Adaptive Selection: the Maximum-Information Rule and an Information-Theoretic Floor on the Number of Questions”?

Answer: The maximum-information rule makes the next question follow the current estimate. In the simulation five adaptive questions have an error of 0.3866, slightly better than the 0.3969 of eight fixed ones, and stopping on precision needs only 4.33 questions on average. Information theory gives a hard floor: each yes/no question carries at most \(1 - H(e)\) bits, and with an answer error rate of 0.2 choosing one of twelve blocks takes at least 13 questions. The next chapter widens the view from one parameter to two: when the answers are also mixed with a "yes-saying" response style, the Fisher information matrix tells us how to write the questions.

Scope of the numbers: Marked boxes separate published evidence, runnable Python calculations (19 programs), classical sources and the author's hypotheses.

中文版

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.3866, 0.3969, 4.33

designmean itemsRMSEmean post SDP(SD < 0.42)
fixed ladder 55.000.45240.43690.4655
fixed ladder 88.000.39690.38010.9315
adaptive 33.000.47420.46470.0000
adaptive 55.000.38660.37590.9395
adaptive stop4.330.40370.39911.0000
respondents per design: 2,000; bank of 25 prices
Show the full program
# Chapter 4. p41: adaptive selection by maximum Fisher information
# versus fixed price ladders. Fixed-seed Monte Carlo, illustrative.
# 题库:25 个价格门槛,从 500 到 24,000 按对数等距。每一步选在当前
# 后验均值处费希尔信息最大的未用题;后验标准差低于 0.42 或问满上限即停。
# 对照:固定五题阶梯(p12)、固定八题阶梯。先验与 a 同 p31。
import math
import random
from statistics import NormalDist

A, MU, SD, N = 2.5, math.log(3000), 0.8, 2000
BANK = [math.log(500) + i * math.log(48) / 24 for i in range(25)]
FIX5 = [math.log(x) for x in (1000, 2000, 3000, 5000, 8000)]
FIX8 = [math.log(x) for x in (700, 1100, 1700, 2500, 3600, 5300, 7800,
                               11500)]
GRID = [MU - 4 * SD + 8 * SD * i / 240 for i in range(241)]
PRIOR = [NormalDist(MU, SD).pdf(t) for t in GRID]


def p_yes(theta, b):
    return 1.0 / (1.0 + math.exp(-A * (theta - b)))


def update(w, b, y):
    out = [v * (p_yes(t, b) if y else 1.0 - p_yes(t, b))
           for t, v in zip(GRID, w)]
    z = math.fsum(out)
    return [v / z for v in out]


def moments(w):
    m = math.fsum(t * v for t, v in zip(GRID, w))
    s = math.sqrt(math.fsum((t - m) ** 2 * v for t, v in zip(GRID, w)))
    return m, s


def run(th, rng, items=None, stop_sd=None, cap=8):
    z = math.fsum(PRIOR)
    w = [v / z for v in PRIOR]
    used, m, s = [], MU, SD
    while len(used) < cap:
        if items is not None:
            b = items[len(used)]
        else:
            if stop_sd is not None and s < stop_sd:
                break
            b = min((x for x in BANK if x not in used),
                    key=lambda x: abs(x - m))
        used.append(b)
        w = update(w, b, rng.random() < p_yes(th, b))
        m, s = moments(w)
    return m, s, len(used)


DESIGNS = (("fixed ladder 5", FIX5, None, 5),
           ("fixed ladder 8", FIX8, None, 8),
           ("adaptive 3", None, None, 3),
           ("adaptive 5", None, None, 5),
           ("adaptive stop", None, 0.42, 8))
print("design          mean items  RMSE    mean post SD  P(SD < 0.42)")
for name, items, stop, cap in DESIGNS:
    rng = random.Random(20261113)
    sq, sds, ns, ok = [], [], [], 0
    for _ in range(N):
        th = rng.gauss(MU, SD)
        m, s, k = run(th, rng, items, stop, cap)
        sq.append((m - th) ** 2)
        sds.append(s)
        ns.append(k)
        ok += s < 0.42
    print("%-15s %-11.2f %.4f  %.4f        %.4f"
          % (name, math.fsum(ns) / N, math.sqrt(math.fsum(sq) / N),
             math.fsum(sds) / N, ok / N))
print("respondents per design: {:,}; bank of {} prices".format(N,
                                                             len(BANK)))

Single source and citation

Fan, Y. (2026). Fisher Information Matrices and the Cramér-Rao Bound: the Fewest Questions Needed to Estimate a Budget or a Birth Time (Version 1.0.0), Chapter 4: Adaptive Selection: the Maximum-Information Rule and an Information-Theoretic Floor on the Number of Questions. 5D Library. DOI pending

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

BibTeX
@book{fan2026235,
  author    = {Fan, Yafu},
  title     = {Fisher Information Matrices and the Cramér-Rao Bound: the Fewest Questions Needed to Estimate a Budget or a Birth Time},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

Other chapter answers in this book