关于「实证闭环:每卷一条压缩召回曲线、拐点小工具与预注册方案」,《护栏压缩的极限》给出的定量结论是什么?
结论:第八章给出每卷一条压缩召回曲线的闭环、蒸馏小工具「规则压缩拐点计算器」与配对预注册方案,准确率差较大时每次检验 75 到 103 份稿件。书中以标注框区分已发表的证据、可运行的 Python 计算(20 段程序)、原典与作者的假说。
数据口径:本书把候选规则写成离散信源、把审稿裁决写成相关变量,用香农的率失真函数、布拉赫特与有本的迭代和提斯比等人的信息瓶颈逐条检验,并修正蓝图:原文没有「断崖」之说;最优曲线是凹的、连续的,越压越陡,示意信源上每删一比特的代价从 0.012 升到 0.592;断崖只在整数条数低于需要区分的裁决组数、解的结构跨过临界点、或用离散计分去量时出现;审稿人不犹豫时代价恰是直线。 书中参数为示意;全部计算由书中程序生成;本书是非个人化经营建议,不构成法律或内容合规意见,任何护栏规则的删并与上线须由主事者人工复核放行。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 103, 75
| difference | discordant | n (power 0.80) | n (power 0.90) |
| 0.127 | 0.20 | 75 | 103 |
| 0.127 | 0.30 | 113 | 156 |
| 0.050 | 0.10 | 246 | 339 |
| 0.050 | 0.20 | 493 | 682 |
| 0.020 | 0.05 | 771 | 1067 |
| 0.020 | 0.10 | 1544 | 2138 |
| block recall test (drop 0.05, discordant 0.08): | |||
| block share 0.100 -> | 196 block drafts, | 1960 drafts in all | |
| block share 0.267 -> | 196 block drafts, | 735 drafts in all | |
| block share 0.400 -> | 196 block drafts, | 490 drafts in all |
查看完整验算程序
# Chapter 8. p82: how many held-out drafts the pre-registered test needs.
# Two rule sets judge the same drafts: the knee set and the set with one
# rule fewer. Outcome per draft: does each set reach the reviewer's
# decision? Paired binary outcomes, McNemar-type sample size (normal
# approximation, Connor 1987 form): n = (z_a sqrt(d) + z_b sqrt(d - e^2))
# ^ 2 / e^2, d = share of discordant drafts, e = difference in accuracy.
# One-sided alpha 0.05, power 0.80 and 0.90. For recall, n counts drafts
# that should be blocked; divide by their share to get all drafts.
import math
from statistics import NormalDist
Z = NormalDist()
def paired_n(e, d, alpha=0.05, power=0.80):
za, zb = Z.inv_cdf(1 - alpha), Z.inv_cdf(power)
return math.ceil((za * math.sqrt(d) + zb * math.sqrt(d - e * e)) ** 2
/ (e * e))
print("difference discordant n (power 0.80) n (power 0.90)")
for e, d in [(0.127, 0.20), (0.127, 0.30), (0.05, 0.10), (0.05, 0.20),
(0.02, 0.05), (0.02, 0.10)]:
print(" %5.3f %4.2f %5d %5d"
% (e, d, paired_n(e, d), paired_n(e, d, power=0.90)))
print("block recall test (drop 0.05, discordant 0.08):")
n_block = paired_n(0.05, 0.08)
for share in [0.10, 0.267, 0.40]:
print(" block share %5.3f -> %4d block drafts, %5d drafts in all"
% (share, n_block, math.ceil(n_block / share)))唯一数据源与引用
范雅福(Fan, Y.). (2026). 《信息瓶颈率失真极值、双语专著到全局护栏的极限压缩比与判别力保真母典》第 8 章「实证闭环:每卷一条压缩召回曲线、拐点小工具与预注册方案」(版本 1.0.0). 5D Library. DOI 待发布
DOI 待发布 · 专著页正式发布后上线(本站暂无专著页) · 5DL-B-250 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026250,
author = {Fan, Yafu},
title = {The Information Bottleneck and Rate-Distortion Limits: How Far a Bilingual Monograph Can Be Compressed into Guardrails before Discriminative Power Falls Away},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
note = {DOI pending}
}