Littlestone & Warmuth's 1989 Weighted Majority Algorithm is an adversarial online-prediction method, mechanically unrelated to Condorcet's probabilistic jury theorem

machine-learning-theoryonline-learningboostingvoting-theoryhistory-of-computer-sciencemultiple-discovery

Nick Littlestone and Manfred K. Warmuth's 1989 FOCS paper, "The Weighted Majority Algorithm," defines a worst-case online-prediction procedure: a pool of experts is tracked with multiplicative weight updates, weights collapse toward experts that err, and the algorithm proves a provable bound on its own total mistakes — all under an adversarial model that makes zero probabilistic assumptions about the experts or the environment.

This is the same three-word phrase — "weighted majority" — that names Condorcet's 1785 jury theorem, but a different mathematical object entirely. Condorcet's theorem reasons probabilistically about independent voters each more likely than not to be correct, and proves that a majority vote's accuracy rises with group size. Littlestone and Warmuth's algorithm makes no such assumption and proves no such thing; it is a mistake-bound guarantee for prediction under adversarial, not probabilistic, conditions. The two results share a name and a superficial shape (combine multiple opinions, weight them, take the majority) and nothing else — no shared proof technique, no shared problem statement, no citation link between them found in this vault's reading so far. A third, unrelated 2025 mechanism uses the identical phrase again, independently of both.

Unlike Condorcet's relationship to later "weighted majority voting" schemes — cited by none of them, as far as this vault's reading has found — this algorithm has a direct, explicitly acknowledged mathematical heir: Freund & Schapire's AdaBoost.