Continuous Experts and the Binning Algorithm
We consider the design of online master algorithms for combining the predictions from a set of experts where the absolute loss of the master is to be close to the absolute loss of the best expert. For the case when the master must produce binary predictions, the Binomial Weighting algorithm is known to be optimal when the number of experts is large. It has remained an open problem how to design master algorithms based on binomial weights when the predictions of the master are allowed to be real valued. In this paper we provide such an algorithm and call it the Binning algorithm because it maintains experts in an array of bins. We show that this algorithm is optimal in a relaxed setting in which we consider experts as continuous quantities. The algorithm is efficient and near-optimal in the standard experts setting.
KeywordsSuccessor State Exponential Weight Continuous Quantity Absolute Loss Good Expert
Unable to display preview. Download preview PDF.
- [ACBFS95]Auer, P., Cesa-Bianchi, N., Freund, Y., Schapire, R.E.: Gambling in a rigged casino: the adversarial multi-armed bandit problem. In: Proceedings of the 36th Annual Symposium on Foundations of Computer Science, pp. 322–331. IEEE Computer Society Press, Los Alamitos (1995)Google Scholar
- [CBFHW96]Cesa-Bianchi, N., Freund, Y., Helmbold, D.P., Warmuth, M.K.: On-line prediction and conversion strategies. Machine Learning 25, 71–110 (1996)Google Scholar
- [LW94]Littlestone, N., Warmuth, M.K.: The weighted majority algorithm. Information and Computation 108(2), 212–261 (1994); An early version appeared in FOCS 1989Google Scholar
- [Vov90]Vovk, V.: Aggregating strategies. In: Proc. 3rd Annu. Workshop on Comput. Learning Theory, pp. 371–383. Morgan Kaufmann, San Francisco (1990)Google Scholar