{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,19]],"date-time":"2025-03-19T13:32:08Z","timestamp":1742391128323},"publisher-location":"Berlin, Heidelberg","reference-count":18,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540423430"},{"type":"electronic","value":"9783540445814"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44581-1_3","type":"book-chapter","created":{"date-parts":[[2007,8,10]],"date-time":"2007-08-10T06:13:49Z","timestamp":1186726429000},"page":"31-47","source":"Crossref","is-referenced-by-count":3,"title":["Tracking a Small Set of Experts by Mixing Past Posteriors"],"prefix":"10.1007","author":[{"given":"Olivier","family":"Bousquet","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Manfred K.","family":"Warmuth","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,9,13]]},"reference":[{"key":"3_CR1","unstructured":"P. Auer, N. Cesa-Bianchi, and C. Gentile. Adaptive and self-confident on-line learning algorithms. NeuroCOLT Technical Report NC-TR-00-083, 2000. An extended abstract appeared in Proc. 13th Ann. Conf. Computational Learning Theory."},{"issue":"2","key":"3_CR2","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1023\/A:1007472513967","volume":"32","author":"P. Auer","year":"1998","unstructured":"P. Auer and M.K. Warmuth. Tracking the best disjunction. Journal of Machine Learning, 32(2):127\u2013150, August 1998. Special issue on concept drift.","journal-title":"Journal of Machine Learning"},{"issue":"3","key":"3_CR3","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1145\/258128.258179","volume":"44","author":"N. Cesa-Bianchi","year":"1997","unstructured":"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(3):427\u2013485, 1997.","journal-title":"Journal of the ACM"},{"issue":"1\/2","key":"3_CR4","doi-asserted-by":"publisher","first-page":"112","DOI":"10.1007\/PL00013825","volume":"22","author":"N. Cesa-Bianchi","year":"1998","unstructured":"N. Cesa-Bianchi, D.P. Helmbold, and S. Panizza. On Bayes methods for on-line boolean prediction Algorithmica, 22(1\/2):112\u2013137, 1998.","journal-title":"Algorithmica"},{"key":"3_CR5","unstructured":"Y. Freund. Private Communication, 2000. Also posted on \n                  http:\/\/www.learning-theory.org\/\n                  \n                ."},{"key":"3_CR6","unstructured":"M.R. Garey and D.J. Johnson. Computers and intractability: a guide to the theory of NP-completeness. W.H. Freeman, 1979."},{"issue":"2","key":"3_CR7","doi-asserted-by":"publisher","first-page":"1906","DOI":"10.1109\/18.705569","volume":"44","author":"D. Haussler","year":"1998","unstructured":"D. Haussler, J. Kivinen, and M.K. Warmuth. Sequential prediction of individual sequences under general loss functions. IEEE Transactions on Information Theory, 44(2):1906\u20131925, September 1998.","journal-title":"IEEE Transactions on Information Theory"},{"key":"3_CR8","unstructured":"M. Herbster. Private Communication, 1998."},{"issue":"2","key":"3_CR9","doi-asserted-by":"publisher","first-page":"151","DOI":"10.1023\/A:1007424614876","volume":"32","author":"M. Herbster","year":"1998","unstructured":"M. Herbster and M.K. Warmuth. Tracking the best expert. Journal of Machine Learning, 32(2):151\u2013178, August 1998. Special issue on concept drift.","journal-title":"Journal of Machine Learning"},{"key":"3_CR10","first-page":"24","volume-title":"Proc. 11th Annu. Conf. on Comput. Learning Theory","author":"M. Herbster","year":"1998","unstructured":"M. Herbster and M.K. Warmuth. Tracking the best regressor. In Proc. 11th Annu. Conf. on Comput. Learning Theory, pages 24\u201331. ACM Press, New York, NY, 1998."},{"key":"3_CR11","doi-asserted-by":"crossref","unstructured":"J. Kivinen and M.K. Warmuth. Averaging expert predictions. In Paul Fischer and Hans Ulrich Simon, editors, Computational Learning Theory: 4th European Conference (EuroCOLT\u2019 99), pages 153\u2013167, Berlin, March 1999. Springer.","DOI":"10.1007\/3-540-49097-3_13"},{"issue":"2","key":"3_CR12","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1006\/inco.1994.1009","volume":"108","author":"N. Littlestone","year":"1994","unstructured":"N. Littlestone and M.K. Warmuth. The weighted majority algorithm. Information and Computation, 108(2):212\u2013261, 1994.","journal-title":"Information and Computation"},{"key":"3_CR13","doi-asserted-by":"publisher","first-page":"1498","DOI":"10.1109\/18.771150","volume":"45","author":"G. Shamir","year":"1999","unstructured":"G. Shamir and N. Merhav. Low complexity sequential lossless coding for piecewise stationary memoryless sources. IEEE Trans. Info. Theory, 45:1498\u20131519, 1999.","journal-title":"IEEE Trans. Info. Theory"},{"key":"3_CR14","first-page":"488","volume-title":"Proceedings of the 14th Conference on Uncertainty in Artificial Intelligence (UAI\u201998)","author":"Y. Singer","year":"1998","unstructured":"Y. Singer. Switching portfolios. In Proceedings of the 14th Conference on Uncertainty in Artificial Intelligence (UAI\u201998), pages 488\u2013495, Morgan Kaufmann, San Francisco, CA, 1998."},{"key":"3_CR15","doi-asserted-by":"crossref","unstructured":"V. Vovk. Aggregating strategies. In Proc. 3rd Annu. Workshop on Comput. Learning Theory, pages 371\u2013383. Morgan Kaufmann, 1990.","DOI":"10.1016\/B978-1-55860-146-8.50032-1"},{"key":"3_CR16","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1145\/225298.225304","volume-title":"Proc. 8th Annu. Conf. on Comput. Learning Theory","author":"V.G. Vovk","year":"1995","unstructured":"V.G. Vovk. A game of prediction with expert advice. In Proc. 8th Annu. Conf. on Comput. Learning Theory, pages 51\u201360. ACM Press, New York, NY, 1995."},{"key":"3_CR17","volume-title":"Proc. 10th Annu. Workshop on Comput. Learning Theory","author":"V. Vovk","year":"1997","unstructured":"V. Vovk. Derandomizing stochastic prediction strategies. In Proc. 10th Annu. Workshop on Comput. Learning Theory. ACM Press, New York, NY, 1997."},{"issue":"6","key":"3_CR18","doi-asserted-by":"publisher","first-page":"2210","DOI":"10.1109\/18.556608","volume":"42","author":"F.M.J. Willems","year":"1996","unstructured":"F.M.J. Willems. Coding for a binary independent piecewise-identically-distributed source. IEEE Trans. Info. Theory, 42(6):2210\u20132217, 1996.","journal-title":"IEEE Trans. Info. Theory"}],"container-title":["Lecture Notes in Computer Science","Computational Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44581-1_3","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,2,21]],"date-time":"2019-02-21T04:57:03Z","timestamp":1550725023000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44581-1_3"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540423430","9783540445814"],"references-count":18,"URL":"https:\/\/doi.org\/10.1007\/3-540-44581-1_3","relation":{},"ISSN":["0302-9743"],"issn-type":[{"type":"print","value":"0302-9743"}],"subject":[],"published":{"date-parts":[[2001]]}}}