{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,29]],"date-time":"2026-05-29T21:40:16Z","timestamp":1780090816857,"version":"3.54.0"},"publisher-location":"Cham","reference-count":22,"publisher":"Springer International Publishing","isbn-type":[{"value":"9783319463780","type":"print"},{"value":"9783319463797","type":"electronic"}],"license":[{"start":{"date-parts":[[2016,1,1]],"date-time":"2016-01-01T00:00:00Z","timestamp":1451606400000},"content-version":"unspecified","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":["link.springer.com"],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2016]]},"DOI":"10.1007\/978-3-319-46379-7_1","type":"book-chapter","created":{"date-parts":[[2016,9,20]],"date-time":"2016-09-20T10:54:33Z","timestamp":1474368873000},"page":"3-17","update-policy":"https:\/\/doi.org\/10.1007\/springer_crossmark_policy","source":"Crossref","is-referenced-by-count":68,"title":["A Vector-Contraction Inequality for Rademacher Complexities"],"prefix":"10.1007","author":[{"given":"Andreas","family":"Maurer","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","published-online":{"date-parts":[[2016,9,21]]},"reference":[{"key":"1_CR1","first-page":"463","volume":"3","author":"PL Bartlett","year":"2002","unstructured":"Bartlett, P.L., Mendelson, S.: Rademacher and Gaussian complexities: risk bounds and structural results. J. Mach. Learn. Res. 3, 463\u2013482 (2002)","journal-title":"J. Mach. Learn. Res."},{"key":"1_CR2","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1613\/jair.731","volume":"12","author":"J Baxter","year":"2000","unstructured":"Baxter, J.: A model of inductive bias learning. J. Artif. Intell. Res. 12, 149\u2013198 (2000)","journal-title":"J. Artif. Intell. Res."},{"issue":"2","key":"1_CR3","doi-asserted-by":"publisher","first-page":"781","DOI":"10.1109\/TIT.2007.913516","volume":"54","author":"G Biau","year":"2008","unstructured":"Biau, G., Devroye, L., Lugosi, G.: On the performance of clustering in Hilbert spaces. IEEE Trans. Inf. Theory 54(2), 781\u2013790 (2008)","journal-title":"IEEE Trans. Inf. Theory"},{"key":"1_CR4","doi-asserted-by":"publisher","DOI":"10.1093\/acprof:oso\/9780199535255.001.0001","volume-title":"Concentration Inequalities","author":"S Boucheron","year":"2013","unstructured":"Boucheron, S., Lugosi, G., Massart, P.: Concentration Inequalities. Oxford University Press, Oxford (2013)"},{"key":"1_CR5","doi-asserted-by":"publisher","first-page":"331","DOI":"10.1007\/s10208-006-0196-8","volume":"7","author":"A Caponnetto","year":"2007","unstructured":"Caponnetto, A., De Vito, E.: Optimal rates for regularized least-squares algorithm. Found. Comput. Math. 7, 331\u2013368 (2007)","journal-title":"Found. Comput. Math."},{"issue":"3","key":"1_CR6","doi-asserted-by":"publisher","first-page":"216","DOI":"10.1007\/s10791-009-9110-3","volume":"13","author":"O Chapelle","year":"2010","unstructured":"Chapelle, O., Wu, M.: Gradient descent optimization of smoothed information retrieval metrics. Inf. Retr. 13(3), 216\u2013235 (2010)","journal-title":"Inf. Retr."},{"key":"1_CR7","unstructured":"Chaudhuri, S., Tewari, A.: Generalization bounds for learning to rank: does the length of document lists matter? In: ICML 2015 (2015)"},{"key":"1_CR8","unstructured":"Ciliberto, C., Poggio, T., Rosasco, L.: Convex learning of multiple tasks and their structure (2015). arXiv preprint: arXiv:1504.03101"},{"key":"1_CR9","first-page":"265","volume":"2","author":"K Crammer","year":"2002","unstructured":"Crammer, K., Singer, Y.: On the algorithmic implementation of multiclass kernel-based vector machines. J. Mach. Learn. Res. 2, 265\u2013292 (2002)","journal-title":"J. Mach. Learn. Res."},{"key":"1_CR10","first-page":"1865","volume":"13","author":"SM Kakade","year":"2012","unstructured":"Kakade, S.M., Shalev-Shwartz, S., Tewari, A.: Regularization techniques for learning with matrices. J. Mach. Learn. Res. 13, 1865\u20131890 (2012)","journal-title":"J. Mach. Learn. Res."},{"issue":"1","key":"1_CR11","doi-asserted-by":"crossref","first-page":"1","DOI":"10.1214\/aos\/1015362183","volume":"30","author":"V Koltchinskii","year":"2002","unstructured":"Koltchinskii, V., Panchenko, D.: Empirical margin distributions and bounding the generalization error of combined classifiers. Ann. Stat. 30(1), 1\u201350 (2002)","journal-title":"Ann. Stat."},{"key":"1_CR12","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-20212-4","volume-title":"Probability in Banach Spaces: Isoperimetry and Processes","author":"M Ledoux","year":"1991","unstructured":"Ledoux, M., Talagrand, M.: Probability in Banach Spaces: Isoperimetry and Processes. Springer, Berlin (1991)"},{"key":"1_CR13","unstructured":"Lei, Y., Dogan, U., Binder, A., Kloft, M.: Multi-class SVMs: from tighter data-dependent generalization bounds to novel algorithms. In: Advances in Neural Information Processing Systems, pp. 2026\u20132034 (2015)"},{"issue":"3","key":"1_CR14","doi-asserted-by":"publisher","first-page":"327","DOI":"10.1007\/s10994-009-5109-7","volume":"75","author":"A Maurer","year":"2009","unstructured":"Maurer, A.: Transfer bounds for linear feature learning. Mach. Learn. 75(3), 327\u2013350 (2009)","journal-title":"Mach. Learn."},{"issue":"11","key":"1_CR15","doi-asserted-by":"publisher","first-page":"5839","DOI":"10.1109\/TIT.2010.2069250","volume":"56","author":"A Maurer","year":"2010","unstructured":"Maurer, A., Pontil, M.: K-dimensional coding schemes in Hilbert spaces. IEEE Trans. Inf. Theory 56(11), 5839\u20135846 (2010)","journal-title":"IEEE Trans. Inf. Theory"},{"issue":"81","key":"1_CR16","first-page":"1","volume":"17","author":"A Maurer","year":"2016","unstructured":"Maurer, A., Pontil, M., Romera-Paredes, B.: The benefit of multitask representation learning. J. Mach. Learn. Res. 17(81), 1\u201332 (2016)","journal-title":"J. Mach. Learn. Res."},{"key":"1_CR17","unstructured":"McDonald, D.J., Shalizi, C.R., Schervish, M.: Generalization error bounds for stationary autoregressive models (2011). arXiv preprint: arXiv:1103.0942"},{"key":"1_CR18","first-page":"839","volume":"4","author":"R Meir","year":"2003","unstructured":"Meir, R., Zhang, T.: Generalization error bounds for Bayesian mixture algorithms. J. Mach. Learn. Res. 4, 839\u2013860 (2003)","journal-title":"J. Mach. Learn. Res."},{"key":"1_CR19","first-page":"615","volume":"6","author":"CA Michelli","year":"2005","unstructured":"Michelli, C.A., Pontil, M.: On learning vector-valued functions. J. Mach. Learn. Res. 6, 615\u2013637 (2005)","journal-title":"J. Mach. Learn. Res."},{"key":"1_CR20","unstructured":"Mroueh, Y., Poggio, T., Rosasco, L., Slotine, J.J.: Multiclass learning with simplex coding. In: Advances in Neural Information Processing Systems, pp. 2789\u20132797 (2012)"},{"key":"1_CR21","doi-asserted-by":"publisher","first-page":"463","DOI":"10.1002\/j.1538-7305.1962.tb02419.x","volume":"41","author":"D Slepian","year":"1962","unstructured":"Slepian, D.: The one-sided barrier problem for Gaussian noise. Bell Syst. Tech. J. 41, 463\u2013501 (1962)","journal-title":"Bell Syst. Tech. J."},{"key":"1_CR22","doi-asserted-by":"crossref","first-page":"197","DOI":"10.4064\/sm-58-2-197-208","volume":"58","author":"S Szarek","year":"1976","unstructured":"Szarek, S.: On the best constants in the Khintchine inequality. Stud. Math. 58, 197\u2013208 (1976)","journal-title":"Stud. Math."}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"language":"en","link":[{"URL":"https:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-319-46379-7_1","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,11]],"date-time":"2024-03-11T14:04:55Z","timestamp":1710165895000},"score":1,"resource":{"primary":{"URL":"https:\/\/link.springer.com\/10.1007\/978-3-319-46379-7_1"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2016]]},"ISBN":["9783319463780","9783319463797"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/978-3-319-46379-7_1","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2016]]},"assertion":[{"value":"21 September 2016","order":1,"name":"first_online","label":"First Online","group":{"name":"ChapterHistory","label":"Chapter History"}},{"value":"ALT","order":1,"name":"conference_acronym","label":"Conference Acronym","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"International Conference on Algorithmic Learning Theory","order":2,"name":"conference_name","label":"Conference Name","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Bari","order":3,"name":"conference_city","label":"Conference City","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"Italy","order":4,"name":"conference_country","label":"Conference Country","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"2016","order":5,"name":"conference_year","label":"Conference Year","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"19 October 2016","order":7,"name":"conference_start_date","label":"Conference Start Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"21 October 2016","order":8,"name":"conference_end_date","label":"Conference End Date","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"27","order":9,"name":"conference_number","label":"Conference Number","group":{"name":"ConferenceInfo","label":"Conference Information"}},{"value":"alt2016","order":10,"name":"conference_id","label":"Conference ID","group":{"name":"ConferenceInfo","label":"Conference Information"}}]}}