关于「交错与集中:必要难度」,《85% 法则与刻意练习》给出的定量结论是什么?
结论:比约克的「必要难度」区分了练习时的表现与长期的学习。罗勒与泰勒的小样本实验中,集中练习时 89% 对交错 60%,一周后却是 20% 对 63%。元分析显示交错学习的总体效应为 g = 0.42,但依材料而异:绘画最大,数学中等,词语上集中反而更好;类别越相似,交错越有利。线索竞争模型显示,交错效应出现在误差驱动的学习者身上,不出现在理想贝叶斯学习者身上。下一章讨论练习的另一个要素:反馈的时机与粒度。
数据口径:书中以标注框区分证据、可运行的 Python 计算(15 段程序)、原典与作者的假说。
对照数据表
下表数字由本章 Python 程序原样打印,可重新运行复现。 程序只用 Python 标准库与结论吻合的打印值: 63
| 400 simulated learners per cell; P = practice accuracy, T = test accuracy; | |
| B = blocked, M = mixed (interleaved) practice | |
| shared | ideal Bayes B: P / T M: P / T | error-driven B: P / T M: P / T | |
| 0/12 | | 92% / 93% 88% / 93% | 90% / 90% 84% / 91% |
| 4/12 | | 84% / 86% 80% / 86% | 84% / 77% 74% / 82% |
| 8/12 | | 68% / 70% 63% / 69% | 79% / 52% 56% / 65% |
查看完整验算程序
# Blocked vs interleaved (author's model, illustrative). 4 types x 12-feature prototypes, 15 %
# flips; "shared" features make types alike. Surface cue = previous problem's type. Ideal Bayes
# (naive Bayes) vs error-driven delta rule where cues compete. 64 practice, 40 test problems.
import math, random
K, T, FLIP, ETA = 12, 4, 0.15, 0.25
def prototypes(shared, rng):
base = [rng.randint(0, 1) for _ in range(K)]
return [[b ^ (j >= shared and (j - shared) % T == k) for j, b in enumerate(base)]
for k in range(T)]
def problem(protos, k, rng):
return [b ^ (rng.random() < FLIP) for b in protos[k]]
def softmax(z):
m = max(z)
e = [math.exp(v - m) for v in z]
return [v / sum(e) for v in e]
def bayes_probs(counts, x):
return softmax([sum(math.log((c[j] + 1) / (n + 2) if b else 1 - (c[j] + 1) / (n + 2))
for j, b in enumerate(x)) for n, c in counts])
def inputs(prev, x):
return [1.0 if prev == k else 0.0 for k in range(T)] + [1.0 if b else -1.0 for b in x]
def session(order, protos, rng, learner, train=True):
hits, prev = 0, None
for k in order:
x = problem(protos, k, rng)
if learner["kind"] == "bayes":
p = bayes_probs(learner["counts"], x)
else:
u = inputs(prev, x)
p = softmax([sum(w * v for w, v in zip(W, u)) for W in learner["W"]])
hits += max(range(T), key=lambda j: p[j]) == k
if train and learner["kind"] == "bayes":
n, c = learner["counts"][k]
learner["counts"][k] = (n + 1, [cj + b for cj, b in zip(c, x)])
elif train:
for j in range(T):
err = (j == k) - p[j]
learner["W"][j] = [w + ETA * err * v for w, v in zip(learner["W"][j], u)]
prev = k
return hits / len(order)
def run(blocked, shared, seed):
rng = random.Random(seed)
protos = prototypes(shared, rng)
order = [k for k in range(T) for _ in range(8)] * 2
if not blocked:
rng.shuffle(order)
test = [rng.randrange(T) for _ in range(40)]
out = []
for kind in ("bayes", "delta"):
L = {"kind": kind, "counts": [(0, [0] * K) for _ in range(T)],
"W": [[0.0] * (T + K) for _ in range(T)]}
out += [session(order, protos, rng, L), session(test, protos, rng, L, train=False)]
return out
if __name__ == "__main__":
print("400 simulated learners per cell; P = practice accuracy, T = test accuracy;")
print("B = blocked, M = mixed (interleaved) practice")
print("shared | ideal Bayes B: P / T M: P / T | error-driven B: P / T M: P / T")
for shared in (0, 4, 8):
res = {b: [0.0] * 4 for b in (True, False)}
for s in range(400):
for b in (True, False):
res[b] = [a + v / 400 for a, v in zip(res[b], run(b, shared, s))]
B, M = res[True], res[False]
print(f"{shared:2d}/12 | {B[0]:4.0%} / {B[1]:4.0%} {M[0]:4.0%} / "
f"{M[1]:4.0%} | {B[2]:4.0%} / {B[3]:4.0%} {M[2]:4.0%} / {M[3]:4.0%}")唯一数据源与引用
范雅福(Fan, Y.). (2026). 《学习的85%最优错误率定律、髓鞘化动力学与刻意练习》第 5 章「交错与集中:必要难度」(版本 1.0.0). 5D Library. https://doi.org/10.5281/zenodo.23761339
DOI: 10.5281/zenodo.23761339 · 阅读本章所在专著 · 5DL-B-023 · v1.0.0 · CC-BY-NC-ND-4.0
BibTeX
@book{fan2026023,
author = {Fan, Yafu},
title = {The 85% Rule for Optimal Learning, Myelination Kinetics and Deliberate Practice},
year = {2026},
publisher = {5D Library},
edition = {1.0.0},
doi = {10.5281/zenodo.23761339},
url = {https://doi.org/10.5281/zenodo.23761339}
}