关于「淘汰规则:最小曝光、后验胜率与时间均匀置信序列」,《夜间自治漏斗》给出的定量结论是什么?

结论:先看检验水平 0.05 这四行。误删率在 0.003 到 0.006 之间,好版本遭删率始终是 0.000。差版本第 28 晚遭删比例在 0.139 到 0.143 之间,第 56 晚升到 0.532 至 0.577。最小曝光量从 0 加到 8,000,几乎不影响结果。

数据口径:书中参数为示意;全部计算由书中 23 段程序生成;本书是非个人化的经营分析,不构成经营、法律或财务建议,不宣称任何转化率提升的保证。

English version

对照数据表

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

min n alpha false kill good killed bad caught d28 d56
00.050.0030.0000.142 0.559
2,0000.050.0060.0000.143 0.577
4,0000.050.0040.0000.139 0.534
8,0000.050.0050.0000.141 0.532
00.100.0100.0000.258 0.677
2,0000.100.0120.0000.239 0.671
4,0000.100.0120.0000.251 0.682
8,0000.100.0110.0000.252 0.663
查看完整验算程序
# Chapter 5. p53: minimum exposure and alpha for the p52 rule, over
# 56 nights. For each setting: false kill rate when B equals A (0.050),
# kill rate of a 10 percent better B (0.055), catch rate of a 10
# percent worse B (0.045) by night 28 and by night 56. Same boundary
# and traffic as p52; 2,000 runs per cell.
import math
import random
from statistics import NormalDist

PHI = NormalDist().cdf
DAYS, PER, REPS, BAR = 56, 600, 2000, 0.05
RHO = 10000 * 2 * 0.05 * 0.95
rng = random.Random(40553)


def binom(n, p):
    x = round(n * p + math.sqrt(n * p * (1 - p)) * rng.gauss(0, 1))
    return min(max(x, 0), n)


def p_better(sa, sb, n):
    a1, b1, a2, b2 = 1 + sa, 1 + n - sa, 1 + sb, 1 + n - sb
    m1, m2 = a1 / (a1 + b1), a2 / (a2 + b2)
    v1 = a1 * b1 / ((a1 + b1) ** 2 * (a1 + b1 + 1))
    v2 = a2 * b2 / ((a2 + b2) ** 2 * (a2 + b2 + 1))
    return PHI((m2 - m1) / math.sqrt(v1 + v2))


def upper_gap(sa, sb, n, alpha):
    pa, pb = (sa + 1) / (n + 2), (sb + 1) / (n + 2)
    v = n * (pa * (1 - pa) + pb * (1 - pb))
    half = math.sqrt((v + RHO) * (2 * math.log(1 / alpha)
                                  + math.log((v + RHO) / RHO)))
    return (sb - sa + half) / n


def kill_day(pb, min_n, alpha):
    sa = sb = n = 0
    for d in range(1, DAYS + 1):
        sa += binom(PER, 0.050)
        sb += binom(PER, pb)
        n += PER
        if (n >= min_n and p_better(sa, sb, n) < BAR
                and upper_gap(sa, sb, n, alpha) < 0):
            return d
    return None


print("min n  alpha  false kill  good killed  bad caught d28  d56")
for alpha in [0.05, 0.10]:
    for min_n in [0, 2000, 4000, 8000]:
        out = []
        for pb in [0.050, 0.055, 0.045]:
            ds = [kill_day(pb, min_n, alpha) for _ in range(REPS)]
            k28 = len([d for d in ds if d is not None and d <= 28])
            k56 = len([d for d in ds if d is not None])
            out.append((k28 / REPS, k56 / REPS))
        print("{:>5,} {:>6.2f} {:>11.3f} {:>12.3f} {:>15.3f} {:>5.3f}"
              .format(min_n, alpha, out[0][1], out[1][1], out[2][0],
                      out[2][1]))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《夜间自治漏斗微创调优、多臂赌博机流量自动倾斜与零人工转化率自举母典》第 5 章「淘汰规则:最小曝光、后验胜率与时间均匀置信序列」(版本 1.0.0). 5D Library. DOI 待发布

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

BibTeX
@book{fan2026405,
  author    = {Fan, Yafu},
  title     = {Autonomous Nightly Funnel Micro-Surgery, Bandit Traffic Allocation and Zero-Touch Conversion Self-Improvement},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

本书其他章节结论