Related papers: Majority Voting and the Condorcet's Jury Theorem

Majority Voting and the Condorcet's Jury Theorem

URL: http://arxiv.org/abs/2002.03153v2
Date: Thu, 13 Feb 2020 21:40:12 GMT
Title: Majority Voting and the Condorcet's Jury Theorem
Authors: Hanan Shteingart, Eran Marom, Igor Itkin, Gil Shabat, Michael Kolomenkin, Moshe Salhov, and Liran Katzir
Abstract summary: "Condorcet's jury theorem" states that majorities are more likely to choose correctly when individual votes are often correct and independent. "Strength of Weak Learnability" (1990) describes a method for converting a weak learning algorithm into one that achieves arbitrarily high accuracy. We humbly want to offer a more publicly available simple derivation of the theorem.
Score: 3.3048031280378556
License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
Abstract: 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.

Related papers

Another quantum version of Sanov theorem [53.64687146666141]
We study how to extend Sanov theorem to the quantum setting. We propose another quantum version of Sanov theorem by considering the quantum analog of the empirical distribution.
arXiv Detail & Related papers (2024-07-26T07:46:30Z)
Lean-STaR: Learning to Interleave Thinking and Proving [53.923617816215774]
We present Lean-STaR, a framework for training language models to produce informal thoughts prior to each step of a proof. Lean-STaR achieves state-of-the-art results on the miniF2F-test benchmark within the Lean theorem proving environment.
arXiv Detail & Related papers (2024-07-14T01:43:07Z)
Machine Learning of the Prime Distribution [49.84018914962972]
We provide a theoretical argument explaining the experimental observations of Yang-Hui He about the learnability of primes. We also posit that the ErdHos-Kac law would very unlikely be discovered by current machine learning techniques.
arXiv Detail & Related papers (2024-03-19T09:47:54Z)
Machine learning and information theory concepts towards an AI Mathematician [77.63761356203105]
The current state-of-the-art in artificial intelligence is impressive, especially in terms of mastery of language, but not so much in terms of mathematical reasoning. This essay builds on the idea that current deep learning mostly succeeds at system 1 abilities. It takes an information-theoretical posture to ask questions about what constitutes an interesting mathematical statement.
arXiv Detail & Related papers (2024-03-07T15:12:06Z)
TheoremQA: A Theorem-driven Question Answering dataset [100.39878559382694]
GPT-4's capabilities to solve these problems are unparalleled, achieving an accuracy of 51% with Program-of-Thoughts Prompting. TheoremQA is curated by domain experts containing 800 high-quality questions covering 350 theorems.
arXiv Detail & Related papers (2023-05-21T17:51:35Z)
Reassessing the strength of a class of Wigner's friend no-go theorems [0.0]
Two recent theorems try to impose novel, non-trivial constraints on the possible nature of physical reality. I conduct a thorough analysis of these theorems and show that they suffer from a list of shortcomings that question their validity and limit their strength. I conclude that the "no-go theorem for observer-independent facts" and the "Local Friendliness no-go theorem" fail to impose significant constraints on the nature of physical reality.
arXiv Detail & Related papers (2022-04-26T00:56:36Z)
On the paper "Quantum theory cannot consistently describe the use of itself" [0.0]
We prove that either quantum theory cannot be universally applied, even to macroscopic systems. We give a concise description of the paper's result, and expose a detail in the proof.
arXiv Detail & Related papers (2021-06-14T11:33:55Z)
Learning to Guide a Saturation-Based Theorem Prover [9.228237801323042]
TRAIL is a deep learning-based approach to theorem proving that characterizes core elements of saturation-based theorem proving within a neural framework. To the best of our knowledge, TRAIL is the first reinforcement learning-based approach to exceed the performance of a state-of-the-art traditional theorem prover.
arXiv Detail & Related papers (2021-06-07T18:35:57Z)
Three computational models and its equivalence [0.0]
The study of computability has its origin in Hilbert's conference of 1900, where an adjacent question, is to give a precise description of the notion of algorithm. We intend to fill this gap presenting the proof in a modern way, without forgetting the mathematical details.
arXiv Detail & Related papers (2020-10-26T05:55:19Z)
Learning to Prove Theorems by Learning to Generate Theorems [71.46963489866596]
We learn a neural generator that automatically synthesizes theorems and proofs for the purpose of training a theorem prover. Experiments on real-world tasks demonstrate that synthetic data from our approach improves the theorem prover.
arXiv Detail & Related papers (2020-02-17T16:06:02Z)

This list is automatically generated from the titles and abstracts of the papers in this site.