关于「检验消息变体:序贯检验、多臂老虎机与错误发现率」,《弃单召回与升单棘轮》给出的定量结论是什么?

结论:上界是对数似然比 2.7726,下界是 -1.5581。达到同样错误率的单侧固定样本检验,需要 1,985 封消息。序贯检验在真实挽回率为 0.030 时,平均只用 982 封就停下,中位数 697,第九十百分位 2,078,错误地判为有效的比例 0.045,低于 0.05。真实挽回率为 0.040 时,平均用 1,262 封,中位数 1,008,正确判为有效的比例 0.795,接近设定的 0.80。

数据口径:按本书的示意模型,第一波召回放在一分钟时只挽回同意离开者的 0.00609,放在十五分钟时挽回 0.03732;把三波压在一小时之内,每位离开者净值 RM 1.1790,按十五分钟、二十四小时、七十二小时发送时为 RM 1.9419;第五波的净值已是 -0.0121。 书中网站被当作付费报告产品讨论,不宣称任何预测准确性,不用恐惧招揽;所有访客与订单数据均为合成或示意。

English version

对照数据表

下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: -1.5581, 0.030, 0.040, 0.045, 0.795, 1008

boundaries: accept H1 at log LR 2.7726, accept H0 at -1.5581
fixed-sample one-sided test with the same alpha and power: n = 1,985
truth H0, p = 0.030mean n982median69790th pct2,078says H1 0.045
truth H1, p = 0.040mean n1,262median1,00890th pct2,478says H1 0.795
truth between, p = 0.035mean n1,498median1,10690th pct3,241says H1 0.396
查看完整验算程序
# Chapter 6. p61: Wald's sequential probability ratio test for one recall
# variant against a known baseline recovery rate.
# H0: wave-1 recovery p = 0.030; H1: p = 0.040 (a third better).
# alpha = 0.05, beta = 0.20 (power 0.80); Wald's boundaries A = (1 - beta) / alpha and
# B = beta / (1 - alpha). Simulated 2,000 times under each truth (fixed
# seed), against the fixed-sample size with the same error rates.
import math
import random
from statistics import NormalDist

P0, P1, ALPHA, BETA = 0.030, 0.040, 0.05, 0.20
LA, LB = math.log((1 - BETA) / ALPHA), math.log(BETA / (1 - ALPHA))
S1, S0 = math.log(P1 / P0), math.log((1 - P1) / (1 - P0))


def sprt(rng, p, cap=60000):
    k = 0
    for n in range(1, cap + 1):
        k = k + (1 if rng.random() < p else 0)
        llr = k * S1 + (n - k) * S0
        if llr >= LA:
            return n, 1
        if llr <= LB:
            return n, 0
    return cap, -1


def fixed_n():
    z = NormalDist()
    za, zb = z.inv_cdf(1 - ALPHA), z.inv_cdf(1 - BETA)
    num = za * math.sqrt(P0 * (1 - P0)) + zb * math.sqrt(P1 * (1 - P1))
    return math.ceil((num / (P1 - P0)) ** 2)


if __name__ == "__main__":
    rng = random.Random(20261120)
    print("boundaries: accept H1 at log LR {:.4f}, accept H0 at {:.4f}".format(LA, LB))
    print("fixed-sample one-sided test with the same alpha and power: n = {:,}".format(fixed_n()))
    for name, p in (("truth H0, p = 0.030", P0), ("truth H1, p = 0.040", P1),
                    ("truth between, p = 0.035", 0.035)):
        runs = [sprt(rng, p) for _ in range(2000)]
        ns = sorted(r[0] for r in runs)
        ok = len([1 for r in runs if r[1] == 1]) / len(runs)
        print("{:<26} mean n {:>6,.0f}  median {:>6,}  90th pct {:>6,}  says H1 {:.3f}".format(
            name, math.fsum(ns) / len(ns), ns[len(ns) // 2], ns[int(0.9 * len(ns))], ok))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《诊断收费站弃单挽回时序、个性化悬念召回与高客单升单棘轮母典》第 6 章「检验消息变体:序贯检验、多臂老虎机与错误发现率」(版本 1.0.0). 5D Library. DOI 待发布

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

BibTeX
@book{fan2026349,
  author    = {Fan, Yafu},
  title     = {Paywall Abandonment Recovery Timing, Personalised Curiosity Recall and High-Ticket Upsell Ratchets},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  note      = {DOI pending}
}

本书其他章节结论