关于「为什么大多数已发表的发现可能是错的:伊奥尼迪斯的推导」,《可证伪性与可重复性危机》给出的定量结论是什么?
结论:伊奥尼迪斯把诊断检验的贝叶斯推理用到科学发现上:阳性预测值由事前比值 \(R\)、功效与显著性水平决定,偏倚 \(u\) 会使它进一步下降。框架中的公式写法与原文等价;功效 0.20、\(R = 0.1\)、\(u = 0.20\) 时阳性预测值约为 13.0%。古德曼与格林兰指出,把 \(p\) 值一刀切会掩盖证据强度的差异,且「大多数是错的」依赖于假设;贾格尔与利克的经验估计(约 14%)本身也依赖于有争议的假设。下一章看偏倚 \(u\) 从哪里来:研究者在数据分析中的自由选择。
数据口径:本书不是医疗、心理或投资建议。 书中以标注框区分已发表的证据、可运行的 Python 计算(14 段程序,全部核对)、原典与作者的假说。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 与结论吻合的打印值: 0.1, 0.20
| largest difference between the two forms over 11970 parameter sets: 1.1e-15 | |||
| power 0.20, R = 0.1: PPV = 0.1304 (u = 0.2), | 0.1161 (u = 0.3), | 0.2857 (u = 0.0) | |
| Table 4 of Ioannidis 2005, recomputed: power R u PPV (paper) | |||
| 0.80 | 1.0000 | 0.10 | 0.8497 (0.85) |
| 0.95 | 2.0000 | 0.30 | 0.8521 (0.85) |
| 0.80 | 0.3333 | 0.40 | 0.4055 (0.41) |
| 0.20 | 0.2000 | 0.20 | 0.2308 (0.23) |
| 0.20 | 0.2000 | 0.80 | 0.1718 (0.17) |
| 0.80 | 0.1000 | 0.30 | 0.2043 (0.20) |
| 0.20 | 0.1000 | 0.30 | 0.1161 (0.12) |
| 0.20 | 0.0010 | 0.80 | 0.0010 (0.0010) |
| 0.20 | 0.0010 | 0.20 | 0.0015 (0.0015) |
| n independent teams, no bias, R = 0.1: | n = 1 | 5 | 10 |
| power 0.20 | 0.286 | 0.229 | 0.182 |
| power 0.80 | 0.615 | 0.306 | 0.199 |
核心公式
\[\mathrm{PPV} = \frac{(1-\beta)R}{(1-\beta)R + \alpha} = \frac{(1-\beta)R}{R - \beta R + \alpha}.\]
查看完整验算程序
# Positive predictive value of a "research finding" (Ioannidis 2005, PLoS Med 2: e124). R
# = pre-study odds of a true relationship among those probed, 1 - beta = power, alpha =
# 0.05, u = share of analyses that would not have been findings but are reported as
# findings through bias.
def ppv_ioannidis(power, R, u, alpha=0.05):
beta = 1 - power
return (((1 - beta) * R + u * beta * R)
/ (R + alpha - beta * R + u - u * alpha + u * beta * R))
def ppv_author(power, R, u, alpha=0.05):
# the framework's form: [(1-b)R + u b R] / [(1-b)R + alpha + u b R + u(1-alpha)]
beta = 1 - power
num = (1 - beta) * R + u * beta * R
return num / ((1 - beta) * R + alpha + u * beta * R + u * (1 - alpha))
def ppv_teams(power, R, n, alpha=0.05):
# n independent teams probe the same question; a "finding" if at least one is
# significant
beta = 1 - power
return R * (1 - beta ** n) / (R + 1 - (1 - alpha) ** n - R * beta ** n)
if __name__ == "__main__":
grid = [(p / 20, r / 10, u / 20) for p in range(1, 20) for r in range(1, 31)
for u in range(21)]
diff = max(abs(ppv_ioannidis(*g) - ppv_author(*g)) for g in grid)
print(f"largest difference between the two forms over {len(grid)} parameter sets:"
f" {diff:.1e}")
vals = ", ".join(f"{ppv_ioannidis(0.20, 0.1, u):.4f} (u = {u})"
for u in (0.2, 0.3, 0.0))
print("power 0.20, R = 0.1: PPV = " + vals)
print("Table 4 of Ioannidis 2005, recomputed: power R u PPV (paper)")
rows = [(0.80, 1, 0.10, "0.85"), (0.95, 2, 0.30, "0.85"), (0.80, 1 / 3, 0.40, "0.41"),
(0.20, 1 / 5, 0.20, "0.23"), (0.20, 1 / 5, 0.80, "0.17"),
(0.80, 1 / 10, 0.30, "0.20"),
(0.20, 1 / 10, 0.30, "0.12"), (0.20, 1 / 1000, 0.80, "0.0010"),
(0.20, 1 / 1000, 0.20, "0.0015")]
for pw, R, u, paper in rows:
f = ppv_ioannidis(pw, R, u)
print(f"{'':39s}{pw:.2f} {R:7.4f} {u:.2f} {f:.4f} ({paper})")
print("n independent teams, no bias, R = 0.1: n = 1 5 10")
for pw in (0.20, 0.80):
vals = " ".join(f"{ppv_teams(pw, 0.1, n):.3f}" for n in (1, 5, 10))
print(f" power {pw:.2f}{'':27s}" + vals)唯一数据源与引用
范雅福(Fan, Y.). (2026). 《科学方法论、可证伪性与可重复性危机的数理统计》第 2 章「为什么大多数已发表的发现可能是错的:伊奥尼迪斯的推导」(版本 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.23782104
DOI: 10.5281/zenodo.23782104 · 阅读本章所在专著 · 5DL-B-033 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026033,
author = {Fan, Yafu},
title = {Scientific Methodology, Falsifiability and the Mathematical Statistics of the Replication Crisis},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
doi = {10.5281/zenodo.23782104},
url = {https://doi.org/10.5281/zenodo.23782104}
}