What does The 85% Rule and Deliberate Practice conclude, in numbers, about “Too Easy to Learn, Too Hard to Cope: The 85 % Rule”?

Answer: Wilson and colleagues proved that for binary-classification learners that learn by gradient descent, under Gaussian noise, the per-trial learning gain is greatest when precision times difficulty equals 1, that is at a training error rate of about 15.87 % (about 84.13 % correct); the correct formula is ½ erfc(1/√2), not ½(1 − 1/√2). The optimum is flat, it moves when the shape of the noise changes, and in simulated learners it also falls within a band. The result rests on assumptions (adjustable difficulty, binary decisions, a particular noise, gradient learning) and cannot be generalised into an "85 % law of all learning". Vygotsky's zone of proximal development is a related idea, but not the same theorem. The next chapter turns to "deliberate practice" in research on human expertise: how much of the difference between people can the quantity and quality of practice explain?

Scope of the numbers: Marked boxes separate evidence, runnable Python calculations (15 programs), classical sources and the author's hypotheses.

中文版

Data table

The numbers below are printed verbatim by the chapter's Python program and can be reproduced by running it. standard-library Python onlyprinted values that match the answer: 15.87, 84.13

noise      | optimal beta*Delta | optimal error rate | accuracy
Gaussian   |              1.000 |             0.1587 | 84.13%
Laplacian  |              1.000 |             0.1839 | 81.61%
Cauchy     |              1.000 |             0.2500 | 75.00%
closed form, Gaussian: 1/2 erfc(1/sqrt 2) = 0.15866
the formula 1/2 (1 - 1/sqrt 2)       = 0.14645  (not the result)
Gaussian noise: learning gain per trial relative to the optimum, beta = 1
  training error rate  1.00% (accuracy 99.00%): gain 25.6%
  training error rate  5.00% (accuracy 95.00%): gain 70.1%
  training error rate 10.00% (accuracy 90.00%): gain 92.9%
  training error rate 15.87% (accuracy 84.13%): gain 100.0%
  training error rate 20.00% (accuracy 80.00%): gain 97.4%
  training error rate 30.00% (accuracy 70.00%): gain 75.4%
  training error rate 40.00% (accuracy 60.00%): gain 40.5%
  training error rate 45.00% (accuracy 55.00%): gain 20.6%

Key formula

\[\mathrm{ER}(\beta, \Delta) = F(-\beta \Delta).\]
Show the full program
# Optimal training error rate (Wilson et al. 2019): ER = F(-beta Delta), gradient learning
# gain -dER/dbeta = Delta p(beta Delta); find the Delta that maximises it, for three noises.
import math
from statistics import NormalDist
N = NormalDist()

def best(F, p, beta=1.0):
    # brute-force search over difficulty Delta for the largest expected learning gain
    grid = [i / 10000 for i in range(1, 60001)]
    d = max(grid, key=lambda D: D * p(beta * D))
    return d, F(-beta * d), d * p(beta * d)

noises = {
    "Gaussian": (N.cdf, N.pdf),
    "Laplacian": (lambda x: 0.5 * math.exp(x) if x < 0 else 1 - 0.5 * math.exp(-x),
                  lambda x: 0.5 * math.exp(-abs(x))),
    "Cauchy": (lambda x: 0.5 + math.atan(x) / math.pi, lambda x: 1 / (math.pi * (1 + x * x))),
}
print("noise      | optimal beta*Delta | optimal error rate | accuracy")
for name, (F, p) in noises.items():
    d, er, _ = best(F, p)
    print(f"{name:10s} | {d:18.3f} | {er:18.4f} | {1 - er:.2%}")
print(f"closed form, Gaussian: 1/2 erfc(1/sqrt 2) = {0.5 * math.erfc(1 / math.sqrt(2)):.5f}")
wrong = 0.5 * (1 - 1 / math.sqrt(2))
print(f"the formula 1/2 (1 - 1/sqrt 2)       = {wrong:.5f}  (not the result)")

print("\nGaussian noise: learning gain per trial relative to the optimum, beta = 1")
g_star = best(N.cdf, N.pdf)[2]
for er in (0.01, 0.05, 0.10, 0.1587, 0.20, 0.30, 0.40, 0.45):
    D = -N.inv_cdf(er)
    g = D * N.pdf(D) / g_star
    print(f"  training error rate {er:6.2%} (accuracy {1 - er:6.2%}): gain {g:5.1%}")

Single source and citation

Fan, Y. (2026). The 85% Rule for Optimal Learning, Myelination Kinetics and Deliberate Practice (Version 1.0.0), Chapter 1: Too Easy to Learn, Too Hard to Cope: The 85 % Rule. 5D Library. https://doi.org/10.5281/zenodo.23761339

DOI: 10.5281/zenodo.23761339 · Read the monograph · 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}
}

Other chapter answers in this book