Abstract
We study the problem of deterministically predicting boolean valuesby combining the boolean predictions of several experts.Previous on-line algorithms for this problem predict with the weightedmajority of the experts' predictions.These algorithms give each expert an exponential weight βmwhere β is a constant in [0,1) and m is the number of mistakesmade by the expert in the past. We show that it is better to usesums of binomials as weights.In particular, we present a deterministic algorithmusing binomial weights that has a better worst case mistake bound than thebest deterministic algorithm using exponential weights.The binomial weights naturally arise from a version space argument.We also show how both exponential and binomial weighting schemes can beused to make prediction algorithms robust against noise.
Sign-in/Register to access full text options 
Talk to us
Join us for a 30 min session where you can share your feedback and ask us any queries you have
Schedule a callDisclaimer: All third-party content on this website/platform is and will remain the property of their respective owners and is provided on "as is" basis without any warranties, express or implied. Use of third-party content does not indicate any affiliation, sponsorship with or endorsement by them. Any references to third-party content is to identify the corresponding services and shall be considered fair use under The CopyrightLaw.
