关于「异常值注入增益:平均更差的候选为何能抬高最优解」,《人机互哺与证伪棘轮》给出的定量结论是什么?

结论:第三章算人类异常值的注入增益:20 条候选全是模型产出时最优值期望 0.934,掺进两条人类假说升到 1.186,但增益只在假说可检验时成立。

数据口径:书中参数为示意,全部计算由书中程序生成。 本书不是软件工程意见,也不是投资意见,不对任何具体商业模型的内部机制下断言。

English version

对照数据表

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

Pool of 20 candidates; k of them injected by humans
kshareE[best]P(best > 1.5)
00.000.9340.027
10.051.0660.114
20.101.1860.194
40.201.3970.332
60.301.5750.447
100.501.8570.621
150.752.1130.763
201.002.3010.852
Single candidate means: model 0.00, human -0.50
查看完整验算程序
# Chapter 3. p31: the expected best of a mixed candidate pool.
# A daily pool holds N = 20 candidate rules. Model candidates have true
# value ~ N(0, 0.5^2): competent and alike. Human field hypotheses
# ~ N(-0.5, 1.5^2): worse on average, far more spread. With k human
# candidates the best value M has CDF
#   F(x) = Phi((x + 0.5) / 1.5)^k * Phi(x / 0.5)^(N - k),
# and E[M] = int_0^inf (1 - F) dx - int_-inf^0 F dx (trapezoid rule on
# [-12, 12]). Also P(M > 1.5), a "breakthrough" no model candidate
# reaches often. Illustrative parameters.
import math
from statistics import NormalDist

N = 20
AI = NormalDist(0.0, 0.5)
HU = NormalDist(-0.5, 1.5)
STEP = 0.001


def cdf_max(x, k):
    return HU.cdf(x) ** k * AI.cdf(x) ** (N - k)


def expected_max(k):
    pos, neg = [], []
    steps = int(12.0 / STEP)
    for i in range(steps + 1):
        x = i * STEP
        wgt = 0.5 if i in (0, steps) else 1.0
        pos.append(wgt * (1.0 - cdf_max(x, k)))
        neg.append(wgt * cdf_max(-x, k))
    return (math.fsum(pos) - math.fsum(neg)) * STEP


if __name__ == "__main__":
    print("Pool of {} candidates; k of them injected by humans".format(N))
    print("   k  share   E[best]   P(best > 1.5)")
    rows = []
    for k in (0, 1, 2, 4, 6, 10, 15, 20):
        e = expected_max(k)
        p = 1.0 - cdf_max(1.5, k)
        rows.append((k, e))
        print("{:>4}  {:>5.2f}  {:>8.3f}  {:>14.3f}".format(k, k / N, e, p))
    print("Single candidate means: model {:.2f}, human {:.2f}".format(
        AI.mean, HU.mean))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《人机互哺双螺旋进化、实证门禁稳健棘轮与共生创作复利母典》第 3 章「异常值注入增益:平均更差的候选为何能抬高最优解」(版本 1.0.0). 5D Library. DOI 待发布

DOI 待发布 · 专著页正式发布后上线(本站暂无专著页) · 5DL-B-374 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026374,
  author    = {Fan, Yafu},
  title     = {Co-Evolutionary Human-AI Writing Spirals, Falsification-Gated Ratchets and Symbiotic Capability Compounding},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

本书其他章节结论