{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,9,8]],"date-time":"2024-09-08T22:50:11Z","timestamp":1725835811345},"publisher-location":"Cham","reference-count":13,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319250397"},{"type":"electronic","value":"9783319250403"}],"license":[{"start":{"date-parts":[[2015,1,1]],"date-time":"2015-01-01T00:00:00Z","timestamp":1420070400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2015]]},"DOI":"10.1007\/978-3-319-25040-3_34","type":"book-chapter","created":{"date-parts":[[2015,10,24]],"date-time":"2015-10-24T21:45:20Z","timestamp":1445723120000},"page":"311-319","source":"Crossref","is-referenced-by-count":0,"title":["Laplace\u2019s Rule of Succession in Information Geometry"],"prefix":"10.1007","author":[{"given":"Yann","family":"Ollivier","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2016,4,3]]},"reference":[{"key":"34_CR1","doi-asserted-by":"publisher","first-page":"251","DOI":"10.1162\/089976698300017746","volume":"10","author":"S-I Amari","year":"1998","unstructured":"Amari, S.-I.: Natural gradient works efficiently in learning. Neural Comput. 10, 251\u2013276 (1998)","journal-title":"Neural Comput."},{"key":"34_CR2","series-title":"Translations of Mathematical Monographs","volume-title":"Methods of Information Geometry","author":"S-I Amari","year":"2000","unstructured":"Amari, S.-I., Nagaoka, H.: Methods of Information Geometry. Translations of Mathematical Monographs, vol. 191. American Mathematical Society, Providence (2000). Translated from the 1993 Japanese original by Daishi Harada"},{"key":"34_CR3","unstructured":"Bartlett, P., Gr\u00fcnwald, P., Harremo\u00ebs, P., Hedayati, F., Kotlowski, W.: Horizon-independent optimal prediction with log-loss in exponential families. In: Conference on Learning Theory (COLT), pp. 639\u2013661 (2013)"},{"key":"34_CR4","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546921","volume-title":"Prediction, Learning, and Games","author":"N Cesa-Bianchi","year":"2006","unstructured":"Cesa-Bianchi, N., Lugosi, G.: Prediction, Learning, and Games. Cambridge University Press, Cambridge (2006)"},{"key":"34_CR5","doi-asserted-by":"crossref","unstructured":"Gr\u00fcnwald, P., Kot\u0142owski, W.: Prequential plug-in codes that achieve optimal redundancy rates even if the model is wrong. In: 2010 IEEE International Symposium on Information Theory Proceedings (ISIT), pp. 1383\u20131387, IEEE (2010)","DOI":"10.1109\/ISIT.2010.5513591"},{"key":"34_CR6","doi-asserted-by":"crossref","DOI":"10.7551\/mitpress\/4643.001.0001","volume-title":"The Minimum Description Length Principle","author":"PD Gr\u00fcnwald","year":"2007","unstructured":"Gr\u00fcnwald, P.D.: The Minimum Description Length Principle. MIT Press, Cambridge (2007)"},{"key":"34_CR7","unstructured":"Hedayati, F., Bartlett, P.: The optimality of Jeffreys prior for online density estimation and the asymptotic normality of maximum likelihood estimators. In: Conference on Learning Theory (COLT) (2012)"},{"key":"34_CR8","unstructured":"Kot\u0142owski, W., Gr\u00fcnwald, P., De Rooij, S.: Following the flattened leader. In: Conference on Learning Theory (COLT), pp. 106\u2013118, Citeseer (2010)"},{"issue":"2","key":"34_CR9","doi-asserted-by":"publisher","first-page":"199","DOI":"10.1109\/TIT.1981.1056331","volume":"27","author":"R Krichevsky","year":"1981","unstructured":"Krichevsky, R., Trofimov, V.: The performance of universal encoding. IEEE Trans. Inf. Theor. 27(2), 199\u2013207 (1981)","journal-title":"IEEE Trans. Inf. Theor."},{"key":"34_CR10","unstructured":"Roos, T., Rissanen, J.: On sequentially normalized maximum likelihood models. In: Proceeedings of 1st Workshop on Information Theoretic Methods in Science and Engineering (WITMSE-2008) (2008)"},{"key":"34_CR11","doi-asserted-by":"crossref","unstructured":"Roos, T., Silander, T., Kontkanen, P., Myllym\u00e4ki, P.: Bayesian network structure learning using factorized NML universal models. In: Information Theory and Applications Workshop 2008, pp. 272\u2013276, IEEE (2008)","DOI":"10.1109\/ITA.2008.4601061"},{"issue":"393","key":"34_CR12","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1080\/01621459.1986.10478240","volume":"81","author":"L Tierney","year":"1986","unstructured":"Tierney, L., Kadane, J.B.: Accurate approximations for posterior moments and marginal densities. J. Am. Stat. Assoc. 81(393), 82\u201386 (1986)","journal-title":"J. Am. Stat. Assoc."},{"key":"34_CR13","series-title":"Lecture Notes in Computer Science (Lecture Notes in Artificial Intelligence)","doi-asserted-by":"publisher","first-page":"279","DOI":"10.1007\/3-540-40992-0_21","volume-title":"Algorithmic Learning Theory","author":"E Takimoto","year":"2000","unstructured":"Takimoto, E., Warmuth, M.K.: The last-step minimax algorithm. In: Arimura, H., Sharma, A.K., Jain, S. (eds.) ALT 2000. LNCS (LNAI), vol. 1968, pp. 279\u2013290. Springer, Heidelberg (2000)"}],"container-title":["Lecture Notes in Computer Science","Geometric Science of Information"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-25040-3_34","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,31]],"date-time":"2019-05-31T09:05:54Z","timestamp":1559293554000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-25040-3_34"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2015]]},"ISBN":["9783319250397","9783319250403"],"references-count":13,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-25040-3_34","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2015]]}}}