关于「漏斗体检:六步 Beta 后验、夜间改动优先级与合规候选池」,《夜间自治漏斗》给出的定量结论是什么?

结论:单晚的 B 夜换了一组小样本:进来 1,650 人,往后依次是 1,010、445、190、112、77 人。这时试读的 P(top) 只有 0.714,首屏占 0.286。试读的优先级区间从 3,511 到 5,140,首屏从 3,270 到 4,968,中位数 4,305 对 4,067,确实分不开。规则给出 HOLD:今晚不改,明晚再合并一天的数据重算。

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

English version

对照数据表

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

night A week pooled: 12,000, 7,440, 3,350, 1,410, 820, 560
stepP(top)priorityinterval 2.5% to 97.5%
visit0.00014,40113,240 to 15,641
hold0.00028,67826,458 to 30,967
sample1.00032,32330,055 to 34,646
tier0.00016,90715,625 to 18,249
checkout0.00010,9319,842 to 12,043
decision: CHANGE sample (P(top) 1.000 vs bar 0.80)
night B one night: 1,650, 1,010, 445, 190, 112, 77
stepP(top)priorityinterval 2.5% to 97.5%
visit0.0002,0301,614 to 2,520
hold0.2864,0673,270 to 4,968
sample0.7144,3053,511 to 5,140
tier0.0002,2421,788 to 2,731
checkout0.0001,4801,103 to 1,900
decision: HOLD (P(top) 0.714 vs bar 0.80)

核心公式

\[\text{priority}_k = n_k (1-p_k)\cdot \text{NET}\cdot\prod_{j>k} p_j ,\]
查看完整验算程序
# Chapter 1. p12: nightly change priority = lost visitors x downstream
# expected net contribution, with posterior uncertainty.
# priority_k = n_k * (1 - p_k) * NET * prod_{j > k} p_j, where p_k is a
# draw from Beta(1 + pass, 1 + drop). NET (net contribution per paid
# order, in illustrative units) is fixed. The hold rule: change a step
# tonight only if P(step has the largest priority) >= 0.80; otherwise
# hold, because the priority intervals overlap too much.
import random

STEPS = ["visit", "hold", "sample", "tier", "checkout"]
NET = 42.0
NIGHTS = {"A week pooled": [12000, 7440, 3350, 1410, 820, 560],
          "B one night": [1650, 1010, 445, 190, 112, 77]}
DRAWS = 20000
PASS_P = 0.80
rng = random.Random(40512)


def q(xs, f):
    xs = sorted(xs)
    return xs[int(f * (len(xs) - 1))]


for name in sorted(NIGHTS):
    c = NIGHTS[name]
    wins = [0] * len(STEPS)
    pri = [[] for _ in STEPS]
    for _ in range(DRAWS):
        p = [rng.betavariate(1 + c[k + 1], 1 + c[k] - c[k + 1])
             for k in range(len(STEPS))]
        row = []
        for k in range(len(STEPS)):
            down = NET
            for j in range(k + 1, len(STEPS)):
                down *= p[j]
            row.append(c[k] * (1 - p[k]) * down)
        best = max(range(len(row)), key=lambda k: row[k])
        wins[best] += 1
        for k in range(len(STEPS)):
            pri[k].append(row[k])
    print("night {}: {}".format(name, ", ".join(
        "{:,}".format(x) for x in c)))
    print("  step       P(top)   priority   interval 2.5% to 97.5%")
    for k in range(len(STEPS)):
        print("  {:<9}  {:.3f}  {:>9,.0f}   {:,.0f} to {:,.0f}".format(
            STEPS[k], wins[k] / DRAWS, q(pri[k], 0.5),
            q(pri[k], 0.025), q(pri[k], 0.975)))
    top = max(range(len(STEPS)), key=lambda k: wins[k])
    ptop = wins[top] / DRAWS
    verdict = "CHANGE " + STEPS[top] if ptop >= PASS_P else "HOLD"
    print("  decision: {} (P(top) {:.3f} vs bar {:.2f})".format(
        verdict, ptop, PASS_P))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《夜间自治漏斗微创调优、多臂赌博机流量自动倾斜与零人工转化率自举母典》第 1 章「漏斗体检:六步 Beta 后验、夜间改动优先级与合规候选池」(版本 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}
}

本书其他章节结论