{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,6,12]],"date-time":"2026-06-12T16:35:07Z","timestamp":1781282107497,"version":"3.54.1"},"publisher-location":"Berlin, Heidelberg","reference-count":21,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540423430","type":"print"},{"value":"9783540445814","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2001]]},"DOI":"10.1007\/3-540-44581-1_15","type":"book-chapter","created":{"date-parts":[[2007,8,10]],"date-time":"2007-08-10T06:13:49Z","timestamp":1186726429000},"page":"224-240","source":"Crossref","is-referenced-by-count":75,"title":["Rademacher and Gaussian Complexities: Risk Bounds and Structural Results"],"prefix":"10.1007","author":[{"given":"Peter L.","family":"Bartlett","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"Shahar","family":"Mendelson","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2001,9,13]]},"reference":[{"issue":"2","key":"15_CR1","doi-asserted-by":"publisher","first-page":"525","DOI":"10.1109\/18.661502","volume":"44","author":"P. L. Bartlett","year":"1998","unstructured":"Peter L. Bartlett. The sample complexity of pattern classification with neural networks: the size of the weights is more important than the size of the network. IEEE Transactions on Information Theory, 44(2):525\u2013536, 1998.","journal-title":"IEEE Transactions on Information Theory"},{"key":"15_CR2","doi-asserted-by":"crossref","unstructured":"Peter L. Bartlett, St\u00e9phane Boucheron, and G\u00e1bor Lugosi. Model selection and error estimation. Machine Learning, 2001. (To appear).","DOI":"10.2139\/ssrn.248567"},{"key":"15_CR3","unstructured":"Mostefa Golea, Peter L. Bartlett, and Wee Sun Lee. Generalization in decision trees and DNF: Does size matter? In NIPS 10, pages 259\u2013265, 1998."},{"key":"15_CR4","doi-asserted-by":"publisher","first-page":"7","DOI":"10.1023\/A:1007344726582","volume":"27","author":"M. J. Kearns","year":"1997","unstructured":"Michael J. Kearns, Yishay Mansour, Andrew Y. Ng, and Dana Ron. An experimental and theoretical comparison of model selection methods. Machine Learning, 27:7\u201350, 1997.","journal-title":"Machine Learning"},{"key":"15_CR5","unstructured":"V. Koltchinskii. Rademacher penalties and structural risk minimization. Technical report, Department of Mathematics and Statistics, University of New Mexico, 2000."},{"key":"15_CR6","unstructured":"V. Koltchinskii and D. Panchenko. Empirical margin distributions and bounding the generalization error of combined classifiers. Technical report, Department of Mathematics and Statistics, University of New Mexico, 2000."},{"key":"15_CR7","doi-asserted-by":"crossref","unstructured":"V. Koltchinskii and D. Panchenko. Rademacher processes and bounding the risk of function learning. Technical report, Department of Mathematics and Statistics, University of New Mexico, 2000.","DOI":"10.1007\/978-1-4612-1358-1_29"},{"key":"15_CR8","doi-asserted-by":"crossref","unstructured":"E.B. Kong and T.G. Dietterich. Error-correcting output coding corrects bias and variance. In Proc. 12th International Conference on Machine Learning, pages 313\u2013321. Morgan Kaufmann, 1995.","DOI":"10.1016\/B978-1-55860-377-6.50046-3"},{"key":"15_CR9","doi-asserted-by":"crossref","unstructured":"M. Ledoux and M. Talagrand. Probability in Banach Spaces: isoperimetry and processes. Springer, 1991.","DOI":"10.1007\/978-3-642-20212-4"},{"issue":"3","key":"15_CR10","doi-asserted-by":"publisher","first-page":"243","DOI":"10.1023\/A:1007697429651","volume":"38","author":"L. Mason","year":"2000","unstructured":"Llew Mason, Peter L. Bartlett, and Jonathan Baxter. Improved generalization through explicit optimization of margins. Machine Learning, 38(3):243\u2013255, 2000.","journal-title":"Machine Learning"},{"key":"15_CR11","doi-asserted-by":"crossref","unstructured":"C. McDiarmid. On the method of bounded differences. In Surveys in Combinatorics 1989, pages 148\u2013188. Cambridge University Press, 1989.","DOI":"10.1017\/CBO9781107359949.008"},{"key":"15_CR12","doi-asserted-by":"crossref","unstructured":"Shahar Mendelson. l-norm and its application to learning theory. Positivity, 2001. (To appear\u2014see http:\/\/www.axiom.anu.edu.au\/~shahar ).","DOI":"10.1023\/A:1011430329313"},{"key":"15_CR13","doi-asserted-by":"crossref","unstructured":"Shahar Mendelson. Rademacher averages and phase transitions in Glivenko-Cantelli classes. (see http:\/\/www.axiom.anu.edu.au\/~shahar ), 2001.","DOI":"10.1109\/18.971753"},{"key":"15_CR14","unstructured":"Shahar Mendelson. Some remarks on covering numbers. (unpublished manuscript\u2014see http:\/\/www.axiom.anu.edu.au\/~shahar ), 2001."},{"key":"15_CR15","doi-asserted-by":"crossref","unstructured":"G. Pisier. The volume of convex bodies and Banach space geometry. Cambridge University Press, 1989.","DOI":"10.1017\/CBO9780511662454"},{"key":"15_CR16","unstructured":"Robert E. Schapire. Using output codes to boost multiclass learning problems. In Machine Learning: Proc. Fourteenth International Conference, pages 313\u2013321, 1997."},{"issue":"5","key":"15_CR17","doi-asserted-by":"publisher","first-page":"1651","DOI":"10.1214\/aos\/1024691352","volume":"26","author":"R. E. Schapire","year":"1998","unstructured":"Robert E. Schapire, Yoav Freund, Peter L. Bartlett, and Wee Sun Lee. Boosting the margin: a new explanation for the effectiveness of voting methods. Annals of Statistics, 26(5):1651\u20131686, October 1998.","journal-title":"Annals of Statistics"},{"issue":"5","key":"15_CR18","doi-asserted-by":"publisher","first-page":"1926","DOI":"10.1109\/18.705570","volume":"44","author":"J. Shawe-Taylor","year":"1998","unstructured":"John Shawe-Taylor, Peter L. Bartlett, Robert C. Williamson, and Martin Anthony. Structural risk minimisation over data-dependent hierarchies. IEEE Transactions on Information Theory, 44(5):1926\u20131940, 1998.","journal-title":"IEEE Transactions on Information Theory"},{"key":"15_CR19","unstructured":"N. Tomczak-Jaegermann. Banach-Mazur distance and finite-dimensional operator ideals. Number 38 in Pitman Monographs and Surveys in Pure and Applied Mathematics. Pitman, 1989."},{"issue":"2","key":"15_CR20","doi-asserted-by":"publisher","first-page":"264","DOI":"10.1137\/1116025","volume":"16","author":"V. N. Vapnik","year":"1971","unstructured":"Vladimir N. Vapnik and A.Y. Chervonenkis. On the uniform convergence of relative frequencies of events to their probabilities. Theory of Probability and its Applications, 16(2):264\u2013280, 1971.","journal-title":"Theory of Probability and its Applications"},{"key":"15_CR21","doi-asserted-by":"crossref","unstructured":"R.C. Williamson, A.J. Smola, and B. Sch\u00f6lkopf. Generalization performance of regularization networks and support vector machines via entropy numbers of compact operators. IEEE Transactions on Information Theory, 2001. (To appear).","DOI":"10.1109\/18.945262"}],"container-title":["Lecture Notes in Computer Science","Computational Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/3-540-44581-1_15","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2019,5,1]],"date-time":"2019-05-01T18:11:20Z","timestamp":1556734280000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44581-1_15"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540423430","9783540445814"],"references-count":21,"URL":"https:\/\/doi.org\/10.1007\/3-540-44581-1_15","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]}}}