{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,10,30]],"date-time":"2025-10-30T06:58:56Z","timestamp":1761807536682},"reference-count":32,"publisher":"Springer Science and Business Media LLC","issue":"2-3","license":[{"start":{"date-parts":[[2010,5,4]],"date-time":"2010-05-04T00:00:00Z","timestamp":1272931200000},"content-version":"tdm","delay-in-days":0,"URL":"http:\/\/www.springer.com\/tdm"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["Mach Learn"],"published-print":{"date-parts":[[2010,9]]},"DOI":"10.1007\/s10994-010-5173-z","type":"journal-article","created":{"date-parts":[[2010,5,3]],"date-time":"2010-05-03T20:35:26Z","timestamp":1272918926000},"page":"141-163","source":"Crossref","is-referenced-by-count":18,"title":["On the equivalence of weak learnability and linear separability: new relaxations and efficient boosting algorithms"],"prefix":"10.1007","volume":"80","author":[{"given":"Shai","family":"Shalev-Shwartz","sequence":"first","affiliation":[]},{"given":"Yoram","family":"Singer","sequence":"additional","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2010,5,4]]},"reference":[{"key":"5173_CR1","doi-asserted-by":"crossref","DOI":"10.1007\/978-0-387-31256-9","volume-title":"Convex analysis and nonlinear optimization","author":"J. Borwein","year":"2006","unstructured":"Borwein,\u00a0J., & Lewis,\u00a0A. (2006). Convex analysis and nonlinear optimization. Berlin: Springer."},{"key":"5173_CR2","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex optimization","author":"S. Boyd","year":"2004","unstructured":"Boyd,\u00a0S., & Vandenberghe,\u00a0L. (2004). Convex optimization. Cambridge: Cambridge University Press."},{"key":"5173_CR3","volume-title":"Parallel optimization: theory, algorithms, and applications","author":"Y. Censor","year":"1997","unstructured":"Censor,\u00a0Y., & Zenios, S. A. (1997). Parallel optimization: theory, algorithms, and applications. New York: Oxford University Press."},{"issue":"2\/3","key":"5173_CR4","doi-asserted-by":"crossref","first-page":"253","DOI":"10.1023\/A:1013912006537","volume":"47","author":"M. Collins","year":"2002","unstructured":"Collins,\u00a0M., Schapire, R. E., & Singer,\u00a0Y. (2002). Logistic regression, AdaBoost and Bregman distances. Machine Learning, 47(2\/3), 253\u2013285.","journal-title":"Machine Learning"},{"key":"5173_CR5","volume-title":"An introduction to support vector machines","author":"N. Cristianini","year":"2000","unstructured":"Cristianini,\u00a0N., & Shawe-Taylor,\u00a0J. (2000). An introduction to support vector machines. Cambridge: Cambridge University Press."},{"key":"5173_CR6","unstructured":"Domingo,\u00a0C., & Watanabe,\u00a0O. (2000). Madaboost: a modification of adaboost. In Proceedings of the thirteenth annual conference on computational learning theory."},{"key":"5173_CR7","doi-asserted-by":"crossref","unstructured":"Duchi,\u00a0J., Shalev-Shwartz,\u00a0S., Singer,\u00a0Y., & Chandra,\u00a0T. (2008). Efficient projections onto the \u2113 1-ball for learning in high dimensions. In Proceedings of the 25th international conference on machine learning.","DOI":"10.1145\/1390156.1390191"},{"issue":"3","key":"5173_CR8","doi-asserted-by":"crossref","first-page":"293","DOI":"10.1023\/A:1010852229904","volume":"43","author":"Y. Freund","year":"2001","unstructured":"Freund,\u00a0Y. (2001). An adaptive version of the boost by majority algorithm. Machine Learning, 43(3), 293\u2013318.","journal-title":"Machine Learning"},{"key":"5173_CR9","doi-asserted-by":"crossref","unstructured":"Freund,\u00a0Y., & Schapire, R. E. (1996). Game theory, on-line prediction and boosting. In Proceedings of the ninth annual conference on computational learning theory (pp.\u00a0325\u2013332).","DOI":"10.1145\/238061.238163"},{"issue":"5","key":"5173_CR10","first-page":"771","volume":"14","author":"Y. Freund","year":"1999","unstructured":"Freund,\u00a0Y., & Schapire, R. E. (1999). A short introduction to boosting. Journal of Japanese Society for Artificial Intelligence, 14(5), 771\u2013780.","journal-title":"Journal of Japanese Society for Artificial Intelligence"},{"key":"5173_CR11","first-page":"281","volume":"1","author":"M. Herbster","year":"2001","unstructured":"Herbster,\u00a0M., & Warmuth,\u00a0M. (2001). Tracking the best linear predictor. Journal of Machine Learning Research, 1, 281\u2013309.","journal-title":"Journal of Machine Learning Research"},{"key":"5173_CR12","unstructured":"Koltchinskii,\u00a0V., Panchenko,\u00a0D., & Lozano,\u00a0F. (2001). Some new bounds on the generalization error of combined classifiers. In Advances in neural information processing systems, 14."},{"key":"5173_CR13","unstructured":"Mason,\u00a0L., Bartlett,\u00a0P., & Baxter,\u00a0J. (1998). Direct optimization of margins improves generalization in combined classifiers (Technical report). Department of Systems Engineering, Australian National University."},{"key":"5173_CR14","first-page":"119","volume-title":"Advanced lectures on machine learning","author":"R. Meir","year":"2003","unstructured":"Meir,\u00a0R., & R\u00e4tsch,\u00a0G. (2003). An introduction to boosting and leveraging. In Mendelson,\u00a0S., & Smola,\u00a0A. (Eds.), Advanced lectures on machine learning (pp.\u00a0119\u2013184). Berlin: Springer."},{"key":"5173_CR15","first-page":"2153","volume":"6","author":"G. Ratsch","year":"2005","unstructured":"Ratsch,\u00a0G., & Warmuth,\u00a0M. (2005). Efficient margin maximizing with boosting. Journal of Machine Learning Research, 6, 2153\u20132175.","journal-title":"Journal of Machine Learning Research"},{"key":"5173_CR16","doi-asserted-by":"crossref","unstructured":"Rudin,\u00a0C., Schapire, R. E., & Daubechies,\u00a0I. (2007). Analysis of boosting algorithms using the smooth margin function. Annals of Statistics.","DOI":"10.1214\/009053607000000785"},{"issue":"2","key":"5173_CR17","first-page":"197","volume":"5","author":"R. E. Schapire","year":"1990","unstructured":"Schapire, R. E. (1990). The strength of weak learnability. Machine Learning, 5(2), 197\u2013227.","journal-title":"Machine Learning"},{"key":"5173_CR18","volume-title":"Nonlinear estimation and classification","author":"R. E. Schapire","year":"2003","unstructured":"Schapire, R. E. (2003). The boosting approach to machine learning: an overview. In Denison, D. D., Hansen, M. H., Holmes,\u00a0C., Mallick,\u00a0B., & Yu,\u00a0B. (Eds.), Nonlinear estimation and classification. Berlin: Springer."},{"key":"5173_CR19","unstructured":"Schapire, R. E., Freund,\u00a0Y., Bartlett,\u00a0P., & Lee, W. S. (1997). Boosting the margin: a new explanation for the effectiveness of voting methods. In Machine learning: proceedings of the fourteenth international conference (pp.\u00a0322\u2013330)."},{"key":"5173_CR20","unstructured":"Sch\u00f6lkopf,\u00a0B., Smola,\u00a0A., Williamson,\u00a0R., & Bartlett,\u00a0P. (1998). New support vector algorithms (Technical Report NC2-TR-1998-053). NeuroColt2."},{"key":"5173_CR21","first-page":"633","volume":"4","author":"R. A. Servedio","year":"2003","unstructured":"Servedio, R. A. (2003). Smooth boosting and learning with malicious noise. Journal of Machine Learning Research, 4, 633\u2013648.","journal-title":"Journal of Machine Learning Research"},{"key":"5173_CR22","unstructured":"Shalev-Shwartz,\u00a0S. (2007). Online learning: theory, algorithms, and applications. PhD thesis, The Hebrew University."},{"issue":"7","key":"5173_CR23","first-page":"1567","volume":"7","author":"S. Shalev-Shwartz","year":"2006","unstructured":"Shalev-Shwartz,\u00a0S., & Singer,\u00a0Y. (2006a). Efficient learning of label ranking by soft projections onto polyhedra. Journal of Machine Learning Research, 7(7), 1567\u20131599.","journal-title":"Journal of Machine Learning Research"},{"key":"5173_CR24","doi-asserted-by":"crossref","unstructured":"Shalev-Shwartz,\u00a0S., & Singer,\u00a0Y. (2006b). Convex repeated games and Fenchel duality. In Advances in neural information processing systems, 20.","DOI":"10.7551\/mitpress\/7503.003.0163"},{"key":"5173_CR25","doi-asserted-by":"crossref","unstructured":"Shalev-Shwartz,\u00a0S., & Singer,\u00a0Y. (2007). A primal-dual perspective of online learning algorithms. Machine Learning Journal.","DOI":"10.1007\/s10994-007-5014-x"},{"key":"5173_CR26","unstructured":"Smola,\u00a0A., Vishwanathan, S. V. N., & Le,\u00a0Q. (2007). Bundle methods for machine learning. In Advances in neural information processing systems, 21."},{"key":"5173_CR27","volume-title":"Statistical learning theory","author":"V. N. Vapnik","year":"1998","unstructured":"Vapnik, V. N. (1998). Statistical learning theory. New York: Wiley."},{"key":"5173_CR28","doi-asserted-by":"crossref","first-page":"295","DOI":"10.1007\/BF01448847","volume":"100","author":"J. Neumann von","year":"1928","unstructured":"von Neumann,\u00a0J. (1928). Zur Theorie der Gesellschaftsspiele (On the theory of parlor games). Math. Ann., 100, 295\u2013320.","journal-title":"Math. Ann."},{"key":"5173_CR29","doi-asserted-by":"crossref","unstructured":"Warmuth,\u00a0M., Liao,\u00a0J., & Ratsch,\u00a0G. (2006). Totally corrective boosting algorithms that maximize the margin. In Proceedings of the 23rd international conference on machine learning (pp.\u00a01001\u20131008).","DOI":"10.1145\/1143844.1143970"},{"key":"5173_CR30","unstructured":"Warmuth,\u00a0M., Glocer,\u00a0K., & Ratsch,\u00a0G. (2007). Boosting algorithms for maximizing the soft margin. In Advances in neural information processing systems, 21."},{"key":"5173_CR31","doi-asserted-by":"crossref","unstructured":"Warmuth,\u00a0M., Glocer,\u00a0K., & Vishwanathan, S. V. N. (2008). Entropy regularized lpboost. In Algorithmic learning theory (ALT).","DOI":"10.1007\/978-3-540-87987-9_23"},{"key":"5173_CR32","doi-asserted-by":"crossref","first-page":"682","DOI":"10.1109\/TIT.2002.808136","volume":"49","author":"T. Zhang","year":"2003","unstructured":"Zhang,\u00a0T. (2003). Sequential greedy approximation for certain convex optimization problems. IEEE Transaction on Information Theory, 49, 682\u2013691.","journal-title":"IEEE Transaction on Information Theory"}],"container-title":["Machine Learning"],"original-title":[],"language":"en","link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-010-5173-z.pdf","content-type":"application\/pdf","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/article\/10.1007\/s10994-010-5173-z\/fulltext.html","content-type":"text\/html","content-version":"vor","intended-application":"text-mining"},{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/s10994-010-5173-z","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,26]],"date-time":"2024-03-26T11:06:51Z","timestamp":1711451211000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/s10994-010-5173-z"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2010,5,4]]},"references-count":32,"journal-issue":{"issue":"2-3","published-print":{"date-parts":[[2010,9]]}},"alternative-id":["5173"],"URL":"https:\/\/doi.org\/10.1007\/s10994-010-5173-z","relation":{},"ISSN":["0885-6125","1573-0565"],"issn-type":[{"value":"0885-6125","type":"print"},{"value":"1573-0565","type":"electronic"}],"subject":[],"published":{"date-parts":[[2010,5,4]]}}}