关于「泰洛克的预测研究:专家、狐狸与超级预测者」,《概率校准与群体智慧》给出的定量结论是什么?
结论:泰洛克让 284 名专家在约二十年里给出数万次数字概率预测,发现专家平均只是略好于「一律三分之一」,不如简单外推与统计模型,狐狸型好于刺猬型,刺猬在自己领域的长期预测上尤其差;「不如黑猩猩」是通俗说法。玩具模型显示,拥有同样信息的预测者,只因过度自信就可能退到随机猜测的水平。预测锦标赛表明,简短的概率训练、组队与追踪可以提高准确性,超级预测者部分被发现、部分被培养;有反馈的气象与情报评估也可以校准得很好。下一章讨论怎样打分:布莱尔分数、墨菲分解与恰当评分规则。
数据口径:本书不是心理咨询、医学或投资建议。 书中以标注框区分已发表的证据、可运行的 Python 计算(16 段程序,全部核对)、原典与作者的假说。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库
| outcome frequencies (status quo, more, less): 0.522, 0.238, 0.239 | |
| forecaster | | mean Brier score (3 outcomes, 0 best, 2 worst) |
| chimp | | 0.667 |
| base rate | | 0.613 |
| fox | | 0.551 |
| overconfident | 0.665 | |
| hedgehog | | 0.710 |
| chimp's expected score is exactly 1/3 - 2/3 + 1 = 0.667 whatever happens |
查看完整验算程序
# Toy three-outcome questions (status quo / more / less), scored with Brier's original
# multi-category score (0 best, 2 worst). Truth: logits = base + s, s ~ N(0, 1).
# Forecasters see s + N(0, 1) noise: fox shrinks it by 0.5 (Bayes), overconfident x1.5,
# hedgehog x1.5 and leans towards change. Illustrative parameters.
import math, random
rng = random.Random(2005)
BASE = (1.0, 0.0, 0.0) # status quo is the most common outcome
def softmax(z):
m = max(z)
e = [math.exp(v - m) for v in z]
t = sum(e)
return [v / t for v in e]
def brier(f, k):
return sum((f[j] - (1.0 if j == k else 0.0)) ** 2 for j in range(3))
def run(nq=20000):
names = ("chimp", "base rate", "fox", "overconfident", "hedgehog")
tot = dict.fromkeys(names, 0.0)
freq = [0, 0, 0]
rows = []
for _ in range(nq):
s = [rng.gauss(0, 1) for _ in range(3)]
p = softmax([b + v for b, v in zip(BASE, s)])
k = rng.choices(range(3), weights=p)[0]
freq[k] += 1
obs = [v + rng.gauss(0, 1) for v in s]
rows.append((obs, k))
base = [c / nq for c in freq]
for obs, k in rows:
fc = {"chimp": [1 / 3] * 3,
"base rate": base,
"fox": softmax([b + 0.5 * v for b, v in zip(BASE, obs)]),
"overconfident": softmax([b + 1.5 * v for b, v in zip(BASE, obs)]),
"hedgehog": softmax([b - (0.8 if j == 0 else 0) + 1.5 * v
for j, (b, v) in enumerate(zip(BASE, obs))])}
for n in names:
tot[n] += brier(fc[n], k)
return base, {n: tot[n] / nq for n in names}
if __name__ == "__main__":
base, score = run()
print("outcome frequencies (status quo, more, less): "
+ ", ".join(f"{b:.3f}" for b in base))
print("forecaster | mean Brier score (3 outcomes, 0 best, 2 worst)")
for n, v in score.items():
print(f"{n:13s} | {v:.3f}")
print(f"chimp's expected score is exactly 1/3 - 2/3 + 1 = {1 / 3 - 2 / 3 + 1:.3f}"
" whatever happens")唯一数据源与引用
范雅福(Fan, Y.). (2026). 《概率判断、布莱尔分数校准与群体智慧的统计理论》第 1 章「泰洛克的预测研究:专家、狐狸与超级预测者」(版本 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.23764998
DOI: 10.5281/zenodo.23764998 · 阅读本章所在专著 · 5DL-B-026 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026026,
author = {Fan, Yafu},
title = {Probabilistic Judgement, Brier-Score Calibration and the Statistics of Collective Intelligence},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
doi = {10.5281/zenodo.23764998},
url = {https://doi.org/10.5281/zenodo.23764998}
}