2014
NIPS
NeurIPS 2014
Consistency of weighted majority votes
Abstract
We revisit from a statistical learning perspective the classical decision-theoretic problem of weighted expert voting. In particular, we examine the consistency (both asymptotic and finitary) of the optimal Nitzan-Paroush weighted majority and related rules. In the case of known expert competence levels, we give sharp error estimates for the optimal rule. When the competence levels are unknown, they must be empirically estimated. We provide frequentist and Bayesian analyses for this situation. Some of our proof techniques are non-standard and may be of independent interest. The bounds we derive are nearly optimal, and several challenging open problems are posed. Experimental results are provided to illustrate the theory.
🧭
Keyword Pioneer
— expert voting
🐝
Cross-Pollinator
— Artificial Intelligence, Computer Science, Computer Vision, Data Science & Analytics, Healthcare & Medicine, Interdisciplinary, Knowledge & Reasoning, Machine Learning, Mathematics & Optimization, Natural Language Processing, Reinforcement Learning, Security & Privacy
🌉
Interdisciplinary Bridge
— Machine Learning and Mathematics & Optimization
🐣
Hot Topic Early Bird
— statistical learning
Authors
Topics
Machine Learning > Core Methods > Classification
Machine Learning > Optimization & Theory > Statistical Learning
Machine Learning > Optimization & Theory > Statistics
Machine Learning > Learning Types > Ensemble Learning
Mathematics & Optimization > Optimization > Game Theory
Machine Learning > Core Methods > Ensemble Methods
Machine Learning > Learning Types > Classification