{"id":"https://openalex.org/W7097978746","doi":null,"title":"24th Annual Conference on Learning Theory The Rate of Convergence of Adaboost","display_name":"24th Annual Conference on Learning Theory The Rate of Convergence of Adaboost","publication_year":2012,"publication_date":"2012-06-15","ids":{"openalex":"https://openalex.org/W7097978746"},"language":"en","primary_location":{"id":"pmh:oai:CiteSeerX.psu:10.1.1.232.589","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.232.589","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.jmlr.org/proceedings/papers/v19/mukherjee11a/mukherjee11a.pdf","raw_type":"text"},"volume":null,"type":"article","indexed_in":[],"open_access":{"is_oa":false,"oa_status":"closed","oa_url":null,"any_repository_has_fulltext":false},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5063901281","display_name":"Indraneel Mukherjee","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Indraneel Mukherjee","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5040468715","display_name":"Cynthia D Rudin","orcid":"https://orcid.org/0000-0003-4283-2780","observed_orcids":["https://orcid.org/0000-0003-4283-2780"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Cynthia Rudin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5084108666","display_name":"Robert E. Schapire","orcid":"https://orcid.org/0000-0001-8616-1611","observed_orcids":["https://orcid.org/0000-0001-8616-1611"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Robert E. Schapire","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Sham Kakade","orcid":null,"observed_orcids":[]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Sham Kakade","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5083754306","display_name":"Ulrike Von Luxburg A","orcid":"https://orcid.org/0009-0001-9902-2220","observed_orcids":["https://orcid.org/0009-0001-9902-2220"]},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ulrike Von Luxburg","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":0,"corresponding_author_ids":[],"corresponding_institution_ids":[],"apc_list":null,"apc_paid":null,"fwci":0.0,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":{"value":0.54890035,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":true,"primary_topic":{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.885699987411499,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},"topics":[{"id":"https://openalex.org/T12072","display_name":"Machine Learning and Algorithms","score":0.885699987411499,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.09000000357627869,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T12535","display_name":"Machine Learning and Data Classification","score":0.009700000286102295,"subfield":{"id":"https://openalex.org/subfields/1702","display_name":"Artificial Intelligence"},"field":{"id":"https://openalex.org/fields/17","display_name":"Computer Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/adaboost","display_name":"AdaBoost","score":0.9990000128746033},{"id":"https://openalex.org/keywords/convergence-rate","display_name":"convergence rate","score":0.9139999747276306},{"id":"https://openalex.org/keywords/exponential-loss","display_name":"exponential loss","score":0.9819999933242798},{"id":"https://openalex.org/keywords/boosting","display_name":"boosting","score":0.800000011920929},{"id":"https://openalex.org/keywords/weak-learning","display_name":"weak learning","score":0.5230000019073486},{"id":"https://openalex.org/keywords/lower-bounds","display_name":"lower bounds","score":0.5849999785423279}],"concepts":[{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.742900013923645},{"id":"https://openalex.org/C141404830","wikidata":"https://www.wikidata.org/wiki/Q2823869","display_name":"AdaBoost","level":3,"score":0.7371000051498413},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.703499972820282},{"id":"https://openalex.org/C57869625","wikidata":"https://www.wikidata.org/wiki/Q1783502","display_name":"Rate of convergence","level":3,"score":0.6248999834060669},{"id":"https://openalex.org/C151376022","wikidata":"https://www.wikidata.org/wiki/Q168698","display_name":"Exponential function","level":2,"score":0.5942000150680542},{"id":"https://openalex.org/C2777027219","wikidata":"https://www.wikidata.org/wiki/Q1284190","display_name":"Constant (computer programming)","level":2,"score":0.546500027179718},{"id":"https://openalex.org/C90119067","wikidata":"https://www.wikidata.org/wiki/Q43260","display_name":"Polynomial","level":2,"score":0.539900004863739},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.5236999988555908},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5228000283241272},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.41990000009536743},{"id":"https://openalex.org/C108710211","wikidata":"https://www.wikidata.org/wiki/Q11538","display_name":"Mathematical proof","level":2,"score":0.3995000123977661},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.36070001125335693},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.3391000032424927},{"id":"https://openalex.org/C75235859","wikidata":"https://www.wikidata.org/wiki/Q582659","display_name":"Exponential growth","level":2,"score":0.296999990940094},{"id":"https://openalex.org/C118615104","wikidata":"https://www.wikidata.org/wiki/Q121416","display_name":"Discrete mathematics","level":1,"score":0.2660999894142151}],"mesh":[],"locations_count":1,"locations":[{"id":"pmh:oai:CiteSeerX.psu:10.1.1.232.589","doi":null,"is_oa":false,"landing_page_url":"http://citeseerx.ist.psu.edu/viewdoc/summary?doi=10.1.1.232.589","pdf_url":null,"source":null,"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"http://www.jmlr.org/proceedings/papers/v19/mukherjee11a/mukherjee11a.pdf","raw_type":"text"}],"best_oa_location":null,"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":["https://openalex.org/W2397566105","https://openalex.org/W158602137","https://openalex.org/W2120168180","https://openalex.org/W7099805841","https://openalex.org/W7096361111","https://openalex.org/W1918179283","https://openalex.org/W7096108081","https://openalex.org/W2157705457","https://openalex.org/W4306884562","https://openalex.org/W7133188209"],"abstract_inverted_index":{"The":[0],"AdaBoost":[1,40,150],"algorithm":[2],"of":[3,46,55,71,89,102,106,114,154,180,202],"Freund":[4],"and":[5,124],"Schapire":[6],"(1997)":[7],"was":[8],"designed":[9],"to":[10,43,188,198],"combine":[11],"many":[12],"\u201cweak":[13],"\u201d":[14,27,50],"hypotheses":[15],"that":[16,29,69,82,101,116,146,158,177],"perform":[17],"slightly":[18],"better":[19],"than":[20,100,164],"a":[21,25,52,62,112,120,134,152],"random":[22],"guess":[23],"into":[24],"\u201cstrong":[26],"hypothesis":[28],"has":[30],"very":[31],"low":[32],"error.":[33],"We":[34,126,175],"study":[35],"the":[36,44,47,72,86,155,165,173,181,203],"rate":[37,54,129,182],"at":[38,83,96,160,192],"which":[39],"iteratively":[41],"converges":[42],"minimum":[45],"\u201cexponential":[48],"loss":[49,74,88,157],"with":[51],"fast":[53],"convergence.":[56],"Our":[57,142],"proofs":[58],"do":[59,66],"not":[60],"require":[61,68],"weak-learning":[63],"assumption,":[64],"nor":[65],"they":[67],"minimizers":[70],"exponential":[73,87,156,205],"are":[75,196],"finite.":[76],"Specifically,":[77],"our":[78],"first":[79],"result":[80,144],"shows":[81],"iteration":[84],"t,":[85],"AdaBoost\u2019s":[90],"computed":[91],"parameter":[92,104],"vector":[93,105],"will":[94],"be":[95],"most":[97,161],"\u03b5":[98,162,184,201],"more":[99,163],"any":[103],"\u21131-norm":[107],"bounded":[108,118],"by":[109,119],"B":[110,123],"in":[111,122],"number":[113],"rounds":[115,195],"is":[117,140,145,159,185],"polynomial":[121,135],"1/\u03b5.":[125],"also":[127],"provide":[128],"lower":[130],"bound":[131],"examples":[132],"showing":[133],"dependence":[136,179],"on":[137,172,183],"these":[138],"parameters":[139],"necessary.":[141],"second":[143],"within":[147,200],"C/\u03b5":[148],"iterations,":[149],"achieves":[151],"value":[153],"best":[166],"possible":[167],"value,":[168],"where":[169],"C":[170],"depends":[171],"dataset.":[174],"show":[176],"this":[178],"optimal":[186,204],"up":[187],"constant":[189],"factors,":[190],"i.e.":[191],"least":[193],"\u2126(1/\u03b5)":[194],"necessary":[197],"achieve":[199],"loss.":[206]},"counts_by_year":[],"updated_date":"2026-10-14T16:39:01.820549","created_date":"2025-10-27T00:00:00"}