Timezone: »
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.
Author Information
Daniel Berend (Ben Gurion University)
Aryeh Kontorovich (Ben Gurion University)
More from the Same Authors
-
2021 Poster: Dimension-free empirical entropy estimation »
Doron Cohen · Aryeh Kontorovich · Aaron Koolyk · Geoffrey Wolfer -
2020 Poster: Learning discrete distributions with infinite support »
Doron Cohen · Aryeh Kontorovich · Geoffrey Wolfer -
2018 Poster: Learning convex polytopes with margin »
Lee-Ad Gottlieb · Eran Kaufman · Aryeh Kontorovich · Gabriel Nivasch -
2017 Poster: Nearest-Neighbor Sample Compression: Efficiency, Consistency, Infinite Dimensions »
Aryeh Kontorovich · Sivan Sabato · Roi Weiss -
2016 Poster: Active Nearest-Neighbor Learning in Metric Spaces »
Aryeh Kontorovich · Sivan Sabato · Ruth Urner -
2015 Poster: Mixing Time Estimation in Reversible Markov Chains from a Single Sample Path »
Daniel Hsu · Aryeh Kontorovich · Csaba Szepesvari -
2014 Poster: Near-optimal sample compression for nearest neighbors »
Lee-Ad Gottlieb · Aryeh Kontorovich · Pinhas Nisnevitch -
2013 Poster: Predictive PAC Learning and Process Decompositions »
Cosma Shalizi · Aryeh Kontorovich