{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,31]],"date-time":"2026-03-31T08:36:40Z","timestamp":1774946200855,"version":"3.50.1"},"reference-count":20,"publisher":"Springer Science and Business Media LLC","issue":"2","license":[{"start":{"date-parts":[[1998,8,1]],"date-time":"1998-08-01T00:00:00Z","timestamp":901929600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[1998,8,1]],"date-time":"1998-08-01T00:00:00Z","timestamp":901929600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Machine Learning"],"published-print":{"date-parts":[[1998,8]]},"DOI":"10.1023\/a:1007424614876","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T04:48:21Z","timestamp":1040532501000},"page":"151-178","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":221,"title":["Tracking the Best Expert"],"prefix":"10.1007","volume":"32","author":[{"given":"Mark","family":"Herbster","sequence":"first","affiliation":[]},{"given":"Manfred K.","family":"Warmuth","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"168703_CR1","doi-asserted-by":"crossref","unstructured":"Auer, P. & Warmuth, M. K. (1998). Tracking the best disjunction. Machine Learning, this issue.","DOI":"10.1023\/A:1007472513967"},{"key":"168703_CR2","volume-title":"Proceedings of the 10th Annual Workshop on Computational Learning Theory","author":"A. Blum","year":"1997","unstructured":"Blum, A. & Burch, C. (1997). On-line learning and the metrical task system. In Proceedings of the 10th Annual Workshop on Computational Learning Theory. ACM Press, New York, NY."},{"issue":"3","key":"168703_CR3","doi-asserted-by":"crossref","first-page":"427","DOI":"10.1145\/258128.258179","volume":"44","author":"N. Cesa-Bianchi","year":"1997","unstructured":"Cesa-Bianchi, N., Freund, Y., Haussler, D., Helmbold, D. P., Schapire, R. E., & Warmuth, M. K. (1997). How to use expert advice. Journal of the ACM, 44(3), 427-485.","journal-title":"Journal of the ACM"},{"key":"168703_CR4","unstructured":"Cover, T. & Thomas, J. (1991). Elements of Information Theory. Wiley."},{"key":"168703_CR5","doi-asserted-by":"crossref","first-page":"1258","DOI":"10.1109\/18.144706","volume":"38","author":"M. Feder","year":"1992","unstructured":"Feder, M., Merhav, N., & Gutman, M. (1992). Universal prediction of individual sequences. IEEE Transactions on Information Theory, 38, 1258-1270.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1","key":"168703_CR6","doi-asserted-by":"crossref","first-page":"119","DOI":"10.1006\/jcss.1997.1504","volume":"55","author":"Y. Freund","year":"1997","unstructured":"Freund, Y. & Schapire, R. E. (1997). A decision-theoretic generalization of on-line learning and an application to boosting. Journal of Computer and System Sciences, 55(1), 119-139.","journal-title":"Journal of Computer and System Sciences"},{"key":"168703_CR7","doi-asserted-by":"crossref","unstructured":"Freund, Y., Schapire, R. E., Singer, Y., & Warmuth, M. K. (1997). Using and combining predictors that specialize. In Proceedings of the Twentyninth Annual ACM Symposium on Theory of Computing.","DOI":"10.1145\/258533.258616"},{"key":"168703_CR8","doi-asserted-by":"crossref","unstructured":"Haussler, D., Kivinen, J., & Warmuth, M. K. (1998). Sequential prediction of individual sequences under general loss functions. IEEE Transactions on Information Theory. To appear.","DOI":"10.1109\/18.705569"},{"key":"168703_CR9","first-page":"309","volume-title":"Proceedings of the 1995 Neural Information Processing Conference","author":"D. P. Helmbold","year":"1995","unstructured":"Helmbold, D. P., Kivinen, J., & Warmuth, M. K. (1995). Worst-case loss bounds for sigmoided linear neurons. In Proceedings of the 1995 Neural Information Processing Conference, (pp. 309-315). MIT Press, Cambridge, MA."},{"key":"168703_CR10","doi-asserted-by":"crossref","unstructured":"Helmbold, D.P., Long, D.D.E., & Sherrod, B. (1996). A dynamic disk spin-down technique for mobile computing. In Proceedings of the Second Annual ACM International Conference on Mobile Computing and Networking. ACM\/IEEE.","DOI":"10.1145\/236387.236423"},{"key":"168703_CR11","doi-asserted-by":"crossref","unstructured":"Herbster, M. (1997). Tracking the best expert II. Unpublished Manuscript.","DOI":"10.1145\/279943.279949"},{"key":"168703_CR12","doi-asserted-by":"crossref","unstructured":"Herbster, M. & Warmuth, M. K. (1995). Tracking the best expert. In Proceedings of the 12th International Conference on Machine Learning, (pp. 286-294). Morgan Kaufmann.","DOI":"10.1016\/B978-1-55860-377-6.50043-8"},{"issue":"1","key":"168703_CR13","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1006\/inco.1996.2612","volume":"132","author":"J. Kivinen","year":"1997","unstructured":"Kivinen, J. & Warmuth, M. K. (1997). Additive versus exponentiated gradient updates for linear prediction. Information and Computation, 132(1), 1-64.","journal-title":"Information and Computation"},{"key":"168703_CR14","doi-asserted-by":"crossref","first-page":"285","DOI":"10.1023\/A:1022869011914","volume":"2","author":"N. Littlestone","year":"1988","unstructured":"Littlestone, N. (1988). Learning when irrelevant attributes abound: A new linear-threshold algorithm. Machine Learning, 2, 285-318.","journal-title":"Machine Learning"},{"key":"168703_CR15","unstructured":"Littlestone, N. (1989). Mistake Bounds and Logarithmic Linear-threshold Learning Algorithms. PhD thesis, Technical Report UCSC-CRL-89-11, University of California Santa Cruz."},{"issue":"2","key":"168703_CR16","doi-asserted-by":"crossref","first-page":"212","DOI":"10.1006\/inco.1994.1009","volume":"108","author":"N. Littlestone","year":"1994","unstructured":"Littlestone, N. & Warmuth, M. K. (1994). The weighted majority algorithm. Information and Computation, 108(2), 212-261.","journal-title":"Information and Computation"},{"key":"168703_CR17","unstructured":"Singer, Y. (1997). Towards realistic and competitive portfolio selection algorithms. Unpublished Manuscript."},{"key":"168703_CR18","doi-asserted-by":"crossref","unstructured":"Vovk, V. (1998). A game of prediction with expert advice. Journal of Computer and System Sciences. To appear.","DOI":"10.1006\/jcss.1997.1556"},{"key":"168703_CR19","volume-title":"Proceedings of the 10th Annual Workshop on Computational Learning Theory","author":"V. Vovk","year":"1997","unstructured":"Vovk, V. (1997). Derandomizing stochastic prediction strategies. In Proceedings of the 10th Annual Workshop on Computational Learning Theory. ACM Press, New York, NY."},{"key":"168703_CR20","unstructured":"Warmuth, M. K. (1997). Predicting with the dot-product in the experts framework. Unpublished Manuscript."}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1007424614876.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1007424614876\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1007424614876.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,10]],"date-time":"2025-07-10T11:43:34Z","timestamp":1752147814000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1007424614876"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[1998,8]]},"references-count":20,"journal-issue":{"issue":"2","published-print":{"date-parts":[[1998,8]]}},"alternative-id":["168703"],"URL":"https:\/\/doi.org\/10.1023\/a:1007424614876","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[1998,8]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}