关于「公平地检验回溯:序贯检验与选择性回忆」,《回溯信念与升单自动机》给出的定量结论是什么?

结论:第二章给出三选一的序贯检验,并显示选择性回忆把对错各半的断言记成 0.7493 的准确率,事先记录则为 0.4995。

数据口径:第一章证明「信任雪崩」是感受上的相变而不是证据上的:泛泛的回溯断言真实似然比只有 1.19,怀疑者需要 27 次命中才半信,但若把基率 0.80 误判为 0.20,3 次就够;在 20,000 位模拟用户中,一位没有任何洞察力的测算师在 6 条泛泛断言之内使 0.5263 的用户确信,而按真实似然比更新的用户几乎无人确信。 第六章显示稀有的跨板块转移在 1,000 位用户时区间宽度仍为真值的 0.74 倍;「自己学会算」蚕食的测算收入小于学费;两类用户合成一条链会严重低估长尾留存。

English version

对照数据表

下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 0.4995, 0.7493

accuracy mean median share >0.8
recalled0.7493 0.7500 0.4193
written down0.4995 0.4667 0.0174
expected recalled accuracy 0.9/(0.9+0.3)0.7500
Reading: with ordinary selective recall a reader with no
insight is remembered as right three times in four, and two
clients in five remember 80% or more. Writing the statements
down beforehand removes the effect entirely.
查看完整验算程序
# Chapter 2. [p04] Selective recall turns chance into "accuracy".
# A reader with no insight makes 15 yes/no retrodictions, one for each
# of the past 15 years ("a hard year", "a good year"); each is right
# with probability 0.5. The client later recalls a right one with
# probability 0.9 and a wrong one with probability 0.3, and judges the
# reader by the share right among those she recalls. 50,000 clients
# (seed 69). Compared: perceived accuracy with recall, and accuracy
# when all 15 statements were written down beforehand.
import random

N, YEARS = 50000, 15

if __name__ == "__main__":
    rng = random.Random(69)
    seen, written, over = [], [], 0
    for _ in range(N):
        right = [rng.random() < 0.5 for _ in range(YEARS)]
        rec = [r for r in right if rng.random() < (0.9 if r else 0.3)]
        acc = sum(rec) / len(rec) if rec else 0.0
        seen.append(acc)
        written.append(sum(right) / YEARS)
        over += acc >= 0.8
    seen.sort()
    written.sort()
    print("   accuracy        mean    median  share >= 0.8")
    print("   recalled      {:.4f} {:9.4f} {:13.4f}".format(
        sum(seen) / N, seen[N // 2], over / N))
    print("   written down  {:.4f} {:9.4f} {:13.4f}".format(
        sum(written) / N, written[N // 2],
        sum(w >= 0.8 for w in written) / N))
    print("   expected recalled accuracy 0.9/(0.9+0.3) = {:.4f}".format(
        0.9 / 1.2))
    print("\nReading: with ordinary selective recall a reader with no")
    print("insight is remembered as right three times in four, and two")
    print("clients in five remember 80% or more. Writing the statements")
    print("down beforehand removes the effect entirely.")

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《回溯信念锁定、序贯痛点唤醒与马尔可夫升单自动机》第 2 章「公平地检验回溯:序贯检验与选择性回忆」(版本 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.24090186

DOI: 10.5281/zenodo.24090186 · 阅读本章所在专著 · 5DL-B-069 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026069,
  author    = {Fan, Yafu},
  title     = {Retrodictive Belief Locking, Sequential Pain-Point Agitation and Markovian Upsell Automata},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  doi       = {10.5281/zenodo.24090186},
  url       = {https://doi.org/10.5281/zenodo.24090186}
}

本书其他章节结论