Publisher
Springer Berlin Heidelberg
Reference10 articles.
1. N. Cesa-Bianchi, Y. Freund, D. Haussler, D. P. Helmbold, R. E. Schapire, and M. K. Warmuth. How to use expert advice. Journal of the ACM, (44):427–485, 1997.
2. A. DeSantis, G. Markowski, and M. N. Weigman. Learning probabilistic prediction functions. In Proceedings of the 1988 Workshop on Computational Learning Theory, pages 312–328, 1988.
3. D. Haussler, J. Kivinen, and M. K. Warmuth. Tight worst-case loss bounds for predicting with expert advise. Technical Report UCSC-CRL-94-36, University of California at Santa Cruz, revised December 1994.
4. Y. Kalnishkan. Linear relations between square-loss and Kolmogorov complexity. In Proceedings of the Twelfth Annual Conference on Computational Learning Theory, pages 226–232. Association for Computing Machinery, 1999.
5. N. Littlestone and M. K. Warmuth. The weighted majority algorithm. Information and Computation, 108:212–261, 1994.
Cited by
4 articles.
订阅此论文施引文献
订阅此论文施引文献，注册后可以免费订阅5篇论文的施引文献，订阅后可以查看论文全部施引文献