{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,5]],"date-time":"2024-09-05T18:06:32Z","timestamp":1725559592686},"publisher-location":"Berlin, Heidelberg","reference-count":17,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540265566"},{"type":"electronic","value":"9783540318927"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11503415_14","type":"book-chapter","created":{"date-parts":[[2010,7,14]],"date-time":"2010-07-14T18:16:38Z","timestamp":1279131398000},"page":"204-216","source":"Crossref","is-referenced-by-count":10,"title":["Tracking the Best of Many Experts"],"prefix":"10.1007","author":[{"given":"Andr\u00e1s","family":"Gy\u00f6rgy","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Tam\u00e1s","family":"Linder","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G\u00e1bor","family":"Lugosi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"issue":"2","key":"14_CR1","doi-asserted-by":"publisher","first-page":"127","DOI":"10.1023\/A:1007472513967","volume":"32","author":"P. Auer","year":"1998","unstructured":"Auer, P., Warmuth, M.K.: Tracking the best disjunction. Machine Learning\u00a032(2), 127\u2013150 (1998)","journal-title":"Machine Learning"},{"key":"14_CR2","doi-asserted-by":"crossref","first-page":"1","DOI":"10.2140\/pjm.1956.6.1","volume":"6","author":"D. Blackwell","year":"1956","unstructured":"Blackwell, D.: An analog of the minimax theorem for vector payoffs. Pacific Journal of Mathematics\u00a06, 1\u20138 (1956)","journal-title":"Pacific Journal of Mathematics"},{"key":"14_CR3","doi-asserted-by":"publisher","first-page":"363","DOI":"10.1162\/153244303321897654","volume":"3","author":"O. Bousquet","year":"2002","unstructured":"Bousquet, O., Warmuth, M.K.: Tracking a small set of experts by mixing past posteriors. Journal of Machine Learning Research\u00a03, 363\u2013396 (2002)","journal-title":"Journal of Machine Learning Research"},{"issue":"3","key":"14_CR4","doi-asserted-by":"publisher","first-page":"427","DOI":"10.1145\/258128.258179","volume":"44","author":"N. Cesa-Bianchi","year":"1997","unstructured":"Cesa-Bianchi, N., Freund, Y., Helmbold, D.P., Haussler, D., Schapire, R., Warmuth, M.K.: How to use expert advice. Journal of the ACM\u00a044(3), 427\u2013485 (1997)","journal-title":"Journal of the ACM"},{"key":"14_CR5","doi-asserted-by":"publisher","first-page":"51","DOI":"10.1023\/A:1007396710653","volume":"27","author":"R.E. Schapire","year":"1997","unstructured":"Schapire, R.E., Helmbold, D.P.: Predicting nearly as well as the best pruning of a decision tree. Machine Learning\u00a027, 51\u201368 (1997)","journal-title":"Machine Learning"},{"key":"14_CR6","doi-asserted-by":"crossref","unstructured":"Gy\u00f6rgy, A., Linder, T., Lugosi, G.: Efficient algorithms and minimax bounds for zero-delay lossy source coding. IEEE Transactions on Signal Processing, 2337\u20132347 (August 2004)","DOI":"10.1109\/TSP.2004.831128"},{"key":"14_CR7","first-page":"97","volume-title":"Contributions to the Theory of Games","author":"J. Hannan","year":"1957","unstructured":"Hannan, J.: Approximation to Bayes risk in repeated plays. In: Dresher, M., Tucker, A., Wolfe, P. (eds.) Contributions to the Theory of Games, vol.\u00a03, pp. 97\u2013139. Princeton University Press, Princeton (1957)"},{"key":"14_CR8","doi-asserted-by":"crossref","unstructured":"Herbster, M., Warmuth, M.K.: Tracking the best expert. Machine Learning, 1\u201329 (1998)","DOI":"10.1145\/279943.279949"},{"key":"14_CR9","doi-asserted-by":"publisher","first-page":"281","DOI":"10.1162\/153244301753683726","volume":"1","author":"M. Herbster","year":"2001","unstructured":"Herbster, M., Warmuth, M.K.: Tracking the best linear predictor. Journal of Machine Learning Research\u00a01, 281\u2013309 (2001)","journal-title":"Journal of Machine Learning Research"},{"key":"14_CR10","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"26","DOI":"10.1007\/978-3-540-45167-9_4","volume-title":"Learning Theory and Kernel Machines","author":"A. Kalai","year":"2003","unstructured":"Kalai, A., Vempala, S.: Efficient algorithms for online decision problems. In: Sch\u00f6lkopf, B., Warmuth, M.K. (eds.) COLT\/Kernel 2003. LNCS (LNAI), vol.\u00a02777, pp. 26\u201340. Springer, Heidelberg (2003)"},{"key":"14_CR11","doi-asserted-by":"publisher","first-page":"212","DOI":"10.1006\/inco.1994.1009","volume":"108","author":"N. Littlestone","year":"1994","unstructured":"Littlestone, N., Warmuth, M.K.: The weighted majority algorithm. Information and Computation\u00a0108, 212\u2013261 (1994)","journal-title":"Information and Computation"},{"key":"14_CR12","doi-asserted-by":"publisher","first-page":"183","DOI":"10.1023\/A:1007670818503","volume":"36","author":"F. Pereira","year":"1999","unstructured":"Pereira, F., Singer, Y.: An efficient extension to mixture techniques for prediction and decision trees. Machine Learning\u00a036, 183\u2013199 (1999)","journal-title":"Machine Learning"},{"key":"14_CR13","doi-asserted-by":"publisher","first-page":"217","DOI":"10.1016\/S0304-3975(01)00401-7","volume":"288","author":"E. Takimoto","year":"2002","unstructured":"Takimoto, E., Warmuth, M.: Predicting nearly as well as the best pruning of a planar decision graph. Theoretical Computer Science\u00a0288, 217\u2013235 (2002)","journal-title":"Theoretical Computer Science"},{"key":"14_CR14","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"74","DOI":"10.1007\/3-540-45435-7_6","volume-title":"Computational Learning Theory","author":"E. Takimoto","year":"2002","unstructured":"Takimoto, E., Warmuth, M.K.: Path kernels and multiplicative updates. In: Kivinen, J., Sloan, R.H. (eds.) COLT 2002. LNCS (LNAI), vol.\u00a02375, pp. 74\u201389. Springer, Heidelberg (2002)"},{"key":"14_CR15","doi-asserted-by":"publisher","first-page":"773","DOI":"10.1162\/1532443041424328","volume":"4","author":"E. Takimoto","year":"2003","unstructured":"Takimoto, E., Warmuth, M.K.: Path kernels and multiplicative updates. Journal of Machine Learning Research\u00a04, 773\u2013818 (2003)","journal-title":"Journal of Machine Learning Research"},{"key":"14_CR16","doi-asserted-by":"crossref","unstructured":"Vovk, V.: Aggregating strategies. In: Proceedings of the Third Annual Workshop on Computational Learning Theory, New York. Association of Computing Machinery, pp. 372\u2013383 (1990)","DOI":"10.1016\/B978-1-55860-146-8.50032-1"},{"issue":"3","key":"14_CR17","doi-asserted-by":"publisher","first-page":"247","DOI":"10.1023\/A:1007595032382","volume":"35","author":"V. Vovk","year":"1999","unstructured":"Vovk, V.: Derandomizing stochastic prediction strategies. Machine Learning\u00a035(3), 247\u2013282 (1999)","journal-title":"Machine Learning"}],"container-title":["Lecture Notes in Computer Science","Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11503415_14.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,11,17]],"date-time":"2020-11-17T15:02:28Z","timestamp":1605625348000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11503415_14"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540265566","9783540318927"],"references-count":17,"URL":"https:\/\/doi.org\/10.1007\/11503415_14","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2005]]}}}