{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T06:10:04Z","timestamp":1737094204379,"version":"3.33.0"},"publisher-location":"Berlin, Heidelberg","reference-count":10,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540729259"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"DOI":"10.1007\/978-3-540-72927-3_10","type":"book-chapter","created":{"date-parts":[[2007,6,12]],"date-time":"2007-06-12T02:30:27Z","timestamp":1181615427000},"page":"112-126","source":"Crossref","is-referenced-by-count":8,"title":["Occam\u2019s Hammer"],"prefix":"10.1007","author":[{"given":"Gilles","family":"Blanchard","sequence":"first","affiliation":[]},{"given":"Fran\u00e7ois","family":"Fleuret","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"key":"10_CR1","unstructured":"Audibert, J.-Y.: Data-dependent generalization error bounds for (noisy) classification: a PAC-Bayesian approach. Technical Report PMA-905, Laboratoire de Probabilit\u00e9s et Mod\u00e8les Al\u00e9atoires, Universit\u00e9s Paris 6 and Paris 7 (2004)"},{"issue":"1","key":"10_CR2","doi-asserted-by":"crossref","first-page":"289","DOI":"10.1111\/j.2517-6161.1995.tb02031.x","volume":"57","author":"Y. Benjamini","year":"1995","unstructured":"Benjamini, Y., Hochberg, Y.: Controlling the false discovery rate \u2013 a practical and powerful approach to multiple testing. J. Roy. Stat. Soc. B\u00a057(1), 289\u2013300 (1995)","journal-title":"J. Roy. Stat. Soc. B"},{"issue":"4","key":"10_CR3","doi-asserted-by":"publisher","first-page":"1165","DOI":"10.1214\/aos\/1013699998","volume":"29","author":"Y. Benjamini","year":"2001","unstructured":"Benjamini, Y., Yekutieli, D.: The control of the false discovery rate in multiple testing under dependency. Annals of Statistics\u00a029(4), 1165\u20131188 (2001)","journal-title":"Annals of Statistics"},{"key":"10_CR4","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":"10_CR5","unstructured":"Catoni, O.: A PAC-Bayesian approach to adaptive classification. Technical report, LPMA, Universit\u00e9 Paris 6 (submitted to Annals of Statistics) (2004)"},{"key":"10_CR6","unstructured":"Gavin, G., Gelly, S., Guermeur, Y., Lallich, S., Mary, J., Sebag, M., Teytaud, O.: PASCAL theoretical challenge. Type I and type II errors for multiple simultaneous hypothesis testing, http:\/\/www.lri.fr\/~teytaud\/risq"},{"key":"10_CR7","first-page":"273","volume":"6","author":"J. Langford","year":"2005","unstructured":"Langford, J.: Tutorial on practical prediction theory for classification. Journal of Machine Learning Research\u00a06, 273\u2013306 (2005)","journal-title":"Journal of Machine Learning Research"},{"issue":"2","key":"10_CR8","doi-asserted-by":"publisher","first-page":"165","DOI":"10.1023\/A:1022806918936","volume":"51","author":"J. Langford","year":"2003","unstructured":"Langford, J., Blum, A.: Microchoice bounds and self bounding learning algorithms. Machine Learning (First communicated at COLT\u201999)\u00a051(2), 165\u2013179 (2003)","journal-title":"Machine Learning, (First communicated at COLT\u201999)"},{"issue":"1","key":"10_CR9","doi-asserted-by":"publisher","first-page":"5","DOI":"10.1023\/A:1021840411064","volume":"51","author":"D. McAllester","year":"2003","unstructured":"McAllester, D.: Bayesian stochastic model selection. Machine Learning (First communicated at COLT\u201998 and \u201999)\u00a051(1), 5\u201321 (2003)","journal-title":"Machine Learning, (First communicated at COLT\u201998 and \u201999)"},{"issue":"4","key":"10_CR10","doi-asserted-by":"publisher","first-page":"1307","DOI":"10.1109\/TIT.2005.864439","volume":"52","author":"T. Zhang","year":"2006","unstructured":"Zhang, T.: Information theoretical upper and lower bounds for statistical estimation. IEEE Transaction on Information Theory\u00a052(4), 1307\u20131321 (2006)","journal-title":"IEEE Transaction on Information Theory"}],"container-title":["Lecture Notes in Computer Science","Learning Theory"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-72927-3_10.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,1,17]],"date-time":"2025-01-17T05:52:28Z","timestamp":1737093148000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-72927-3_10"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[null]]},"ISBN":["9783540729259"],"references-count":10,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-72927-3_10","relation":{},"subject":[]}}