Preliminary versionA preliminary version of these results was presented in: Nicoló Cesa-Bianchi, Yoav Freund, David P. Helmbold, David Haussler, Robert E. Schapire, and Manfred K. Warmuth. How to use expert advice (extended abstract). In Proceedings of the Twenty-Fifth Annual ACM Symposium on the Theory of Computing, pages 382-391, San Diego, California, 16-18 May 1993.
Categories and Subject Descriptors: I.2.1 [Artificial Intelligence]: Applications and Expert Systems; I.2. [Artificial Intelligence] -- automatic analysis of algorithms; I.2.6 [Artificial Intelligence]: Learning
General Terms: Algorithms
Selected papers that cite this one
- V. Vovk. A game of prediction with expert advice. Journal of Computer and System Sciences, 56(2):153-173, April 1998.
Selected references
- Anselm Blumer, Andrzej Ehrenfeucht, David Haussler, and Manfred K. Warmuth. Learnability and the Vapnik-Chervonenkis dimension. Journal of the ACM, 36(4):929-965, October 1989.
- Thomas H. Chung. Approximate methods for sequential decision making using expert advice. In Proceedings of the Seventh Annual ACM Conference on Computational Learning Theory, pages 183-189, New Brunswick, New Jersey, 12-15 July 1994. ACM Press.
- Amos Fiat, Dean P. Foster, Howard Karloff, Yuval Rabani, Yiftach Ravid, and Sundar Vishwanathan. Competitive algorithms for layered graph traversal. In 32nd Annual Symposium on Foundations of Computer Science, pages 288-297, San Juan, Puerto Rico, 1-4 October 1991. IEEE.
- Amos Fiat, Richard M. Karp, Michael Luby, Lyle A. McGeoch, Daniel D. Sleator, and Neal E. Young. Competitive paging algorithms. Journal of Algorithms, 12(4):685-699, December 1991.
- Amos Fiat, Yuval Rabani, and Yiftach Ravid. Competitive k-server algorithms. Journal of Computer and System Sciences, 48(3):410-428, June 1994.
- David Haussler, Michael Kearns, Nick Littlestone, and Manfred K. Warmuth. Equivalence of models for polynomial learnability. Information and Computation, 95(2):129-161, December 1991.
- D. Haussler, N. Littlestone, and M. K. Warmuth. Predicting {0,1}-functions on randomly drawn points. Information and Computation, 115(2):248-292, December 1994.
- David P. Helmbold and Manfred K. Warmuth. On weak learning. Journal of Computer and System Sciences, 50(3):551-573, June 1995.
- Michael J. Kearns and Robert E. Schapire. Efficient distribution-free learning of probabilistic concepts. Journal of Computer and System Sciences, 48(3):464-497, June 1994.
- Nick Littlestone and Manfred K. Warmuth. The weighted majority algorithm. Information and Computation, 108(2):212-261, 1 February 1994.
- V. G. Vovk. Universal forecasting algorithms. Information and Computation, 96(2):245-277, February 1992.
- Kenji Yamanishi. A loss bound model for on-line stochastic prediction algorithms. Information and Computation, 119(1):39-54, 15 May 1995.