What does The Fewest Questions conclude, in numbers, about “The Fisher Information Matrix: Yes-Saying, Reverse-Keyed Questions and Optimal Design”?
Answer: Chapter 5 uses the Fisher information matrix to handle a yes-saying response style, and a design with three forward and two reverse-keyed questions pushes the entanglement term down to 0.0344.
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.0344
| design | I_tt | I_tb | I_bb | eff I_t | kept | SE |
|---|---|---|---|---|---|---|
| 5 forward, ladder | 6.2220 | 1.8638 | 4.7455 | 5.4900 | 0.882 | 0.4268 |
| 5 forward, at 3,000 | 9.3750 | 3.1250 | 5.2500 | 7.5149 | 0.802 | 0.3648 |
| 3 fwd + 2 rev | 6.2220 | 0.0344 | 4.7455 | 6.2218 | 1.000 | 0.4009 |
| mirrored pairs | 7.6984 | 0.6250 | 4.9817 | 7.6200 | 0.990 | 0.3623 |
| 5 forward at 3,000, no beta prior: det = 0.000000 (singular) |
Key formula
Show the full program
# Chapter 5. p51: a 2 x 2 Fisher information matrix for budget and
# acquiescence (yes-saying). Exact formulas, parameters illustrative.
# 正向题「到 X 在计划内吗」:eta = a (theta - ln X) + beta;
# 反向题「到 X 会超出计划吗」:eta = -a (theta - ln X) + beta。
# P(是) = 1/(1+exp(-eta));单题信息矩阵 P(1-P) [[s^2 a^2, s a],[s a, 1]]。
# 先验精度:theta 为 1/0.8^2,beta 为 1/0.5^2。预算的有效信息
# I_tt - I_tb^2 / I_bb(扣除被 beta 吃掉的部分)。评估点 3,000,beta=0。
import math
A, TH = 2.5, math.log(3000)
P_T, P_B = 1 / 0.8 ** 2, 1 / 0.5 ** 2
def matrix(items, beta=0.0):
tt, tb, bb = [P_T], [0.0], [P_B]
for price, s in items:
eta = s * A * (TH - math.log(price)) + beta
p = 1.0 / (1.0 + math.exp(-eta))
w = p * (1.0 - p)
tt.append(w * A * A)
tb.append(w * s * A)
bb.append(w)
return math.fsum(tt), math.fsum(tb), math.fsum(bb)
DESIGNS = (
("5 forward, ladder", [(1000, 1), (2000, 1), (3000, 1), (5000, 1),
(8000, 1)]),
("5 forward, at 3,000", [(3000, 1)] * 5),
("3 fwd + 2 rev", [(1000, 1), (2000, -1), (3000, 1), (5000, -1),
(8000, 1)]),
("mirrored pairs", [(2000, 1), (2000, -1), (3000, 1), (5000, 1),
(5000, -1)]),
)
print("design I_tt I_tb I_bb eff I_t kept SE")
for name, items in DESIGNS:
tt, tb, bb = matrix(items)
eff = tt - tb * tb / bb
print("%-20s %-8.4f %-8.4f %-7.4f %-8.4f %.3f %.4f"
% (name, tt, tb, bb, eff, eff / tt, 1 / math.sqrt(eff)))
tt, tb, bb = matrix(DESIGNS[1][1])
print("5 forward at 3,000, no beta prior: det = %.6f (singular)"
% ((tt - P_T) * (bb - P_B) - tb * tb))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 5: The Fisher Information Matrix: Yes-Saying, Reverse-Keyed Questions and Optimal Design. 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
- Chapter 1 · Fisher Information and the Cramér-Rao Bound: How Precise Can a Questionnaire Be?
- Chapter 2 · The Information Ceiling of Correlated Questions: Why the Sixth Question Is Nearly Wasted
- Chapter 3 · An Item Response Model for Budget Questions: How Tightly Do Five Ladder Answers Pin Down a Budget?
- Chapter 4 · Adaptive Selection: the Maximum-Information Rule and an Information-Theoretic Floor on the Number of Questions
- Chapter 6 · Estimation Theory for a Birth Time: Rounding Error, Sequential Tests and "It Matched Afterwards"
- Chapter 7 · Classical Sources East and West: "Knocking at Both Ends" and Fisher's Amount of Information
- Chapter 8 · Closing the Loop: a Five-Question Pre-Sale Budget Questionnaire, a Read-Only Question Order and a Pre-Registered Test