{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,11,11]],"date-time":"2026-11-11T06:36:03Z","timestamp":1794378963018,"version":"4.9.0"},"publisher-location":"Berlin, Heidelberg","reference-count":22,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"value":"9783540265566","type":"print"},{"value":"9783540318927","type":"electronic"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2005]]},"DOI":"10.1007\/11503415_25","type":"book-chapter","created":{"date-parts":[[2010,7,14]],"date-time":"2010-07-14T18:16:38Z","timestamp":1279131398000},"page":"366-381","source":"Crossref","is-referenced-by-count":6,"title":["Leaving the Span"],"prefix":"10.1007","author":[{"given":"Manfred K.","family":"Warmuth","sequence":"first","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]},{"given":"S. V. N.","family":"Vishwanathan","sequence":"additional","affiliation":[],"role":[{"vocabulary":"crossref","role":"author"}]}],"member":"297","reference":[{"issue":"3","key":"25_CR1","doi-asserted-by":"publisher","first-page":"211","DOI":"10.1023\/A:1010896012157","volume":"43","author":"K. Azoury","year":"2001","unstructured":"Azoury, K., Warmuth, M.K.: Relative loss bounds for on-line density estimation with the exponential family of distributions. Machine Learning\u00a043(3), 211\u2013246 (2001); Special issue on Theoretical Advances in On-line Learning, Game Theory and Boosting","journal-title":"Machine Learning"},{"key":"25_CR2","doi-asserted-by":"publisher","first-page":"441","DOI":"10.1162\/153244303321897681","volume":"3","author":"S. Ben-David","year":"2002","unstructured":"Ben-David, S., Eiron, N., Simon, H.U.: Limitations of learning via embeddings in Euclidean half-spaces. Journal of Machine Learning Research\u00a03, 441\u2013461 (2002)","journal-title":"Journal of Machine Learning Research"},{"key":"25_CR3","unstructured":"Cristianini, N., Campbell, C., Shawe-Taylor, J.: Multiplicative updatings for support vector learning. In: Proc. of European Symposium on Artificial Neural Networks, pp. 189\u2013194 (1999)"},{"key":"25_CR4","volume-title":"Handbook of the Geometry of Banach Spaces","author":"K.R. Davidson","year":"2003","unstructured":"Davidson, K.R., Szarek, S.J.: Banach space theory and local operator theory. In: Lindenstrauss, J., Johnson, W. (eds.) Handbook of the Geometry of Banach Spaces, North-Holland, Amsterdam (2003)"},{"key":"25_CR5","doi-asserted-by":"crossref","first-page":"402","DOI":"10.1007\/3-540-44581-1_26","volume-title":"Proc. of the 14th Annual Conference on Computational Learning Theory","author":"J. Forster","year":"2001","unstructured":"Forster, J., Schmitt, N., Simon, H.U.: Estimating the optimal margins of embeddings in Euclidean half spaces. In: Proc. of the 14th Annual Conference on Computational Learning Theory, pp. 402\u2013415. Springer, Heidelberg (2001)"},{"key":"25_CR6","first-page":"1","volume-title":"Proc. 12th Annu. Conf. on Comput. Learning Theory","author":"C. Gentile","year":"1999","unstructured":"Gentile, C., Littlestone, N.: The robustness of the p-norm algorithms. In: Proc. 12th Annu. Conf. on Comput. Learning Theory, pp. 1\u201311. ACM Press, New York (1999)"},{"key":"25_CR7","first-page":"225","volume-title":"Advances in Neural Information Processing Systems 11","author":"C. Gentile","year":"1999","unstructured":"Gentile, C., Warmuth, M.K.: Linear hinge loss and average margin. In: Kearns, M.S., Solla, S.A., Cohn, D.A. (eds.) Advances in Neural Information Processing Systems 11, Cambridge, MA, pp. 225\u2013231. MIT Press, Cambridge (1999)"},{"issue":"6","key":"25_CR8","doi-asserted-by":"publisher","first-page":"1291","DOI":"10.1109\/72.809075","volume":"10","author":"D.P. Helmbold","year":"1999","unstructured":"Helmbold, D.P., Kivinen, J., Warmuth, M.K.: Relative loss bounds for single neurons. IEEE Transactions on Neural Networks\u00a010(6), 1291\u20131304 (1999)","journal-title":"IEEE Transactions on Neural Networks"},{"key":"25_CR9","volume-title":"The Structure of Version Space","author":"R. Herbrich","year":"2005","unstructured":"Herbrich, R., Graepel, T., Williamson, R.C.: Innovations in Machine Learning. In: Holmes, D., Jain, L.C. (eds.) The Structure of Version Space, January 2005, Springer, Heidelberg (2005)"},{"key":"25_CR10","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511810817","volume-title":"Matrix Analysis","author":"R.A. Horn","year":"1985","unstructured":"Horn, R.A., Johnson, C.R.: Matrix Analysis. Cambridge University Press, Cambridge (1985)"},{"key":"25_CR11","doi-asserted-by":"crossref","unstructured":"Khardon, R., Roth, D., Servedio, R.: Efficiency versus convergence of Boolean kernels for on-line learning algorithms. In: Advances in Neural Information Processing Systems 14, pp. 423\u2013430 (2001)","DOI":"10.7551\/mitpress\/1120.003.0059"},{"key":"25_CR12","doi-asserted-by":"publisher","first-page":"82","DOI":"10.1016\/0022-247X(71)90184-3","volume":"33","author":"G.S. Kimeldorf","year":"1971","unstructured":"Kimeldorf, G.S., Wahba, G.: Some results on Tchebycheffian spline functions. J.\u00a0Math.\u00a0Anal.\u00a0Applic.\u00a033, 82\u201395 (1971)","journal-title":"J.\u00a0Math.\u00a0Anal.\u00a0Applic."},{"issue":"3","key":"25_CR13","doi-asserted-by":"publisher","first-page":"301","DOI":"10.1023\/A:1017938623079","volume":"45","author":"J. Kivinen","year":"2001","unstructured":"Kivinen, J., Warmuth, M.K.: Relative loss bounds for multidimensional regression problems. Machine Learning\u00a045(3), 301\u2013329 (2001)","journal-title":"Machine Learning"},{"issue":"1","key":"25_CR14","doi-asserted-by":"publisher","first-page":"1","DOI":"10.1006\/inco.1996.2612","volume":"132","author":"J. Kivinen","year":"1997","unstructured":"Kivinen, J., Warmuth, M.K.: Exponentiated gradient versus gradient descent for linear predictors. Information and Computation\u00a0132(1), 1\u201364 (1997)","journal-title":"Information and Computation"},{"issue":"1 - 2","key":"25_CR15","doi-asserted-by":"publisher","first-page":"325","DOI":"10.1016\/S0004-3702(97)00039-8","volume":"97","author":"J. Kivinen","year":"1997","unstructured":"Kivinen, J., Warmuth, M.K., Auer, P.: The perceptron learning algorithm vs.\u00a0Winnow: Linear vs.\u00a0logarithmic mistake bounds when few input variables are relevant. Artificial Intelligence\u00a097(1 - 2), 325\u2013343 (1997)","journal-title":"Artificial Intelligence"},{"key":"25_CR16","first-page":"285","volume":"2","author":"N. Littlestone","year":"1988","unstructured":"Littlestone, N.: Learning quickly when irrelevant attributes abound: A new linear-threshold algorithm. Machine Learning\u00a02, 285\u2013318 (1988)","journal-title":"Machine Learning"},{"issue":"2","key":"25_CR17","doi-asserted-by":"publisher","first-page":"508","DOI":"10.1016\/S0022-1236(03)00198-8","volume":"211","author":"M.W. Meckes","year":"2004","unstructured":"Meckes, M.W.: Concentration of norms and eigenvalues of random matrices. Journal of Functional Analysis\u00a0211(2), 508\u2013524 (2004)","journal-title":"Journal of Functional Analysis"},{"issue":"1","key":"25_CR18","doi-asserted-by":"publisher","first-page":"95","DOI":"10.1145\/138027.138042","volume":"40","author":"L. Pitt","year":"1993","unstructured":"Pitt, L., Warmuth, M.K.: The minimum consistent DFA problem cannot be approximated within any polynomial. Journal of the ACM\u00a040(1), 95\u2013142 (1993)","journal-title":"Journal of the ACM"},{"key":"25_CR19","doi-asserted-by":"publisher","first-page":"1651","DOI":"10.1214\/aos\/1024691352","volume":"26","author":"R. Schapire","year":"1998","unstructured":"Schapire, R., Freund, Y., Bartlett, P.L., Lee, W.S.: Boosting the margin: A new explanation for the effectiveness of voting methods. Annals of Statistics\u00a026, 1651\u20131686 (1998)","journal-title":"Annals of Statistics"},{"key":"25_CR20","series-title":"Lecture Notes in Artificial Intelligence","doi-asserted-by":"publisher","first-page":"416","DOI":"10.1007\/3-540-44581-1_27","volume-title":"Computational Learning Theory","author":"B. Sch\u00f6lkopf","year":"2001","unstructured":"Sch\u00f6lkopf, B., Herbrich, R., Smola, A.J.: A generalized representer theorem. In: Helmbold, D.P., Williamson, B. (eds.) COLT 2001 and EuroCOLT 2001. LNCS (LNAI), vol.\u00a02111, pp. 416\u2013426. Springer, Heidelberg (2001)"},{"key":"25_CR21","doi-asserted-by":"publisher","first-page":"773","DOI":"10.1162\/1532443041424328","volume":"4","author":"E. Takimoto","year":"2003","unstructured":"Takimoto, E., Warmuth, M.K.: Path kernels and multiplicative updates. Journal of Machine Learning Research\u00a04, 773\u2013818 (2003)","journal-title":"Journal of Machine Learning Research"},{"key":"25_CR22","series-title":"LNAI","doi-asserted-by":"crossref","first-page":"78","DOI":"10.1007\/3-540-51734-0_53","volume-title":"Analogical and Inductive Inference","author":"M.K. Warmuth","year":"1989","unstructured":"Warmuth, M.K.: Towards representation independence in PAC-learning. In: Jantke, J.P. (ed.) AII 1989. LNCS (LNAI), vol.\u00a0397, pp. 78\u2013103. Springer, Heidelberg (1989)"}],"container-title":["Lecture Notes in Computer Science","Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/11503415_25.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,28]],"date-time":"2024-03-28T05:42:23Z","timestamp":1711604543000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/11503415_25"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2005]]},"ISBN":["9783540265566","9783540318927"],"references-count":22,"URL":"https:\/\/doi.org\/10.1007\/11503415_25","relation":{"is-part-of":[{"id-type":"doi","id":"https:\/\/doi.org\/10.1007\/b137542","asserted-by":"object"}]},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"value":"0302-9743","type":"print"},{"value":"1611-3349","type":"electronic"}],"subject":[],"published":{"date-parts":[[2005]]}}}