{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T03:42:58Z","timestamp":1740109378094,"version":"3.37.3"},"reference-count":15,"publisher":"Springer Science and Business Media LLC","issue":"5","license":[{"start":{"date-parts":[[2024,5,20]],"date-time":"2024-05-20T00:00:00Z","timestamp":1716163200000},"content-version":"tdm","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"},{"start":{"date-parts":[[2024,5,20]],"date-time":"2024-05-20T00:00:00Z","timestamp":1716163200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0"}],"funder":[{"DOI":"10.13039\/100019180","name":"HORIZON EUROPE European Research Council","doi-asserted-by":"publisher","award":["01041696"],"award-info":[{"award-number":["01041696"]}],"id":[{"id":"10.13039\/100019180","id-type":"DOI","asserted-by":"publisher"}]},{"name":"Unidade Local de Sa\u00fade de S\u00e3o Jos\u00e9"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":["Theory Comput Syst"],"published-print":{"date-parts":[[2024,10]]},"abstract":"<jats:title>Abstract<\/jats:title><jats:p>We combine Solomonoff\u2019s approach to universal prediction with algorithmic statistics and suggest to use the computable measure that provides the best \u201cexplanation\u201d for the observed data (in the sense of algorithmic statistics) for prediction. In this way we keep the expected sum of squares of prediction errors bounded (as it was for the Solomonoff\u2019s predictor) and, moreover, guarantee that the sum of squares of prediction errors is bounded along any Martin-L\u00f6f random sequence. An extended abstract of this paper was presented at the 16th International Computer Science Symposium in Russia (CSR 2021)\u00a0(Milovanov 2021).<\/jats:p>","DOI":"10.1007\/s00224-024-10180-0","type":"journal-article","created":{"date-parts":[[2024,5,20]],"date-time":"2024-05-20T04:01:21Z","timestamp":1716177681000},"page":"1124-1137","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":0,"title":["Prediction and MDL for infinite sequences"],"prefix":"10.1007","volume":"68","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-4609-7851","authenticated-orcid":false,"given":"Alexey","family":"Milovanov","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2024,5,20]]},"reference":[{"issue":"6","key":"10180_CR1","doi-asserted-by":"publisher","first-page":"2443","DOI":"10.1109\/18.945257","volume":"47","author":"P G\u00e1cs","year":"2001","unstructured":"G\u00e1cs, P., Tromp, J., Vit\u00e1nyi, P.M.B.: Algorithmic statistics. IEEE Trans. Inf. Theory 47(6), 2443\u20132463 (2001)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"11","key":"10180_CR2","doi-asserted-by":"publisher","first-page":"3780","DOI":"10.1109\/TIT.2005.856956","volume":"51","author":"M Hutter","year":"2005","unstructured":"Hutter, M., Poland, J.: Asymptotics of Discrete MDL for Online Prediction. IEEE Trans. Inf. Theory 51(11), 3780\u20133795 (2005)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"10180_CR3","unstructured":"Hutter, M.: Discrete MDL Predicts in Total Variation Advances in Neural Information Processing Systems 22 (NIPS\u20132009) 817-825"},{"key":"10180_CR4","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1016\/j.jcss.2005.07.001","volume":"72","author":"M Hutter","year":"2006","unstructured":"Hutter, M.: Sequential predictions based on algorithmic complexity. J. Comput. Syst. Sci. 72, 95\u2013117 (2006)","journal-title":"J. Comput. Syst. Sci."},{"key":"10180_CR5","series-title":"LNCS (LNAI)","first-page":"234","volume-title":"ALT 2004","author":"M Hutter","year":"2004","unstructured":"Hutter, M., Muchnik, A.: Universal convergence of semimeasures on individual random sequences. In: Ben-David, S., Case, J., Maruoka, A. (eds.) ALT 2004. LNCS (LNAI), vol. 3244, pp. 234\u2013248. Springer, Heidelberg (2004)"},{"key":"10180_CR6","doi-asserted-by":"crossref","unstructured":"Hutter, M., Muchnik, A.: On semimeasures predicting Martin-L\u00f6f random sequences. In Theoretical Computer Science Volume 382, Issue 3, 6 September 2007, Pages 247\u2013261. https:\/\/www.sciencedirect.com\/science\/article\/pii\/S0304397507002393","DOI":"10.1016\/j.tcs.2007.03.040"},{"key":"10180_CR7","unstructured":"Li M., Vit\u00e1nyi, P.: An Introduction to Kolmogorov complexity and its applications, 3rd ed., Springer, 2008 (1 ed., 1993; 2 ed., 1997), xxiii+790\u00a0pp. ISBN 978-0-387-49820-1"},{"key":"10180_CR8","doi-asserted-by":"crossref","unstructured":"Lattimore, T., Hutter, M.: On Martin-L\u00f6f Convergence of Solomonoff\u2019s Mixture. In: Chan TH.H., Lau L.C., Trevisan L. (eds.) Theory and Applications of Models of Computation. TAMC 2013. Lecture Notes in Computer Science, vol 7876. Springer, Berlin, Heidelberg (2013)","DOI":"10.1007\/978-3-642-38236-9_20"},{"key":"10180_CR9","doi-asserted-by":"crossref","unstructured":"Milovanov, A.: Algorithmic Statistics and Prediction for Polynomial Time-Bounded Algorithms, in: Sailing Routes in the World of Computation. Springer, 2018 p. 287\u2013296. https:\/\/link.springer.com\/chapter\/10.1007\/978-3-319-94418-0_29","DOI":"10.1007\/978-3-319-94418-0_29"},{"key":"10180_CR10","doi-asserted-by":"crossref","unstructured":"Milovanov, A.: Predictions and Algorithmic Statistics for Infinite Sequences. In: Computer Science - Theory and Applications: 16th International Computer Science Symposium in Russia (CSR 2021) Proceedings, pp. 283\u2013295. Springer, (2021)","DOI":"10.1007\/978-3-030-79416-3_17"},{"key":"10180_CR11","doi-asserted-by":"crossref","unstructured":"Shen, A., Uspensky, V., Vereshchagin, N.: Kolmogorov Complexity and Algorithmic Randomness, ACM, (2017)","DOI":"10.1090\/surv\/220"},{"key":"10180_CR12","doi-asserted-by":"crossref","unstructured":"Solomonoff, R.J.: A formal theory of inductive inference: Parts 1 and 2. Information and Control, 7(1)\u201322, 224\u2013254 (1964)","DOI":"10.1016\/S0019-9958(64)90131-7"},{"key":"10180_CR13","doi-asserted-by":"crossref","unstructured":"Solomonoff, R.J.: Complexity-based induction systems: Comparisons and convergence theorems. IEEE Transactions on Information Theory, IT-(24), 422\u2013432, (1978)","DOI":"10.1109\/TIT.1978.1055913"},{"key":"10180_CR14","doi-asserted-by":"crossref","unstructured":"Vereshchagin, N.,K., Shen, A.: Algorithmic Statistics: Forty Years Later. Computability and Complexity: 669-737 (2017)","DOI":"10.1007\/978-3-319-50062-1_41"},{"issue":"6","key":"10180_CR15","first-page":"1298","volume":"294","author":"VG Vovk","year":"1987","unstructured":"Vovk, V.G.: On a criterion for randomness. Dokl. Akad. Nauk SSSR 294(6), 1298\u20131302 (1987)","journal-title":"Dokl. Akad. Nauk SSSR"}],"container-title":["Theory of Computing Systems"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-024-10180-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/article\/10.1007\/s00224-024-10180-0\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/s00224-024-10180-0.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,10,25]],"date-time":"2024-10-25T09:53:49Z","timestamp":1729850029000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/s00224-024-10180-0"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2024,5,20]]},"references-count":15,"journal-issue":{"issue":"5","published-print":{"date-parts":[[2024,10]]}},"alternative-id":["10180"],"URL":"https:\/\/doi.org\/10.1007\/s00224-024-10180-0","relation":{},"ISSN":["1432-4350","1433-0490"],"issn-type":[{"type":"print","value":"1432-4350"},{"type":"electronic","value":"1433-0490"}],"subject":[],"published":{"date-parts":[[2024,5,20]]},"assertion":[{"value":"4 March 2024","order":1,"name":"accepted","label":"Accepted","group":{"name":"ArticleHistory","label":"Article History"}},{"value":"20 May 2024","order":2,"name":"first_online","label":"First Online","group":{"name":"ArticleHistory","label":"Article History"}}]}}