关于「反馈环、马太效应与可被「刷」的指标」,《完播风险、推荐反馈与获客漏斗》给出的定量结论是什么?
结论:第三章说明推荐反馈把运气放大为差距(点赞基尼系数从 0.214 升到 0.964),并证明完播率与观看时长都能被剪辑长度刷高:留存力最弱的 7 秒视频完播率最高(0.544),按同时长基线归一才能恢复真实次序。
数据口径:书中的威布尔参数、流量池规模、转化率、价格(令吉 RM)与封号概率都是示意模型参数,不是任何平台、账号或企业的数据;本书不描述任何平台的真实算法,也不构成营销或经营建议。 第二章模拟分级流量池:300 人样本下,即使各池观众相同,好视频也有 0.169 在第一关被拦下,观众差异下为 0.308 至 0.478;对冲噪声应重剪而不是重发。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 0.214, 0.964
b Gini top share rank corr best video first 0.0 0.214 0.035 0.970 4 of 8 1.0 0.702 0.186 0.794 1 of 8 1.5 0.964 0.853 0.621 2 of 8 Reading: without feedback, likes track appeal closely (rank correlation 0.970), and the best video wins in half the worlds only because its neighbours are almost as good. With feedback, early luck is amplified: inequality rises, the link between appeal and success weakens, and one video can take most of the likes. Past view counts measure luck as well as quality.
查看完整验算程序
# Chapter 3. p05: The Matthew effect in a recommender feedback loop.
# 48 videos with fixed appeal q_i spread evenly from 0.2 to 0.8. Each
# of 10,000 viewers is shown one video, chosen with probability
# proportional to (likes_i + 1)^b, and likes it with chance q_i.
# b = 0 is a world with no feedback (independent exposure); b = 1 is a
# Polya urn; b = 1.5 lets popularity compound. For each b we run eight
# independent worlds with the same videos (as Salganik et al. did with
# songs) and report: the Gini coefficient of likes, the share of likes
# held by the top video, the rank correlation of likes with appeal,
# and in how many of the eight worlds the best video came first.
import random
def gini(xs):
xs = sorted(xs)
n = len(xs)
cum = sum((i + 1) * x for i, x in enumerate(xs))
return (2 * cum) / (n * sum(xs)) - (n + 1) / n
def ranks(xs):
order = sorted(range(len(xs)), key=lambda i: xs[i])
r = [0.0] * len(xs)
for pos, i in enumerate(order):
r[i] = float(pos)
return r
def spearman(a, b):
ra, rb = ranks(a), ranks(b)
n = len(a)
ma, mb = sum(ra) / n, sum(rb) / n
cov = sum((x - ma) * (y - mb) for x, y in zip(ra, rb))
va = sum((x - ma) ** 2 for x in ra)
vb = sum((y - mb) ** 2 for y in rb)
return cov / (va * vb) ** 0.5
def world(b, rng, n=48, viewers=10000):
q = [0.2 + 0.6 * i / (n - 1) for i in range(n)]
likes = [0] * n
for _ in range(viewers):
w = [(x + 1) ** b for x in likes]
i = rng.choices(range(n), weights=w)[0]
if rng.random() < q[i]:
likes[i] += 1
return q, likes
if __name__ == "__main__":
rng = random.Random(1968)
print(" b Gini top share rank corr best video first")
for b in (0.0, 1.0, 1.5):
g = t = c = 0.0
wins = 0
for _ in range(8):
q, likes = world(b, rng)
g += gini(likes) / 8
t += max(likes) / sum(likes) / 8
c += spearman(q, likes) / 8
wins += likes.index(max(likes)) == len(q) - 1
print(" {:3.1f} {:8.3f} {:10.3f} {:11.3f} {:10d} of 8".format(
b, g, t, c, wins))
print("\nReading: without feedback, likes track appeal closely")
print("(rank correlation 0.970), and the best video wins in half the")
print("worlds only because its neighbours are almost as good. With")
print("feedback, early luck is amplified: inequality rises, the link")
print("between appeal and success weakens, and one video can take")
print("most of the likes. Past view counts measure luck as well as")
print("quality.")唯一数据源与引用
范雅福(Fan, Y.). (2026). 《短视频完播率风险函数、推荐反馈环与自动化获客漏斗》第 3 章「反馈环、马太效应与可被「刷」的指标」(版本 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}
}