Majority-of-Three is Optimal

We 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. --- Source: arXiv:2606.13614v1 - http://arxiv.org/abs/2606.13614v1 PDF: https://arxiv.org/pdf/2606.13614v1 O...