关于「分级流量池与第一关的误杀」,《完播风险、推荐反馈与获客漏斗》给出的定量结论是什么?

结论:第二章模拟分级流量池:300 人样本下,即使各池观众相同,好视频也有 0.169 在第一关被拦下,观众差异下为 0.308 至 0.478;对冲噪声应重剪而不是重发。

数据口径:书中的威布尔参数、流量池规模、转化率、价格(令吉 RM)与封号概率都是示意模型参数,不是任何平台、账号或企业的数据;本书不描述任何平台的真实算法,也不构成营销或经营建议。 第二章模拟分级流量池:300 人样本下,即使各池观众相同,好视频也有 0.169 在第一关被拦下,观众差异下为 0.308 至 0.478;对冲噪声应重剪而不是重发。

English version

对照数据表

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

   audience draw s   good videos stopped   best videos reaching
                     at 300                1,000,000
               0.0                 0.169                  0.970
               0.2                 0.308                  0.525
               0.4                 0.478                  0.245
   (top 10 % threshold on true completion 0.378; 200 videos
   reach the last pool, so the share of best videos reaching
   it is also the share of the last pool that is best)
Reading: with 300 viewers the observed rate has a standard
error of about 0.025, comparable to the gap between a good
and an average video, so 0.169 of good videos stop at the
first gate even when every audience is alike. Audience
variation between pools raises the loss to 0.308 or 0.478,
and then only about a half or a quarter of the best videos
reach the top pool.
查看完整验算程序
# Chapter 2. p03: How often does a good video die in the first pool?
# A stylised traffic-pool ladder: every new video is shown to 300
# viewers; the top 10 % by observed completion go on to 3,000, the top
# 10 % of those to 50,000, the top 10 % of those to 1,000,000. True
# completion rates p across videos follow Beta(5, 15) (mean 0.25).
# Each pool's audience also differs from the last: on the logit scale
# the rate a pool sees is shifted by N(0, s), the "audience draw".
# Observed rate = binomial(N, p') / N, normal approximation, clipped.
# "Good" means a true rate in the top 10 % of all videos; "best" means
# the top 0.1 %, as many videos as there are places in the last pool.
# 200,000 videos, fixed seed. False negative = a good video stopped.
import math
import random

STAGES = [300, 3000, 50000]

def logit(p):
    return math.log(p / (1 - p))

def expit(x):
    return 1 / (1 + math.exp(-x))

def run(s, n=200000, seed=8):
    rng = random.Random(seed)
    vids = [rng.betavariate(5, 15) for _ in range(n)]
    alive = list(range(n))
    reached = [alive]
    for N in STAGES:
        obs = []
        for i in alive:
            p = expit(logit(vids[i]) + rng.gauss(0, s)) if s else vids[i]
            x = p + rng.gauss(0, 1) * math.sqrt(p * (1 - p) / N)
            obs.append((x, i))
        obs.sort(reverse=True)
        alive = [i for _, i in obs[:len(obs) // 10]]
        reached.append(alive)
    srt = sorted(vids, reverse=True)
    t10, t1 = srt[n // 10], srt[n // 1000]
    good10 = [i for i in range(n) if vids[i] > t10]
    good1 = [i for i in range(n) if vids[i] > t1]
    s1 = set(reached[1])
    s3 = set(reached[3])
    fn1 = sum(1 for i in good10 if i not in s1) / len(good10)
    top1_to_end = sum(1 for i in good1 if i in s3) / len(good1)
    prec_end = sum(1 for i in s3 if vids[i] > t1) / len(s3)
    return t10, fn1, top1_to_end, prec_end, len(s3)

if __name__ == "__main__":
    print("   audience draw s   good videos stopped   best videos reaching")
    print("                     at 300                1,000,000")
    for s in (0.0, 0.2, 0.4):
        t10, fn1, reach, prec, m = run(s)
        print("   {:15.1f} {:21.3f} {:22.3f}".format(s, fn1, reach))
    print("   (top 10 % threshold on true completion {:.3f}; {} videos"
          .format(t10, m))
    print("   reach the last pool, so the share of best videos reaching")
    print("   it is also the share of the last pool that is best)")
    print("\nReading: with 300 viewers the observed rate has a standard")
    print("error of about 0.025, comparable to the gap between a good")
    print("and an average video, so 0.169 of good videos stop at the")
    print("first gate even when every audience is alike. Audience")
    print("variation between pools raises the loss to 0.308 or 0.478,")
    print("and then only about a half or a quarter of the best videos")
    print("reach the top pool.")

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《短视频完播率风险函数、推荐反馈环与自动化获客漏斗》第 2 章「分级流量池与第一关的误杀」(版本 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.24090213

DOI: 10.5281/zenodo.24090213 · 阅读本章所在专著 · 5DL-B-081 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026081,
  author    = {Fan, Yafu},
  title     = {Short-Video Completion Hazards, Recommender Exploration Loops and Automated Acquisition Funnels},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  doi       = {10.5281/zenodo.24090213},
  url       = {https://doi.org/10.5281/zenodo.24090213}
}

本书其他章节结论