{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,12,1]],"date-time":"2025-12-01T11:11:45Z","timestamp":1764587505281},"publisher-location":"Berlin, Heidelberg","reference-count":9,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540407201"},{"type":"electronic","value":"9783540451679"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2003]]},"DOI":"10.1007\/978-3-540-45167-9_26","type":"book-chapter","created":{"date-parts":[[2010,7,22]],"date-time":"2010-07-22T19:10:53Z","timestamp":1279825853000},"page":"344-357","source":"Crossref","is-referenced-by-count":17,"title":["PAC-MDL Bounds"],"prefix":"10.1007","author":[{"given":"Avrim","family":"Blum","sequence":"first","affiliation":[]},{"given":"John","family":"Langford","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"26_CR1","doi-asserted-by":"publisher","first-page":"377","DOI":"10.1016\/0020-0190(87)90114-1","volume":"24","author":"A. Blumer","year":"1987","unstructured":"Blumer, A., Ehrenfeucht, A., Haussler, D., Warmuth, M.: Occam\u2019s Razor. Information Processing Letters\u00a024, 377\u2013380 (1987)","journal-title":"Information Processing Letters"},{"key":"26_CR2","doi-asserted-by":"publisher","DOI":"10.1002\/0471200611","volume-title":"Elements of Information Theory","author":"T. Cover","year":"1991","unstructured":"Cover, T., Thomas, J.: Elements of Information Theory. Wiley, New York (1991)"},{"key":"26_CR3","doi-asserted-by":"crossref","unstructured":"Floyd, S., Warmuth, M.: Sample Compression, Learnability, and the Vapnik-Chervonenkis Dimension. Machine Learning 21(3), 269\u2013304","DOI":"10.1007\/BF00993593"},{"key":"26_CR4","doi-asserted-by":"crossref","unstructured":"Hinton, G.E., van Camp, D.: Keeping neural networks simple by minimizing the description length of the weights. In: COLT 1993 (1993)","DOI":"10.1145\/168304.168306"},{"key":"26_CR5","unstructured":"Langford, J.: Quantitatively Tight Sample Complexity Bounds. Carnegie Mellon Thesis (2002)"},{"key":"26_CR6","unstructured":"Littlestone, N., Warmuth, M.: Relating Data Compression and Learnability, June 10 (1986) (unpublished manuscript)"},{"key":"26_CR7","doi-asserted-by":"crossref","unstructured":"McAllester, D.: PAC-Bayesian Model Averaging. In: COLT 1999 (1999)","DOI":"10.1145\/307400.307435"},{"issue":"2","key":"26_CR8","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1137\/1116025","volume":"16","author":"V.N. Vapnik","year":"1971","unstructured":"Vapnik, V.N., Chervonenkis, A.Y.: On the uniform convergence of relative frequencies of events to their probabilities. Theory of Probab. and its Applications\u00a016(2), 264\u2013280 (1971)","journal-title":"Theory of Probab. and its Applications"},{"key":"26_CR9","volume-title":"Statistical Learning Theory","author":"V.N. Vapnik","year":"1999","unstructured":"Vapnik, V.N.: Statistical Learning Theory. Wiley, Chichester (1999)"}],"container-title":["Lecture Notes in Computer Science","Learning Theory and Kernel Machines"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-45167-9_26","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,3,17]],"date-time":"2019-03-17T03:44:06Z","timestamp":1552794246000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-45167-9_26"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2003]]},"ISBN":["9783540407201","9783540451679"],"references-count":9,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-45167-9_26","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2003]]}}}