{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T01:50:21Z","timestamp":1773280221500,"version":"3.50.1"},"publisher-location":"Berlin, Heidelberg","reference-count":26,"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_31","type":"book-chapter","created":{"date-parts":[[2007,8,10]],"date-time":"2007-08-10T06:13:49Z","timestamp":1186726429000},"page":"473-489","source":"Crossref","is-referenced-by-count":29,"title":["Smooth Boosting and Learning with Malicious Noise"],"prefix":"10.1007","author":[{"given":"Rocco A.","family":"Servedio","sequence":"first","affiliation":[]}],"member":"297","published-online":{"date-parts":[[2001,9,13]]},"reference":[{"key":"31_CR1","doi-asserted-by":"publisher","first-page":"191","DOI":"10.1006\/jcss.1997.1558","volume":"56","author":"J. Aslam","year":"1998","unstructured":"J. Aslam and S. Decatur. Specification and simulation of statistical query algorithms for efficiency and noise tolerance, J. Comput. Syst. Sci. 56 (1998), 191\u2013208.","journal-title":"J. Comput. Syst. Sci."},{"issue":"1","key":"31_CR2","doi-asserted-by":"publisher","first-page":"159","DOI":"10.1016\/S0304-3975(97)00019-4","volume":"185","author":"P. Auer","year":"1997","unstructured":"P. Auer. Learning nested differences in the presence of malicious noise, Theoretical Computer Science 185(1) (1997), 159\u2013175.","journal-title":"Theoretical Computer Science"},{"key":"31_CR3","doi-asserted-by":"publisher","first-page":"83","DOI":"10.1023\/A:1018960107028","volume":"23","author":"P. Auer","year":"1998","unstructured":"P. Auer and N. Cesa-Bianchi. On-line learning with malicious noise and the closure algorithm, Ann. Math. and Artif. Intel. 23 (1998), 83\u201399.","journal-title":"Ann. Math. and Artif. Intel."},{"issue":"3","key":"31_CR4","doi-asserted-by":"publisher","first-page":"434","DOI":"10.1006\/jcss.1996.0033","volume":"52","author":"P. Bartlett","year":"1996","unstructured":"P. Bartlett, P. Long and R. Williamson. Fat-shattering and the learnability of real-valued functions, J. Comput. Syst. Sci., 52(3) (1996), 434\u2013452.","journal-title":"J. Comput. Syst. Sci."},{"key":"31_CR5","doi-asserted-by":"crossref","unstructured":"P. Bartlett and J. Shawe-Taylor. Generalization performance of support vector machines and other pattern classifiers, in B. Scholkopf, C.J.C. Burges, and A.J. Smola, eds, Advances in Kernel Methods-Support Vector Learning, (1999), 43\u201354.","DOI":"10.7551\/mitpress\/1130.003.0007"},{"issue":"5","key":"31_CR6","doi-asserted-by":"publisher","first-page":"684","DOI":"10.1145\/324133.324221","volume":"46","author":"N. Cesa-Bianchi","year":"1999","unstructured":"N. Cesa-Bianchi, E. Dichterman, P. Fischer, E. Shamir and H.U. Simon. Sampleefficient strategies for learning in the presence of noise, J. ACM 46(5) (1999), 684\u2013719.","journal-title":"J. ACM"},{"key":"31_CR7","doi-asserted-by":"crossref","unstructured":"S. Decatur. Statistical queries and faulty PAC oracles, in \u201cProc. Sixth Work. on Comp. Learning Theory\u201d (1993), 262\u2013268.","DOI":"10.1145\/168304.168346"},{"issue":"2","key":"31_CR8","doi-asserted-by":"publisher","first-page":"139","DOI":"10.1023\/A:1007607513941","volume":"40","author":"T.G. Dietterich","year":"2000","unstructured":"T.G. Dietterich. An experimental comparison of three methods for constructing ensembles of decision trees: Bagging, boosting, and randomization. Machine Learning, 40(2) (2000), 139\u2013158.","journal-title":"Machine Learning"},{"key":"31_CR9","unstructured":"C. Domingo and O. Watanabe. MadaBoost: a modification of AdaBoost. in \u201cProc. 13th Conf. on Comp. Learning Theory\u201d (2000), 180\u2013189."},{"key":"31_CR10","doi-asserted-by":"crossref","unstructured":"Y. Freund. An adaptive version of the boost by majority algorithm, in \u201cProc. Twelfth Conf. on Comp. Learning Theory\u201d (1999), 102\u2013113.","DOI":"10.1145\/307400.307419"},{"issue":"1","key":"31_CR11","doi-asserted-by":"publisher","first-page":"119","DOI":"10.1006\/jcss.1997.1504","volume":"55","author":"Y. Freund","year":"1997","unstructured":"Y. Freund and R. Schapire. A decision-theoretic generalization of on-line learning and an application to boosting, J. Comput. Syst. Sci. 55(1) (1997), 119\u2013139.","journal-title":"J. Comput. Syst. Sci."},{"key":"31_CR12","doi-asserted-by":"crossref","unstructured":"Y. Freund and R. Schapire. Large margin classification using the perceptron algorithm, in \u201cProc. 11th Conf. Comp. Learning Theory\u201d (1998), 209\u2013217.","DOI":"10.1145\/279943.279985"},{"key":"31_CR13","doi-asserted-by":"crossref","unstructured":"C. Gentile and N. Littlestone. The robustness of the p-norm algorithms, in \u201cProc. 12th Ann. Conf. on Comp. Learning Theory\u201d (1999), 1\u201311.","DOI":"10.1145\/307400.307405"},{"key":"31_CR14","doi-asserted-by":"crossref","unstructured":"A. Grove, N. Littlestone and D. Schuurmans. General convergence results for linear discriminant updates, in \u201cProc. 10th Ann. Conf. on Comp. Learning Theory\u201d (1997), 171\u2013183.","DOI":"10.1145\/267460.267493"},{"key":"31_CR15","doi-asserted-by":"crossref","unstructured":"R. Impagliazzo. Hard-core distributions for somewhat hard problems, in \u201cProc. 36th Symp. on Found. of Comp. Sci. \u201d (1995), 538\u2013545.","DOI":"10.1109\/SFCS.1995.492584"},{"issue":"4","key":"31_CR16","doi-asserted-by":"publisher","first-page":"807","DOI":"10.1137\/0222052","volume":"22","author":"M. Kearns","year":"1993","unstructured":"M. Kearns and M. Li. Learning in the presence of malicious errors, SIAM J. Comput. 22(4) (1993), 807\u2013837.","journal-title":"SIAM J. Comput."},{"issue":"1","key":"31_CR17","doi-asserted-by":"publisher","first-page":"67","DOI":"10.1145\/174644.174647","volume":"41","author":"M. Kearns","year":"1994","unstructured":"M. Kearns, L. Valiant. Cryptographic limitations on learning boolean formulae and finite automata, J. ACM 41(1) (1994), 67\u201395. Also \u201cProc. 21st Symp. on Theor. of Comp. \u201d (1989), 433-444.","journal-title":"J. ACM"},{"key":"31_CR18","doi-asserted-by":"crossref","unstructured":"A. Klivans and R. Servedio. Boosting and hard-core sets, in \u201cProc. 40th Ann. Symp. on Found. of Comp. Sci. \u201d (1999), 624\u2013633.","DOI":"10.1109\/SFFCS.1999.814638"},{"key":"31_CR19","doi-asserted-by":"crossref","unstructured":"N. Littlestone. Redundant noisy attributes, attribute errors, and linear-threshold learning using winnow, in \u201cProc. Fourth Workshop on Computational Learning Theory,\u201d (1991), 147\u2013156.","DOI":"10.1016\/B978-1-55860-213-7.50017-1"},{"issue":"4","key":"31_CR20","doi-asserted-by":"publisher","first-page":"189","DOI":"10.1016\/S0020-0190(98)00165-3","volume":"68","author":"Y. Mansour","year":"1998","unstructured":"Y. Mansour and M. Parnas. Learning conjunctions with noise under product distributions, Inf. Proc. Let. 68(4) (1998), 189\u2013196.","journal-title":"Inf. Proc. Let."},{"key":"31_CR21","doi-asserted-by":"crossref","unstructured":"R.E. Schapire. Theoretical views of boosting, in \u201cProc. 10th Int. Conf. on Algorithmic Learning Theory\u201d (1999), 12\u201324.","DOI":"10.1007\/3-540-46769-6_2"},{"issue":"5","key":"31_CR22","doi-asserted-by":"publisher","first-page":"1651","DOI":"10.1214\/aos\/1024691352","volume":"26","author":"R. Schapire","year":"1998","unstructured":"R. Schapire, Y. Freund, P. Bartlett and W.S. Lee. Boosting the margin: a new explanation for the effectiveness of voting methods, Annals of Statistics 26(5) (1998), 1651\u20131686.","journal-title":"Annals of Statistics"},{"key":"31_CR23","unstructured":"R. Servedio. PAC analogues of perceptron and winnow via boosting the margin, in \u201cProc. 13th Conf. on Comp. Learning Theory,\u201d 2000."},{"issue":"5","key":"31_CR24","doi-asserted-by":"publisher","first-page":"1926","DOI":"10.1109\/18.705570","volume":"44","author":"J. Shawe-Taylor","year":"1998","unstructured":"J. Shawe-Taylor, P.L. Bartlett, R.C. Williamson and M. Anthony. Structural risk minimization over data-dependent hierarchies, IEEE Trans. Inf. Theory, 44(5) (1998), 1926\u20131940.","journal-title":"IEEE Trans. Inf. Theory"},{"key":"31_CR25","unstructured":"A. Taylor and W. Mann. Advanced Calculus, Wiley & Sons, 1972."},{"key":"31_CR26","unstructured":"L.G. Valiant. Learning disjunctions of conjunctions, in \u201cProc. 9th Internat. Joint Conf. on Artif. Intel. \u201d (1985), 560\u2013566."}],"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_31","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2023,5,13]],"date-time":"2023-05-13T15:02:27Z","timestamp":1683990147000},"score":1,"resource":{"primary":{"URL":"http:\/\/link.springer.com\/10.1007\/3-540-44581-1_31"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2001]]},"ISBN":["9783540423430","9783540445814"],"references-count":26,"URL":"https:\/\/doi.org\/10.1007\/3-540-44581-1_31","relation":{},"ISSN":["0302-9743"],"issn-type":[{"value":"0302-9743","type":"print"}],"subject":[],"published":{"date-parts":[[2001]]}}}