关于「隐马尔可夫模型与波动率体制」,《流动性体制、尾部相依与杠铃配置》给出的定量结论是什么?
结论:隐马尔可夫模型把市场描述为在几个看不见的体制之间切换。前向—后向算法给出滤波与平滑概率,鲍姆—韦尔奇算法估计参数,维特比算法给出最可能的状态路径。汉密尔顿 1989 年的原始模型切换的是 GNP 增长的均值,波动率体制是其推广。期望持续期 \(1/(1-p_{ii})\) 在无记忆假设下成立,但从十年数据估计的持续期误差很大。事后的平滑概率能把体制划分得相当清楚,实时的滤波概率则有滞后与误报;收益厚尾时,信息准则会多选出一个不存在的体制。体制识别因此是一种依赖假设的概率划分,而不是对市场状态的直接观测。
数据口径:危机来临时,资产会一起下跌吗?储备与安全垫要留多少才够?本书是教学与研究用的数学模型,不是投资建议。 作者要求证明「90% 短债 + 10% 期权」的杠铃配置随机占优;书中证明它不可能被股票占优,且在期权作废的概率高于股票跌破保底的概率时(本书模型即如此)也不可能一阶占优于股票,并在跳跃扩散模型的四种期权定价下显示它对股票、对 90/10 线性组合都不构成一阶或二阶占优,期权偏贵时反而被 90/10 线性组合二阶占优;CPPI 在乘数 6 时有 6.4% 的年份跌破保底线。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库
simulated 2500 days; true share of stress days 0.142 start A (calm first): log L -3360.1 after 22 iterations state 0: mean +0.030 sd 0.801 P(stay) 0.9933 duration 148.8 days state 1: mean +0.022 sd 1.890 P(stay) 0.9579 duration 23.8 days start B (stress first): log L -3360.1 after 22 iterations state 0: mean +0.022 sd 1.890 P(stay) 0.9579 duration 23.8 days state 1: mean +0.030 sd 0.801 P(stay) 0.9933 duration 148.8 days start C (nearly equal): log L -3360.1 after 20 iterations state 0: mean +0.030 sd 0.801 P(stay) 0.9933 duration 148.8 days state 1: mean +0.022 sd 1.890 P(stay) 0.9579 duration 23.8 days Viterbi path agrees with the true states on 95.4% of days; smoothed P > 0.5 on 96.0% true durations: calm 100 days, stress 33.3 days
核心公式
查看完整验算程序
# Two-state Gaussian HMM for daily returns (%), fitted by Baum-Welch (EM) with scaled
# forward-backward recursions and decoded by Viterbi. SIMULATED, ILLUSTRATIVE: calm
# (mean 0.04, sd 0.8), stress (mean -0.08, sd 2.0); P(stay) 0.99 and 0.97; 2,500 days.
import math, random
TRUE = dict(mu=[0.04, -0.08], sd=[0.8, 2.0], P=[[0.99, 0.01], [0.03, 0.97]], pi=[1, 0])
def simulate(T=2500, seed=1989, par=TRUE):
rng = random.Random(seed); s = 0 if rng.random() < par["pi"][0] else 1; x, z = [], []
for _ in range(T):
z.append(s); x.append(rng.gauss(par["mu"][s], par["sd"][s]))
s = s if rng.random() < par["P"][s][s] else 1 - s
return x, z
def dens(x, mu, sd):
return math.exp(-0.5 * ((x - mu) / sd) ** 2) / (sd * math.sqrt(2 * math.pi))
def forward(x, mu, sd, P, pi): # a[t][k] = P(state k | x_1..x_t)
K, a, c = len(mu), [], []
for t, xt in enumerate(x):
b = [dens(xt, mu[k], sd[k]) for k in range(K)]
f = ([pi[k] * b[k] for k in range(K)] if t == 0 else
[b[k] * sum(a[-1][j] * P[j][k] for j in range(K)) for k in range(K)])
s = sum(f); c.append(s); a.append([v / s for v in f])
return a, c # log L = sum of log c
def backward(x, mu, sd, P, c):
K, T = len(mu), len(x); be = [[1.0] * K for _ in range(T)]
for t in range(T - 2, -1, -1):
b = [dens(x[t + 1], mu[k], sd[k]) for k in range(K)]
be[t] = [sum(P[j][k] * b[k] * be[t + 1][k] for k in range(K)) / c[t + 1]
for j in range(K)]
return be
def fit(x, mu, sd, P, pi, tol=1e-7, max_iter=500):
K, T, old = len(mu), len(x), -1e300
for it in range(1, max_iter + 1):
a, c = forward(x, mu, sd, P, pi); be = backward(x, mu, sd, P, c)
ll = sum(math.log(v) for v in c)
g = [[a[t][k] * be[t][k] for k in range(K)] for t in range(T)]
xi = [[0.0] * K for _ in range(K)]
for t in range(T - 1):
b = [dens(x[t + 1], mu[k], sd[k]) for k in range(K)]
for j in range(K):
for k in range(K):
xi[j][k] += a[t][j] * P[j][k] * b[k] * be[t + 1][k] / c[t + 1]
P = [[xi[j][k] / sum(xi[j]) for k in range(K)] for j in range(K)]; pi = g[0][:]
for k in range(K):
w = sum(r[k] for r in g); mu[k] = sum(r[k] * v for r, v in zip(g, x)) / w
sd[k] = max(1e-3, math.sqrt(sum(r[k] * (v - mu[k]) ** 2
for r, v in zip(g, x)) / w))
if ll - old < tol:
break
old = ll
return dict(mu=mu, sd=sd, P=P, pi=pi, ll=ll, iters=it, gamma=g)
def viterbi(x, mu, sd, P, pi):
K = len(mu); lg = lambda v: math.log(max(v, 1e-300)); back = []
d = [lg(pi[k]) + lg(dens(x[0], mu[k], sd[k])) for k in range(K)]
for xt in x[1:]:
best = [max(range(K), key=lambda j: d[j] + lg(P[j][k])) for k in range(K)]
d = [d[best[k]] + lg(P[best[k]][k]) + lg(dens(xt, mu[k], sd[k]))
for k in range(K)]
back.append(best)
s = [max(range(K), key=lambda k: d[k])]
for best in reversed(back):
s.append(best[s[-1]])
return s[::-1]
if __name__ == "__main__":
x, z = simulate(); P0 = [[0.95, 0.05], [0.05, 0.95]]
print(f"simulated {len(x)} days; true share of stress days {sum(z) / len(z):.3f}")
for name, m0, s0 in (("A (calm first)", [0.0, 0.0], [0.5, 1.5]),
("B (stress first)", [0.0, 0.0], [1.5, 0.5]),
("C (nearly equal)", [0.01, -0.01], [1.0, 1.01])):
r = fit(x, m0, s0, P0, [0.5, 0.5])
print(f"start {name}: log L {r['ll']:.1f} after {r['iters']} iterations")
for k in range(2):
p = r["P"][k][k]
print(f" state {k}: mean {r['mu'][k]:+.3f} sd {r['sd'][k]:.3f}"
f" P(stay) {p:.4f} duration {1 / (1 - p):6.1f} days")
r = fit(x, [0.0, 0.0], [0.5, 1.5], P0, [0.5, 0.5])
path = viterbi(x, r["mu"], r["sd"], r["P"], r["pi"])
smooth = [1 if g[1] > 0.5 else 0 for g in r["gamma"]]
agree = lambda s: sum(p == q for p, q in zip(s, z)) / len(z)
print(f"Viterbi path agrees with the true states on {agree(path):.1%} of days;"
f" smoothed P > 0.5 on {agree(smooth):.1%}")
print("true durations: calm 100 days, stress 33.3 days")唯一数据源与引用
范雅福(Fan, Y.). (2026). 《宏观流动性体制转换、极值尾部相依与杠铃资产配置》第 1 章「隐马尔可夫模型与波动率体制」(版本 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.23828049
DOI: 10.5281/zenodo.23828049 · 阅读本章所在专著 · 5DL-B-040 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026040,
author = {Fan, Yafu},
title = {Macro-Liquidity Regime Switching, Extreme Tail Dependence and Barbell Asset Allocation},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
doi = {10.5281/zenodo.23828049},
url = {https://doi.org/10.5281/zenodo.23828049}
}