{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,8,2]],"date-time":"2025-08-02T05:02:30Z","timestamp":1754110950950},"publisher-location":"Berlin, Heidelberg","reference-count":24,"publisher":"Springer Berlin Heidelberg","isbn-type":[{"type":"print","value":"9783540879862"},{"type":"electronic","value":"9783540879879"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2008]]},"DOI":"10.1007\/978-3-540-87987-9_23","type":"book-chapter","created":{"date-parts":[[2009,3,17]],"date-time":"2009-03-17T07:20:06Z","timestamp":1237274406000},"page":"256-271","source":"Crossref","is-referenced-by-count":24,"title":["Entropy Regularized LPBoost"],"prefix":"10.1007","author":[{"given":"Manfred K.","family":"Warmuth","sequence":"first","affiliation":[]},{"given":"Karen A.","family":"Glocer","sequence":"additional","affiliation":[]},{"given":"S. V. N.","family":"Vishwanathan","sequence":"additional","affiliation":[]}],"member":"297","reference":[{"issue":"3","key":"23_CR1","first-page":"299","volume":"E84-D","author":"N. Abe","year":"2001","unstructured":"Abe, N., Takeuchi, J., Warmuth, M.K.: Polynomial learnability of stochastic rules with respect to the KL-divergence and quadratic distance. IEICE Transactions on Information and Systems\u00a0E84-D(3), 299\u2013316 (2001)","journal-title":"IEICE Transactions on Information and Systems"},{"key":"23_CR2","doi-asserted-by":"crossref","DOI":"10.1017\/CBO9780511804441","volume-title":"Convex Optimization","author":"S. Boyd","year":"2004","unstructured":"Boyd, S., Vandenberghe, L.: Convex Optimization. Cambridge University Press, Cambridge (2004)"},{"issue":"1-3","key":"23_CR3","doi-asserted-by":"publisher","first-page":"225","DOI":"10.1023\/A:1012470815092","volume":"46","author":"A. Demiriz","year":"2002","unstructured":"Demiriz, A., Bennett, K.P., Shawe-Taylor, J.: Linear programming boosting via column generation. Mach. Learn.\u00a046(1-3), 225\u2013254 (2002)","journal-title":"Mach. Learn."},{"key":"23_CR4","first-page":"258","volume-title":"Advances in Neural Information Processing Systems 12","author":"N. Duffy","year":"2000","unstructured":"Duffy, N., Helmbold, D.: Potential boosters? In: Solla, S., Leen, T., M\u00fcller, K.-R. (eds.) Advances in Neural Information Processing Systems 12, pp. 258\u2013264. MIT Press, Cambridge (2000)"},{"issue":"2","key":"23_CR5","doi-asserted-by":"publisher","first-page":"256","DOI":"10.1006\/inco.1995.1136","volume":"121","author":"Y. Freund","year":"1995","unstructured":"Freund, Y.: Boosting a weak learning algorithm by majority. Inform. Comput.\u00a0121(2), 256\u2013285 (1995); In: COLT 1990","journal-title":"Inform. Comput."},{"key":"23_CR6","doi-asserted-by":"crossref","first-page":"102","DOI":"10.1145\/307400.307419","volume-title":"Proceedings of the 12th annual conference on Computational learning theory","author":"Y. Freund","year":"1999","unstructured":"Freund, Y.: An adaptive version of the boost by majority algorithm. In: Proceedings of the 12th annual conference on Computational learning theory, pp. 102\u2013113. ACM Press, New York (1999)"},{"issue":"1","key":"23_CR7","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1006\/jcss.1997.1504","volume":"55","author":"Y. Freund","year":"1997","unstructured":"Freund, Y., Schapire, R.: A decision-theoretic generalization of on-line learning and an application to boosting. Journal of Computer and System Sciences\u00a055(1), 119\u2013139 (1997)","journal-title":"Journal of Computer and System Sciences"},{"key":"23_CR8","doi-asserted-by":"crossref","unstructured":"Friedman, J., Hastie, T., Tibshirani, R.: Additive Logistic Regression: a Statistical View of Boosting. The Annals of Statistics\u00a038(2) (2000)","DOI":"10.1214\/aos\/1016218223"},{"key":"23_CR9","unstructured":"Grove, A.J., Schuurmans, D.: Boosting in the limit: maximizing the margin of learned ensembles. In: AAAI 1998\/IAAI 1998, Menlo Park, CA, USA, pp. 692\u2013699 (1998)"},{"issue":"1","key":"23_CR10","doi-asserted-by":"publisher","first-page":"97","DOI":"10.1023\/A:1007301011561","volume":"27","author":"D. Helmbold","year":"1997","unstructured":"Helmbold, D., Schapire, R.E., Singer, Y., Warmuth, M.K.: A comparison of new and old algorithms for a mixture estimation problem. Machine Learning\u00a027(1), 97\u2013119 (1997)","journal-title":"Machine Learning"},{"key":"23_CR11","first-page":"134","volume-title":"Proc. 12th Annu. Conf. on Comput. Learning Theory","author":"J. Kivinen","year":"1999","unstructured":"Kivinen, J., Warmuth, M.K.: Boosting as entropy projection. In: Proc. 12th Annu. Conf. on Comput. Learning Theory, pp. 134\u2013144. ACM Press, New York (1999)"},{"key":"23_CR12","doi-asserted-by":"crossref","first-page":"125","DOI":"10.1145\/307400.307422","volume-title":"Proceedings of the 12th Annual Conference on Computional Learning Theory","author":"J. Lafferty","year":"1999","unstructured":"Lafferty, J.: Additive models, boosting, and inference for generalized divergences. In: Proceedings of the 12th Annual Conference on Computional Learning Theory, pp. 125\u2013133. ACM Press, New York (1999)"},{"key":"23_CR13","unstructured":"Liao, J.: Totally Corrective Boosting Algorithms that Maximize the Margin. PhD thesis, University of California at Santa Cruz (December 2006)"},{"key":"23_CR14","unstructured":"R\u00e4tsch, G.: Robust Boosting via Convex Optimization: Theory and Applications. PhD thesis, University of Potsdam (2001)"},{"issue":"3","key":"23_CR15","doi-asserted-by":"publisher","first-page":"287","DOI":"10.1023\/A:1007618119488","volume":"42","author":"G. R\u00e4tsch","year":"2001","unstructured":"R\u00e4tsch, G., Onoda, T., M\u00fcller, K.-R.: Soft margins for adaboost. Mach. Learn.\u00a042(3), 287\u2013320 (2001)","journal-title":"Mach. Learn."},{"key":"23_CR16","doi-asserted-by":"crossref","first-page":"207","DOI":"10.7551\/mitpress\/1113.003.0016","volume-title":"Advances in Large Margin Classifiers","author":"G. R\u00e4tsch","year":"2000","unstructured":"R\u00e4tsch, G., Sch\u00f6lkopf, B., Smola, A., Mika, S., Onoda, T., M\u00fcller, K.-R.: Robust ensemble learning. In: Smola, A., Bartlett, P., Sch\u00f6lkopf, B., Schuurmans, D. (eds.) Advances in Large Margin Classifiers, pp. 207\u2013219. MIT Press, Cambridge, MA (2000)"},{"key":"23_CR17","first-page":"2131","volume":"6","author":"G. R\u00e4tsch","year":"2005","unstructured":"R\u00e4tsch, G., Warmuth, M.: Efficient margin maximizing with boosting. Journal of Machine Learning Research\u00a06, 2131\u20132152 (2005)","journal-title":"Journal of Machine Learning Research"},{"key":"23_CR18","doi-asserted-by":"crossref","unstructured":"Rudin, C., Schapire, R., Daubechies, I.: Boosting based on a smooth margin. In: Proceedings of the 17th Annual Conference on Computational Learning Theory, pp. 502\u2013517 (2004)","DOI":"10.1007\/978-3-540-27819-1_35"},{"issue":"35","key":"23_CR19","doi-asserted-by":"publisher","first-page":"2723","DOI":"10.1214\/009053607000000785","volume":"6","author":"C. Rudin","year":"2007","unstructured":"Rudin, C., Schapire, R., Daubechies, I.: Analysis of boosting algorithms using the smooth margin function. The Annals of Statistics\u00a06(35), 2723\u20132768 (2007)","journal-title":"The Annals of Statistics"},{"issue":"5","key":"23_CR20","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., Lee, W.: Boosting the margin: A new explanation for the effectiveness of voting methods. The Annals of Statistics\u00a026(5), 1651\u20131686 (1998)","journal-title":"The Annals of Statistics"},{"key":"23_CR21","unstructured":"Shalev-Shwartz, S., Singer, Y.: On the equivalence of weak learnability and linear separability: New relaxations and efficient boosting algorithms. In: Proceedings of the 21st annual conference on Computational learning theory, pp. 311\u2013321. Omicron (2008)"},{"key":"23_CR22","first-page":"1377","volume-title":"Advances in Neural Information Processing Systems 20","author":"A. Smola","year":"2008","unstructured":"Smola, A., Vishwanathan, S.V.N., Le, Q.: Bundle methods for machine learning. In: Platt, J., Koller, D., Singer, Y., Roweis, S. (eds.) Advances in Neural Information Processing Systems 20, pp. 1377\u20131384. MIT Press, Cambridge (2008)"},{"key":"23_CR23","doi-asserted-by":"publisher","first-page":"1001","DOI":"10.1145\/1143844.1143970","volume-title":"Proc. ICML 2006","author":"M. Warmuth","year":"2006","unstructured":"Warmuth, M., Liao, J., R\u00e4tsch, G.: Totally corrective boosting algorithms that maximize the margin. In: ICML 2006, pp. 1001\u20131008. ACM Press, New York (2006)"},{"key":"23_CR24","volume-title":"Advances in Neural Information Processing Systems 20","author":"M.K. Warmuth","year":"2007","unstructured":"Warmuth, M.K., Glocer, K., R\u00e4tsch, G.: Boosting algorithms for maximizing the soft margin. In: Platt, J., Koller, D., Singer, Y., Roweis, S. (eds.) Advances in Neural Information Processing Systems 20. MIT Press, Cambridge (2007)"}],"container-title":["Lecture Notes in Computer Science","Algorithmic Learning Theory"],"original-title":[],"link":[{"URL":"http:\/\/link.springer.com\/content\/pdf\/10.1007\/978-3-540-87987-9_23.pdf","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,3,11]],"date-time":"2024-03-11T15:44:37Z","timestamp":1710171877000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/978-3-540-87987-9_23"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2008]]},"ISBN":["9783540879862","9783540879879"],"references-count":24,"URL":"https:\/\/doi.org\/10.1007\/978-3-540-87987-9_23","relation":{},"ISSN":["0302-9743","1611-3349"],"issn-type":[{"type":"print","value":"0302-9743"},{"type":"electronic","value":"1611-3349"}],"subject":[],"published":{"date-parts":[[2008]]}}}