{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,3,27]],"date-time":"2025-03-27T18:02:36Z","timestamp":1743098556445,"version":"3.40.3"},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540428756"},{"type":"electronic","value":"9783540455837"}],"license":[{"start":{"date-parts":[[2001,1,1]],"date-time":"2001-01-01T00:00:00Z","timestamp":978307200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-45583-3_15","type":"book-chapter","created":{"date-parts":[[2007,10,19]],"date-time":"2007-10-19T08:37:04Z","timestamp":1192783024000},"page":"181-189","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":2,"title":["Loss Functions, Complexities, and the Legendre Transformation"],"prefix":"10.1007","author":[{"given":"Yuri","family":"Kalnishkan","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Michael V.","family":"Vyugin","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Volodya","family":"Vovk","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"297","published-online":{"date-parts":[[2001,10,31]]},"reference":[{"key":"15_CR1","doi-asserted-by":"crossref","unstructured":"V. M. Alekseev, V. M. Tikhomirov, and S. V. Fomin. Optimal Control. Plenum, New York, 1987.","DOI":"10.1007\/978-1-4615-7551-1"},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"Y. Kalnishkan. General linear relations among different types of predictive complexity. In Proc. 10th International Conference on Algorithmic Learning Theory \u2014 ALT\u2019 99, volume 1720 of Lecture Notes in Artificial Intelligence, pages 323\u2013334. Springer-Verlag, 1999.","DOI":"10.1007\/3-540-46769-6_27"},{"key":"15_CR3","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4757-2606-0","volume-title":"An Introduction to Kolmogorov Complexity and Its Applications","author":"M. Li","year":"1997","unstructured":"M. Li and P. Vit\u00e1nyi. An Introduction to Kolmogorov Complexity and Its Applications. Springer, New York, 2nd edition, 1997.","edition":"2nd edition"},{"key":"15_CR4","unstructured":"A. Wayne Roberts and Dale E. Varberg. Convex Functions. Academic Press, 1973."},{"key":"15_CR5","doi-asserted-by":"crossref","unstructured":"R. Tyrrell Rockafellar. Convex Analysis. Princeton University Press, 1970.","DOI":"10.1515\/9781400873173"},{"key":"15_CR6","doi-asserted-by":"crossref","unstructured":"V. Vovk. Aggregating strategies. In M. Fulk and J. Case, editors, Proceedings of the 3rd Annual Workshop on Computational Learning Theory, pages 371\u2013383, San Mateo, CA, 1990. Morgan Kaufmann.","DOI":"10.1016\/B978-1-55860-146-8.50032-1"},{"key":"15_CR7","doi-asserted-by":"publisher","first-page":"153","DOI":"10.1006\/jcss.1997.1556","volume":"56","author":"V. Vovk","year":"1998","unstructured":"V. Vovk. A game of prediction with expert advice. Journal of Computer and System Sciences, 56:153\u2013173, 1998.","journal-title":"Journal of Computer and System Sciences"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"V. Vovk and C. J. H. C. Watkins. Universal portfolio selection. In Proceedings of the 11th Annual Conference on Computational Learning Theory, pages 12\u201323, 1998.","DOI":"10.1145\/279943.279947"},{"key":"15_CR9","first-page":"357","volume":"13","author":"V. V. V'yugin","year":"1994","unstructured":"V. V. V'yugin. Algorithmic entropy (complexity) of finite objects and its applications to defining randomness and amount of information. Selecta Mathematica formerly Sovietica, 13:357\u2013389, 1994.","journal-title":"Selecta Mathematica formerly Sovietica"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-45583-3_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2020,3,30]],"date-time":"2020-03-30T21:18:42Z","timestamp":1585603122000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-45583-3_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540428756","9783540455837"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/3-540-45583-3_15","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2001]]},"assertion":[{"value":"31 October 2001","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}}]}}