关于「主轴:断崖、凹曲线与确定性标签下的直线」,《护栏压缩的极限》给出的定量结论是什么?

结论:第二章量化断崖:份额断崖 0.331 是此前平均降幅的 41.7 倍,审稿人越犹豫比值越大,准确率断崖却越小。

数据口径:本书把候选规则写成离散信源、把审稿裁决写成相关变量,用香农的率失真函数、布拉赫特与有本的迭代和提斯比等人的信息瓶颈逐条检验,并修正蓝图:原文没有「断崖」之说;最优曲线是凹的、连续的,越压越陡,示意信源上每删一比特的代价从 0.012 升到 0.592;断崖只在整数条数低于需要区分的裁决组数、解的结构跨过临界点、或用离散计分去量时出现;审稿人不犹豫时代价恰是直线。 书中参数为示意;全部计算由书中程序生成;本书是非个人化经营建议,不构成法律或内容合规意见,任何护栏规则的删并与上线须由主事者人工复核放行。

English version

对照数据表

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

epsI(X;Y)share3share2cliffslideratioacc3acc2
0.00.75340.9600.6290.3310.00841.70.8050.678
0.10.58850.9640.6270.3370.00747.30.7580.644
0.20.45520.9670.6260.3410.00751.90.7110.609
0.30.34410.9690.6250.3440.00656.10.6630.575
0.50.17440.9730.6230.3500.00563.90.5690.506
0.80.02860.9760.6200.3560.00574.10.4280.402
查看完整验算程序
# Chapter 2. p22: how big is the cliff? Best hard k-rule groupings of the
# eight draft kinds (all 4140 partitions) as the reviewer's labels are
# blurred by noise eps: p(y|x) -> (1 - eps) p(y|x) + eps / 3.
# cliff = share of I(X;Y) lost going from 3 rules to 2;
# slide = mean share lost per rule removed from 8 rules down to 3.
# Source: the illustrative guardrail source of p11; eps is a scan.
import math

PX = [0.40, 0.18, 0.10, 0.07, 0.10, 0.06, 0.05, 0.04]
PYX = [[0.92, 0.06, 0.02], [0.25, 0.70, 0.05], [0.30, 0.55, 0.15],
       [0.10, 0.60, 0.30], [0.05, 0.15, 0.80], [0.03, 0.12, 0.85],
       [0.02, 0.08, 0.90], [0.01, 0.04, 0.95]]


def mutual(pxy):
    px = [math.fsum(r) for r in pxy]
    py = [math.fsum(c) for c in zip(*pxy)]
    return math.fsum(v * math.log2(v / (px[i] * py[j]))
                     for i, r in enumerate(pxy)
                     for j, v in enumerate(r) if v > 0)


def partitions(items):
    if not items:
        yield []
        return
    first, rest = items[0], items[1:]
    for part in partitions(rest):
        for i in range(len(part)):
            yield part[:i] + [[first] + part[i]] + part[i + 1:]
        yield [[first]] + part


PARTS = list(partitions(list(range(8))))


def curve(pyx):
    best_i, best_a = {}, {}
    for part in PARTS:
        k = len(part)
        pty = [[math.fsum(PX[x] * pyx[x][y] for x in g) for y in range(3)]
               for g in part]
        best_i[k] = max(best_i.get(k, 0.0), mutual(pty))
        best_a[k] = max(best_a.get(k, 0.0),
                        math.fsum(max(r) for r in pty))
    return best_i, best_a


print("  eps  I(X;Y)  share3  share2  cliff  slide  ratio  acc3   acc2")
for eps in [0.0, 0.1, 0.2, 0.3, 0.5, 0.8]:
    pyx = [[(1 - eps) * v + eps / 3 for v in r] for r in PYX]
    bi, ba = curve(pyx)
    full = bi[8]
    s3, s2 = bi[3] / full, bi[2] / full
    cliff = s3 - s2
    slide = (1.0 - s3) / 5
    print("%5.1f  %6.4f   %5.3f   %5.3f  %5.3f  %5.3f  %5.1f  %5.3f  %5.3f"
          % (eps, full, s3, s2, cliff, slide, cliff / slide,
             ba[3], ba[2]))

唯一数据源与引用

范雅福(Fan, Y.). (2026). 《信息瓶颈率失真极值、双语专著到全局护栏的极限压缩比与判别力保真母典》第 2 章「主轴:断崖、凹曲线与确定性标签下的直线」(版本 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}
}

本书其他章节结论