What does Calibration and Collective Intelligence conclude, in numbers, about “The Statistics of Collective Intelligence”?

Answer: The crowd median Galton reported in 1907 was 1,207 lb (it should have been 1,208); the mean of 1,197 lb came later and exactly equals the corrected actual weight. The diversity prediction theorem is an identity: crowd error equals average individual error minus diversity; it guarantees that the crowd is no worse than the average individual, not that it beats the best one. With correlated errors, averaging removes only the uncorrelated part; once the correlation exceeds the expert's relative error, no number of people beats the expert. Social influence reduces diversity and raises confidence without improving accuracy. Moderately extremising the average of many probabilities can improve scores, because each person has only part of the information; how far to go depends on how much is shared. The next chapter reads this modern research beside the "temple calculation" of the Chinese military classics.

Scope of the numbers: This book is not counselling, medical or investment advice. Marked boxes separate published evidence, runnable Python calculations (16 programs, all checked), 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 only

shared error +0 lb: crowd mean 1197.2 lb; 2 of 787 individuals closer than it
   crowd error 0.04 = average error 5706.59 - diversity 5706.54  (difference 0.04)
shared error +30 lb: crowd mean 1230.4 lb; 244 of 787 individuals closer than it
   crowd error 1113.20 = average error 7159.50 - diversity 6046.30  (difference 1113.20)
identity on 10,000 random sets of guesses: largest discrepancy 3.6e-12

Key formula

\[\underbrace{(c - \theta)^2}_{\text{群体误差}} = \underbrace{\frac{1}{n}\sum_i (s_i - \theta)^2}_{\text{个人平均误差}} - \underbrace{\frac{1}{n}\sum_i (s_i - c)^2}_{\text{多样性}}.\]
Show the full program
# Diversity prediction theorem: crowd error = average individual error - diversity. 787
# simulated guesses (not Galton's data): truth 1,197 lb + shared error + private N(0,
# 75).
import random

rng = random.Random(1907)

def parts(s, theta):
    n = len(s)
    c = sum(s) / n
    crowd = (c - theta) ** 2
    avg = sum((x - theta) ** 2 for x in s) / n
    div = sum((x - c) ** 2 for x in s) / n
    return c, crowd, avg, div

if __name__ == "__main__":
    theta = 1197
    for shared in (0, 30):
        s = [theta + shared + rng.gauss(0, 75) for _ in range(787)]
        c, crowd, avg, div = parts(s, theta)
        beat = sum((x - theta) ** 2 < crowd for x in s)
        print(f"shared error {shared:+d} lb: crowd mean {c:.1f} lb;"
              f" {beat} of 787 individuals closer than it")
        print(f"   crowd error {crowd:.2f} = average error {avg:.2f} - diversity {div:.2f}"
              f"  (difference {avg - div:.2f})")
    worst = 0.0
    for _ in range(10000):
        n = rng.randint(2, 30)
        s = [rng.uniform(-100, 100) for _ in range(n)]
        _, crowd, avg, div = parts(s, rng.uniform(-50, 50))
        worst = max(worst, abs(crowd - (avg - div)))
    print(f"identity on 10,000 random sets of guesses: largest discrepancy {worst:.1e}")

Single source and citation

Fan, Y. (2026). Probabilistic Judgement, Brier-Score Calibration and the Statistics of Collective Intelligence (Version 1.0.0), Chapter 6: The Statistics of Collective Intelligence. 5D Library. https://doi.org/10.5281/zenodo.23764998

DOI: 10.5281/zenodo.23764998 · Read the monograph · 5DL-B-026 · v1.0.0 · CC-BY-NC-ND-4.0

BibTeX
@book{fan2026026,
  author    = {Fan, Yafu},
  title     = {Probabilistic Judgement, Brier-Score Calibration and the Statistics of Collective Intelligence},
  year      = {2026},
  publisher = {5D Library},
  edition   = {1.0.0},
  doi       = {10.5281/zenodo.23764998},
  url       = {https://doi.org/10.5281/zenodo.23764998}
}

Other chapter answers in this book