关于「相变:最大相关、临界汇率与确定性退火」,《护栏压缩的极限》给出的定量结论是什么?
结论:第四章证明临界汇率等于最大相关平方的倒数,示意信源为 0.6844 与 1.4610,规则数阶梯式分裂而信息量连续。
数据口径:本书把候选规则写成离散信源、把审稿裁决写成相关变量,用香农的率失真函数、布拉赫特与有本的迭代和提斯比等人的信息瓶颈逐条检验,并修正蓝图:原文没有「断崖」之说;最优曲线是凹的、连续的,越压越陡,示意信源上每删一比特的代价从 0.012 升到 0.592;断崖只在整数条数低于需要区分的裁决组数、解的结构跨过临界点、或用离散计分去量时出现;审稿人不犹豫时代价恰是直线。 书中参数为示意;全部计算由书中程序生成;本书是非个人化经营建议,不构成法律或内容合规意见,任何护栏规则的删并与上线须由主事者人工复核放行。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 0.6844, 1.4610
| maximal correlation squared rho^2 = 0.6844 | ||||
| predicted critical beta 1/rho^2 | = 1.4610 | |||
| beta/beta_c | beta | I(X;T) | I(T;Y) | I(T;Y)/I(X;T) |
| 0.90 | 1.3149 | 0.000000 | 0.000000 | - |
| 0.97 | 1.4172 | 0.000000 | 0.000000 | - |
| 1.03 | 1.5049 | 0.121745 | 0.082409 | 0.6769 |
| 1.10 | 1.6072 | 0.282061 | 0.185752 | 0.6586 |
| 1.25 | 1.8263 | 0.467750 | 0.294915 | 0.6305 |
| 1.50 | 2.1916 | 0.610182 | 0.366900 | 0.6013 |
查看完整验算程序
# Chapter 4. p41: the first phase transition. Below a critical beta the
# best bottleneck says nothing (one rule for everything); above it a
# second rule appears. Expanding the IB Lagrangian to second order around
# the one-rule solution puts the threshold at beta_c = 1 / rho^2, where
# rho is the maximal correlation of X and Y, the second singular value of
# Q(x, y) = p(x, y) / sqrt(p(x) p(y)); rho^2 is also the slope of the
# bottleneck curve at the origin. Check: start two soft rules a hair
# away from the one-rule solution (1e-6) and see whether they split.
# 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]]
PY = [math.fsum(PX[x] * PYX[x][y] for x in range(8)) for y in range(3)]
def rho_squared():
q = [[PX[x] * PYX[x][y] / math.sqrt(PX[x] * PY[y]) for y in range(3)]
for x in range(8)]
m = [[math.fsum(q[x][i] * q[x][j] for x in range(8)) for j in range(3)]
for i in range(3)]
top = [math.sqrt(p) for p in PY]
m = [[m[i][j] - top[i] * top[j] for j in range(3)] for i in range(3)]
v = [1.0, -0.5, 0.25]
lam = 0.0
for _ in range(500):
w = [math.fsum(m[i][j] * v[j] for j in range(3)) for i in range(3)]
lam = math.sqrt(math.fsum(a * a for a in w))
v = [a / lam for a in w]
return lam
def kl(p, q):
return math.fsum(a * math.log(a / b) for a, b in zip(p, q) if a > 0)
def run(beta, q, iters=2000):
for _ in range(iters):
pt = [math.fsum(PX[x] * q[x][t] for x in range(8)) for t in range(2)]
pyt = [[math.fsum(PX[x] * q[x][t] * PYX[x][y] for x in range(8))
/ pt[t] for y in range(3)] for t in range(2)]
new = []
for x in range(8):
lg = [math.log(pt[t]) - beta * kl(PYX[x], pyt[t])
for t in range(2)]
m = max(lg)
w = [math.exp(v - m) for v in lg]
new.append([v / math.fsum(w) for v in w])
q = new
return q
def info(q):
pt = [math.fsum(PX[x] * q[x][t] for x in range(8)) for t in range(2)]
ixt = math.fsum(PX[x] * q[x][t] * math.log2(q[x][t] / pt[t])
for x in range(8) for t in range(2))
pty = [[math.fsum(PX[x] * q[x][t] * PYX[x][y] for x in range(8))
for y in range(3)] for t in range(2)]
ity = math.fsum(pty[t][y] * math.log2(pty[t][y] / (pt[t] * PY[y]))
for t in range(2) for y in range(3))
return max(ixt, 0.0), max(ity, 0.0)
r2 = rho_squared()
bc = 1.0 / r2
print("maximal correlation squared rho^2 = %.4f" % r2)
print("predicted critical beta 1/rho^2 = %.4f" % bc)
print(" beta/beta_c beta I(X;T) I(T;Y) I(T;Y)/I(X;T)")
for f in [0.90, 0.97, 1.03, 1.10, 1.25, 1.50]:
q = [[0.5 + 1e-6 * (x - 3.5), 0.5 - 1e-6 * (x - 3.5)]
for x in range(8)]
ixt, ity = info(run(f * bc, q, 6000))
ratio = " -" if ixt < 1e-7 else "%6.4f" % (ity / ixt)
print(" %4.2f %6.4f %8.6f %8.6f %s"
% (f, f * bc, ixt, ity, ratio))唯一数据源与引用
范雅福(Fan, Y.). (2026). 《信息瓶颈率失真极值、双语专著到全局护栏的极限压缩比与判别力保真母典》第 4 章「相变:最大相关、临界汇率与确定性退火」(版本 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}
}