Majority-of-Three is Optimal
The paper proves that the majority vote of three independent consistent classifiers is an optimal learner in the realizable PAC setting.
This paper simplifies the proof of optimality for voting learners, making it easier to understand and analyze.
Before reading this…
To understand this paper, make sure you know these concepts first:
- PAC settingfind papers →
- Consistent classifiersfind papers →
Abstract
More Like ThisWe give a short proof that the majority vote of three independent consistent classifiers is an optimal learner in the realizable PAC setting. This proves optimality for the simplest voting scheme, while simplifying both the algorithmic structure and the probabilistic analysis of previous voting learners, including the algorithm of S. Hanneke and the analysis of bagging by K. Green Larsen.