关于「护栏信源:八类草稿、三种裁决与规则条数的计数下界」,《护栏压缩的极限》给出的定量结论是什么?
结论:第一章建立八类草稿、三种裁决的示意信源与计数下界,三条规则保留 0.960 的裁决信息,两条只剩 0.629。
数据口径:本书把候选规则写成离散信源、把审稿裁决写成相关变量,用香农的率失真函数、布拉赫特与有本的迭代和提斯比等人的信息瓶颈逐条检验,并修正蓝图:原文没有「断崖」之说;最优曲线是凹的、连续的,越压越陡,示意信源上每删一比特的代价从 0.012 升到 0.592;断崖只在整数条数低于需要区分的裁决组数、解的结构跨过临界点、或用离散计分去量时出现;审稿人不犹豫时代价恰是直线。 书中参数为示意;全部计算由书中程序生成;本书是非个人化经营建议,不构成法律或内容合规意见,任何护栏规则的删并与上线须由主事者人工复核放行。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 0.629, 0.960
| partitions enumerated: 4140 | |||||
| k | log2 k | best I(T;Y) share | accuracy | I(X;T) | |
| 1 | 0.000 | 0.0000 | 0.000 | 0.458 | 0.000 |
| 2 | 1.000 | 0.4737 | 0.629 | 0.627 | 0.971 |
| 3 | 1.585 | 0.7234 | 0.960 | 0.805 | 1.559 |
| 4 | 2.000 | 0.7411 | 0.984 | 0.805 | 1.812 |
| 5 | 2.322 | 0.7483 | 0.993 | 0.805 | 2.075 |
| 6 | 2.585 | 0.7522 | 0.999 | 0.805 | 2.310 |
| 7 | 2.807 | 0.7529 | 0.999 | 0.805 | 2.443 |
| 8 | 3.000 | 0.7534 | 1.000 | 0.805 | 2.552 |
| fewest rules keeping 95% of I(X;Y): 3 | |||||
| best 3-rule grouping: [[0], [1, 2, 3], [4, 5, 6, 7]] |
查看完整验算程序
# Chapter 1. p12: every way to merge the eight draft kinds into k rules
# (all 4140 set partitions), the best decision information and accuracy
# each rule count can keep, and the counting bound I(X;T) <= log2 k.
# Source: the illustrative guardrail source of p11.
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 entropy(p):
return 0.0 - math.fsum(q * math.log2(q) for q in p if q > 0)
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
def merged(groups):
return [[math.fsum(PX[x] * PYX[x][y] for x in g) for y in range(3)]
for g in groups]
full = mutual([[a * b for b in r] for a, r in zip(PX, PYX)])
best = {}
count = 0
for part in partitions(list(range(8))):
count += 1
k = len(part)
pty = merged(part)
ity = mutual(pty)
acc = math.fsum(max(r) for r in pty)
ixt = entropy([math.fsum(r) for r in pty])
old = best.get(k)
if old is None or ity > old[0] + 1e-12:
best[k] = (ity, acc, ixt, part)
print("partitions enumerated: %d" % count)
print(" k log2 k best I(T;Y) share accuracy I(X;T)")
for k in range(1, 9):
ity, acc, ixt, part = best[k]
print("%2d %6.3f %7.4f %5.3f %6.3f %6.3f"
% (k, math.log2(k), ity, ity / full, acc, ixt))
need = min(k for k in best if best[k][0] >= 0.95 * full)
print("fewest rules keeping 95%% of I(X;Y): %d" % need)
print("best 3-rule grouping: %s" % best[3][3])唯一数据源与引用
范雅福(Fan, Y.). (2026). 《信息瓶颈率失真极值、双语专著到全局护栏的极限压缩比与判别力保真母典》第 1 章「护栏信源:八类草稿、三种裁决与规则条数的计数下界」(版本 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}
}