关于「每周看一眼:平庸文案怎样被误转正」,《规则的一生》给出的定量结论是什么?

结论:第一章正面陈述并量化命题:每周双侧检验看 10 次,误报率 0.1934,看满一年 0.3235;40 条规则的队列里,偷看误转正 5.58 条,序贯检验 0.73 条。序中修正立项蓝图:两成以上要看到第 11 次才越过;「约一半」只在设计点附近成立,精确值为固定样本的 0.464 与 0.632,平庸规则处升到 0.748;最优性由 Wald 与沃尔福威茨 1948 年证明。

数据口径:书中的转化率、流量与每周计数均为示意;全部计算由书中程序生成;本书属非个人化经营方法,不构成经营、法律或投资建议,规则的转正、降级与退役须由主事者人工放行,紧迫感只能来自真实库存与真实截止。 书中以标注框区分已发表的证据、可运行的 Python 计算(20 段程序)、原典与作者的假说。

English version

对照数据表

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

repeated two-sided z-tests at nominal 0.05, one look per week
grid width 0.02, looks up to 52
looksP(false win by then)x nominalfalse wins in 30 nulls
10.05001.001.50
20.08311.662.49
30.10732.153.22
50.14172.834.25
80.17633.535.29
100.19343.875.80
130.21384.286.41
200.24794.967.44
260.26885.388.06
390.30096.029.03
520.32356.479.71
first look count with P(false win) >= 0.20: 11
查看完整验算程序
# Chapter 1. p11: weekly looks at a fixed-sample test inflate false wins
# Model: the classical repeated significance test of Armitage, McPherson
# and Rowe (1969). Each weekly batch adds one N(0,1) increment to the
# score S_k; at look k the rule is promoted if |S_k| >= 1.96 * sqrt(k)
# (nominal two-sided 0.05). We push the density of S_k forward on a
# grid of cells of width H, using exact normal cell masses (erf), and
# remove the mass that crosses at each look (a cell cut by the
# boundary is split in proportion). Nothing is random here. Grid width
# H = 0.02 is a numerical choice; results are good to about three
# decimals. The pipeline line multiplies by 30 null copy rules
# (an illustrative backlog, not data).
import math

H = 0.02
Z = 1.96
LOOKS = 52
SHOW = (1, 2, 3, 5, 8, 10, 13, 20, 26, 39, 52)
NULL_RULES = 30


def phi_cdf(x):
    return 0.5 * (1.0 + math.erf(x / math.sqrt(2.0)))


def kernel(width, reach=8.0):
    d = int(reach / width) + 1
    ker = {}
    for j in range(-d, d + 1):
        lo = (j - 0.5) * width
        ker[j] = phi_cdf(lo + width) - phi_cdf(lo)
    return d, ker


def run():
    d, ker = kernel(H)
    mass = {0: 1.0}          # cell index -> probability, start at S_0 = 0
    crossed = []
    for k in range(1, LOOKS + 1):
        lim = Z * math.sqrt(k)
        top = int(lim / H) + d + 2
        new = {}
        for j in range(-top, top + 1):
            terms = [m * ker[j - i] for i, m in mass.items()
                     if -d <= j - i <= d]
            if terms:
                new[j] = math.fsum(terms)
        keep, gone = {}, []
        for j in sorted(new):
            lo = max(j * H - H / 2, -lim)
            hi = min(j * H + H / 2, lim)
            inside = max(0.0, hi - lo) / H
            if inside > 0:
                keep[j] = new[j] * inside
            gone.append(new[j] * (1.0 - inside))
        crossed.append(math.fsum(gone))
        mass = keep
    return crossed


crossed = run()
print("repeated two-sided z-tests at nominal 0.05, one look per week")
print("grid width %.2f, looks up to %d" % (H, LOOKS))
print("looks  P(false win by then)  x nominal  false wins in %d nulls"
      % NULL_RULES)
for k in SHOW:
    a = math.fsum(crossed[:k])
    print("%5d  %20.4f  %9.2f  %21.2f" % (k, a, a / 0.05, a * NULL_RULES))
first = next(k for k in range(1, LOOKS + 1)
             if math.fsum(crossed[:k]) >= 0.2)
print("first look count with P(false win) >= 0.20: %d" % first)

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《线上规则实证淘汰、序贯概率比检验接入真实转化流与新文案规则转正降级母典》第 1 章「每周看一眼:平庸文案怎样被误转正」(版本 1.0.0). 5D Library. DOI 待发布

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

BibTeX
@book{fan2026263,
  author    = {Fan, Yafu},
  title     = {Empirical Retirement of Live Rules: Wiring the Sequential Probability Ratio Test into Real Conversion Streams to Promote, Demote and Retire Copy Rules},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

本书其他章节结论