{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,7,10]],"date-time":"2025-07-10T12:10:01Z","timestamp":1752149401434,"version":"3.41.2"},"reference-count":21,"publisher":"Springer Science and Business Media LLC","issue":"3","license":[{"start":{"date-parts":[[2001,6,1]],"date-time":"2001-06-01T00:00:00Z","timestamp":991353600000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/www.springernature.com\/gp\/researchers\/text-and-data-mining"},{"start":{"date-parts":[[2001,6,1]],"date-time":"2001-06-01T00:00:00Z","timestamp":991353600000},"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":[[2001,6]]},"DOI":"10.1023\/a:1010848128995","type":"journal-article","created":{"date-parts":[[2002,12,22]],"date-time":"2002-12-22T23:10:54Z","timestamp":1040598654000},"page":"247-264","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":13,"title":["Worst-Case Bounds for the Logarithmic Loss of Predictors"],"prefix":"10.1007","volume":"43","author":[{"given":"Nicol\u00f2","family":"Cesa-Bianchi","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"G\u00e1bor","family":"Lugosi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","reference":[{"key":"333257_CR1","first-page":"357","volume":"68","author":"K. Azuma","year":"1967","unstructured":"Azuma, K. (1967). Weighted sums of certain dependent random variables. Tohoku Mathematical Journal, 68, 357\u2013367.","journal-title":"Tohoku Mathematical Journal"},{"key":"333257_CR2","unstructured":"Barron, A. & Xie, Q. (1996). Asymptotic minimax regret for data compression, gambling, and prediction. Unpublished manuscript presented at an informal meeting on prediction of individual sequences held at the University of California (Santa Cruz)."},{"key":"333257_CR3","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1111\/j.1467-9965.1991.tb00002.x","volume":"1","author":"T. Cover","year":"1991","unstructured":"Cover, T. (1991). Universal portfolios. Mathematical Finance, 1, 1\u201329.","journal-title":"Mathematical Finance"},{"issue":"2","key":"333257_CR4","doi-asserted-by":"crossref","first-page":"348","DOI":"10.1109\/18.485708","volume":"42","author":"T. Cover","year":"1996","unstructured":"Cover, T. & Ordentlich, E. (1996). Universal portfolios with side information. IEEE Transactions on Information Theory, 42:2, 348\u2013363.","journal-title":"IEEE Transactions on Information Theory"},{"key":"333257_CR5","volume-title":"Elements of Information Theory","author":"T. Cover","year":"1991","unstructured":"Cover, T. & Thomas, J. (1991). Elements of Information Theory. New York: John Wiley and Sons."},{"key":"333257_CR6","doi-asserted-by":"crossref","first-page":"1459","DOI":"10.1109\/18.133269","volume":"37","author":"M. Feder","year":"1991","unstructured":"Feder, M. (1991). Gambling using a finite state machine. IEEE Transactions on Information Theory, 37, 1459\u20131465.","journal-title":"IEEE Transactions on Information Theory"},{"key":"333257_CR7","doi-asserted-by":"crossref","unstructured":"Freund, Y. (1996). Predicting a binary sequence almost as well as the optimal biased coin. In Proceedings of the 9th Annual Conference on Computational Learning Theory (pp. 89\u201398).","DOI":"10.1145\/238061.238072"},{"key":"333257_CR8","unstructured":"Haussler, D. & Barron, A. (1993). How well does the Bayes method work in on-line predictions of {+1,-1} Values? In Proceedings of 3rd NEC Symposium (pp. 74\u2013100)."},{"key":"333257_CR9","doi-asserted-by":"crossref","first-page":"1906","DOI":"10.1109\/18.705569","volume":"44","author":"D. Haussler","year":"1998","unstructured":"Haussler, D., Kivinen, J., & Warmuth, M. (1998). Sequential prediction of individual sequences under general loss functions. IEEE Transactions on Information Theory, 44, 1906\u20131925.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"6","key":"333257_CR10","doi-asserted-by":"crossref","first-page":"2124","DOI":"10.1109\/18.720534","volume":"44","author":"N. Merhav","year":"1998","unstructured":"Merhav, N. & Feder,M. (1998). Universal prediction. IEEE Transactions on Information Theory, 44:6, 2124\u20132147.","journal-title":"IEEE Transactions on Information Theory"},{"key":"333257_CR11","unstructured":"Opper, M. & Haussler, D. (1997). Worst case prediction over sequences under log loss. The Mathematics of Information Coding, Extraction, and Distribution. Springer Verlag."},{"key":"333257_CR12","doi-asserted-by":"crossref","first-page":"198","DOI":"10.1147\/rd.203.0198","volume":"20","author":"J. Rissanen","year":"1976","unstructured":"Rissanen, J. (1976). Generalized Kraft's inequality and arithmetic coding. IBM Journal of Research and Development, 20, 198\u2013203.","journal-title":"IBM Journal of Research and Development"},{"key":"333257_CR13","doi-asserted-by":"crossref","first-page":"40","DOI":"10.1109\/18.481776","volume":"42","author":"J. Rissanen","year":"1996","unstructured":"Rissanen, J. (1996). Fischer information and stochastic complexity. IEEE Transactions on Information Theory, 42, 40\u201347.","journal-title":"IEEE Transactions on Information Theory"},{"key":"333257_CR14","unstructured":"Santis, A. D., Markowski, G., & Wegman, M. (1988). Learning probabilistic prediction functions. In Proceedings of the 1st Annual Workshop on Computational Learning Theory (pp. 312\u2013328)."},{"issue":"3","key":"333257_CR15","first-page":"3","volume":"23","author":"Y. Shtarkov","year":"1987","unstructured":"Shtarkov, Y. (1987). Universal sequential coding of single messages. Translated from: Problems in Information Transmission, 23:3, 3\u201317.","journal-title":"Problems in Information Transmission"},{"key":"333257_CR16","first-page":"1049","volume":"24","author":"M. Talagrand","year":"1996","unstructured":"Talagrand, M. (1996). Majorizing measures: The generic chaining. Annals of Probability, 24, 1049\u20131103. (Special Invited Paper).","journal-title":"Annals of Probability"},{"key":"333257_CR17","doi-asserted-by":"crossref","unstructured":"Vovk, V. (1990). Aggregating strategies. In Proceedings of the 3rd Annual Workshop on Computational Learning Theory, 372\u2013383.","DOI":"10.1016\/B978-1-55860-146-8.50032-1"},{"issue":"2","key":"333257_CR18","doi-asserted-by":"crossref","first-page":"153","DOI":"10.1006\/jcss.1997.1556","volume":"56","author":"V. Vovk","year":"1998","unstructured":"Vovk, V. (1998). A game of prediction with expert advice. Journal of Computer and System Sciences, 56:2, 153\u2013173.","journal-title":"Journal of Computer and System Sciences"},{"key":"333257_CR19","doi-asserted-by":"crossref","first-page":"384","DOI":"10.1109\/18.312161","volume":"40","author":"M. Weinberger","year":"1994","unstructured":"Weinberger, M., Merhav, N., & Feder, M. (1994). Optimal sequential probability assignment for individual sequences. IEEE Transactions on Information Theory, 40, 384\u2013396.","journal-title":"IEEE Transactions on Information Theory"},{"issue":"1","key":"333257_CR20","doi-asserted-by":"crossref","first-page":"39","DOI":"10.1006\/inco.1995.1076","volume":"119","author":"K. Yamanishi","year":"1995","unstructured":"Yamanishi, K. (1995).Aloss bound model for on-line stochastic algorithms. Information and Computation, 119:1, 39\u201354.","journal-title":"Information and Computation"},{"key":"333257_CR21","doi-asserted-by":"crossref","first-page":"1424","DOI":"10.1109\/18.681319","volume":"44","author":"K. Yamanishi","year":"1998","unstructured":"Yamanishi, K. (1998). A decision-theoretic extension of stochastic complexity and its application to learning. IEEE Transactions on Information Theory, 44, 1424\u20131440.","journal-title":"IEEE Transactions on Information Theory"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1010848128995.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1023\/A:1010848128995\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1023\/A:1010848128995.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,7,10]],"date-time":"2025-07-10T11:32:59Z","timestamp":1752147179000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1023\/A:1010848128995"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001,6]]},"references-count":21,"journal-issue":{"issue":"3","published-print":{"date-parts":[[2001,6]]}},"alternative-id":["333257"],"URL":"https:\/\/doi.org\/10.1023\/a:1010848128995","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"type":"print","value":"0885-6125"},{"type":"electronic","value":"1573-0565"}],"subject":[],"published":{"date-parts":[[2001,6]]},"assertion":[{"value":"This content has been made available to all.","name":"free","label":"Free to read"}]}}