{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T00:48:56Z","timestamp":1740098936218,"version":"3.37.3"},"publisher-location":"Cham","reference-count":15,"publisher":"Springer International Publishing","isbn-type":[{"type":"print","value":"9783319671895"},{"type":"electronic","value":"9783319671901"}],"license":[{"start":{"date-parts":[[2017,1,1]],"date-time":"2017-01-01T00:00:00Z","timestamp":1483228800000},"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":[[2017]]},"DOI":"10.1007\/978-3-319-67190-1_18","type":"book-chapter","created":{"date-parts":[[2017,9,18]],"date-time":"2017-09-18T05:48:49Z","timestamp":1505713729000},"page":"236-248","source":"Crossref","is-referenced-by-count":2,"title":["A Priori Advantages of Meta-Induction and the No Free Lunch Theorem: A Contradiction?"],"prefix":"10.1007","author":[{"given":"Gerhard","family":"Schurz","sequence":"first","affiliation":[]},{"given":"Paul","family":"Thorn","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2017,9,19]]},"reference":[{"key":"18_CR1","doi-asserted-by":"crossref","first-page":"278","DOI":"10.1086\/592550","volume":"75","author":"G Schurz","year":"2008","unstructured":"Schurz, G.: The meta-inductivist\u2019s winning strategy in the prediction game: a new approach to Hume\u2019s problem. Philos. Sci. 75, 278\u2013305 (2008)","journal-title":"Philos. Sci."},{"key":"18_CR2","doi-asserted-by":"crossref","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":"18_CR3","unstructured":"Wolpert, D., Macready, W.: No free lunch theorems for search. Technical report SFI-TR-95-02-010, Santa Fe Institute (1995)"},{"key":"18_CR4","first-page":"47","volume":"6","author":"D Wolpert","year":"1992","unstructured":"Wolpert, D.: On the connection between in-sample testing and generalization error. Complex Syst. 6, 47\u201394 (1992)","journal-title":"Complex Syst."},{"key":"18_CR5","doi-asserted-by":"crossref","unstructured":"Schaffer, C.: A conservation law for generalization performance. In: Machine Learning (Proceedings of ICML 1994), pp. 259\u2013265. Morgan Kaufmann, Burlington (1994)","DOI":"10.1016\/B978-1-55860-335-6.50039-8"},{"key":"18_CR6","doi-asserted-by":"crossref","unstructured":"Rao, R., Gordon, D., Spears, W.: For every generalization action, is there really an equal and opposite reaction? In: Machine Learning (Proceedings of ICML 1995), pp. 471\u2013479. Morgan Kaufmann, Burlington (1994)","DOI":"10.1016\/B978-1-55860-377-6.50065-7"},{"key":"18_CR7","unstructured":"Giraud-Carrier, C., Provost, F.: Toward a justification of meta-learning: is the no free lunch theorem a show-stopper? In: Proceedings of the ICML-2005 Workshop on Meta-learning, pp. 12\u201319 (2006)"},{"key":"18_CR8","doi-asserted-by":"crossref","first-page":"1341","DOI":"10.1162\/neco.1996.8.7.1341","volume":"8","author":"D Wolpert","year":"1996","unstructured":"Wolpert, D.: The lack of a priori distinctions between learning algorithms. Neural Comput. 8, 1341\u20131390 (1996)","journal-title":"Neural Comput."},{"issue":"1","key":"18_CR9","doi-asserted-by":"crossref","first-page":"31","DOI":"10.1007\/s11023-015-9369-7","volume":"26","author":"G Schurz","year":"2016","unstructured":"Schurz, G., Thorn, P.: The revenge of ecological rationality: strategy-selection by meta-induction. Minds Mach. 26(1), 31\u201359 (2016)","journal-title":"Minds Mach."},{"key":"18_CR10","unstructured":"Schurz, G.: Meta-induction is an optimal prediction strategy. In: Proceedings of the 18th Annual Belgian-Dutch Conference on Machine Learning, pp. 66\u201374. University of Tilburg (2009)"},{"key":"18_CR11","unstructured":"Gigerenzer, G., Todd, P.M., the ABC Research Group. (eds.): Simple Heuristics That Make Us Smart. Oxford University Press, Dordrecht (1999)"},{"key":"18_CR12","unstructured":"Schurz, G.: The Optimality of Meta-induction. A New Approach to Hume\u2019s Problem. Book manuscript (2017)"},{"key":"18_CR13","volume-title":"Logical Foundations of Probability","author":"R Carnap","year":"1962","unstructured":"Carnap, R.: Logical Foundations of Probability, 2nd edn. University of Chicago Press, Chicago (1962)","edition":"2"},{"key":"18_CR14","volume-title":"Scientific Reasoning: The Bayesian Approach","author":"C Howson","year":"1996","unstructured":"Howson, C., Urbach, P.: Scientific Reasoning: The Bayesian Approach, 2nd edn. Open Court, Chicago (1996)","edition":"2"},{"issue":"1\u201322","key":"18_CR15","doi-asserted-by":"crossref","first-page":"224","DOI":"10.1016\/S0019-9958(64)90131-7","volume":"7","author":"R Solomonoff","year":"1964","unstructured":"Solomonoff, R.: A formal theory of inductive inference. Inf. Control 7(1\u201322), 224\u2013254 (1964)","journal-title":"Inf. Control"}],"container-title":["Lecture Notes in Computer Science","KI 2017: Advances in Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-67190-1_18","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,10,3]],"date-time":"2019-10-03T11:56:28Z","timestamp":1570103788000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-319-67190-1_18"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2017]]},"ISBN":["9783319671895","9783319671901"],"references-count":15,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-67190-1_18","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2017]]}}}