DeepAI AI Chat
Log In Sign Up

Majority Voting and the Condorcet's Jury Theorem

by   Hanan Shteingart, et al.

There is a striking relationship between a three hundred years old Political Science theorem named "Condorcet's jury theorem" (1785), which states that majorities are more likely to choose correctly when individual votes are often correct and independent, and a modern Machine Learning concept called "Strength of Weak Learnability" (1990), which describes a method for converting a weak learning algorithm into one that achieves arbitrarily high accuracy and stands in the basis of Ensemble Learning. Albeit the intuitive statement of Condorcet's theorem, we could not find a compact and simple rigorous mathematical proof of the theorem neither in classical handbooks of Machine Learning nor in published papers. By all means we do not claim to discover or reinvent a theory nor a result. We humbly want to offer a more publicly available simple derivation of the theorem. We will find joy in seeing more teachers of introduction-to-machine-learning courses use the proof we provide here as an exercise to explain the motivation of ensemble learning.


page 1

page 2

page 3

page 4


Formalizing May's Theorem

This report presents a formalization of May's theorem in the proof assis...

A formalisation of Gallagher's ergodic theorem

Gallagher's ergodic theorem is a result in metric number theory. It stat...

Gács-Kučera's Theorem Revisited by Levin

Leonid Levin (, p.7) published a new (and ver...

A Constructive Formalization of the Weak Perfect Graph Theorem

The Perfect Graph Theorems are important results in graph theory describ...

Metrizing Weak Convergence with Maximum Mean Discrepancies

Theorem 12 of Simon-Gabriel Schölkopf (JMLR, 2018) seemed to close a...

A solution to Ringel's circle problem

We construct families of circles in the plane such that their tangency g...

Skolem Meets Schanuel

The celebrated Skolem-Mahler-Lech Theorem states that the set of zeros o...