{"id":"https://openalex.org/W2762452592","doi":"https://doi.org/10.1137/090766437","title":"Self-Improving Algorithms","display_name":"Self-Improving Algorithms","publication_year":2011,"publication_date":"2011-01-01","ids":{"openalex":"https://openalex.org/W2762452592","doi":"https://doi.org/10.1137/090766437","mag":"2762452592"},"language":"en","primary_location":{"id":"doi:10.1137/090766437","is_oa":false,"landing_page_url":"https://doi.org/10.1137/090766437","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},"type":"article","indexed_in":["arxiv","crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/0907.0884","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Nir Ailon","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Nir Ailon","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Bernard Chazelle","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Bernard Chazelle","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Kenneth L. Clarkson","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Kenneth L. Clarkson","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Ding Liu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ding Liu","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Wolfgang Mulzer","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wolfgang Mulzer","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"C. Seshadhri","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"C. Seshadhri","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":7.3993,"has_fulltext":false,"cited_by_count":19,"citation_normalized_percentile":{"value":0.96267191,"is_in_top_1_percent":false,"is_in_top_10_percent":true},"cited_by_percentile_year":{"min":89,"max":97},"biblio":{"volume":"40","issue":"2","first_page":"350","last_page":"375"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.3463999927043915,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T10996","display_name":"Computational Geometry and Mesh Generation","score":0.3463999927043915,"subfield":{"id":"https://openalex.org/subfields/1704","display_name":"Computer Graphics and Computer-Aided Design"},"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/T10720","display_name":"Complexity and Algorithms in Graphs","score":0.20389999449253082,"subfield":{"id":"https://openalex.org/subfields/1703","display_name":"Computational Theory and Mathematics"},"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/T11269","display_name":"Algorithms and Data Compression","score":0.09769999980926514,"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/sorting","display_name":"Sorting","score":0.6620000004768372},{"id":"https://openalex.org/keywords/delaunay-triangulation","display_name":"Delaunay triangulation","score":0.6496999859809875},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.5023000240325928},{"id":"https://openalex.org/keywords/sequence","display_name":"Sequence (biology)","score":0.49470001459121704},{"id":"https://openalex.org/keywords/product","display_name":"Product (mathematics)","score":0.46219998598098755},{"id":"https://openalex.org/keywords/distribution","display_name":"Distribution (mathematics)","score":0.4490000009536743},{"id":"https://openalex.org/keywords/triangulation","display_name":"Triangulation","score":0.43560001254081726}],"concepts":[{"id":"https://openalex.org/C111696304","wikidata":"https://www.wikidata.org/wiki/Q2303697","display_name":"Sorting","level":2,"score":0.6620000004768372},{"id":"https://openalex.org/C68010082","wikidata":"https://www.wikidata.org/wiki/Q192445","display_name":"Delaunay triangulation","level":2,"score":0.6496999859809875},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.6079000234603882},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.552299976348877},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.5023000240325928},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.49470001459121704},{"id":"https://openalex.org/C90673727","wikidata":"https://www.wikidata.org/wiki/Q901718","display_name":"Product (mathematics)","level":2,"score":0.46219998598098755},{"id":"https://openalex.org/C110121322","wikidata":"https://www.wikidata.org/wiki/Q865811","display_name":"Distribution (mathematics)","level":2,"score":0.4490000009536743},{"id":"https://openalex.org/C135981907","wikidata":"https://www.wikidata.org/wiki/Q188056","display_name":"Triangulation","level":2,"score":0.43560001254081726},{"id":"https://openalex.org/C188198153","wikidata":"https://www.wikidata.org/wiki/Q1613840","display_name":"Limiting","level":2,"score":0.39739999175071716},{"id":"https://openalex.org/C108094655","wikidata":"https://www.wikidata.org/wiki/Q181593","display_name":"Sorting algorithm","level":3,"score":0.36629998683929443},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.36419999599456787},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3398999869823456},{"id":"https://openalex.org/C149441793","wikidata":"https://www.wikidata.org/wiki/Q200726","display_name":"Probability distribution","level":2,"score":0.29910001158714294},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2825999855995178},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.2709999978542328},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.26589998602867126},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.26260000467300415},{"id":"https://openalex.org/C44280652","wikidata":"https://www.wikidata.org/wiki/Q104837","display_name":"Phase (matter)","level":2,"score":0.25440001487731934}],"mesh":[],"locations_count":2,"locations":[{"id":"doi:10.1137/090766437","is_oa":false,"landing_page_url":"https://doi.org/10.1137/090766437","pdf_url":null,"source":{"id":"https://openalex.org/S153560523","display_name":"SIAM Journal on Computing","issn_l":"0097-5397","issn":["0097-5397","1095-7111"],"is_oa":false,"is_in_doaj":false,"is_core":true,"host_organization":"https://openalex.org/P4310320508","host_organization_name":"Society for Industrial and Applied Mathematics","host_organization_lineage":["https://openalex.org/P4310320508"],"host_organization_lineage_names":["Society for Industrial and Applied Mathematics"],"type":"journal"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"SIAM Journal on Computing","raw_type":"journal-article"},{"id":"pmh:oai:arXiv.org:0907.0884","is_oa":true,"landing_page_url":"http://arxiv.org/abs/0907.0884","pdf_url":"https://arxiv.org/pdf/0907.0884","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:0907.0884","is_oa":true,"landing_page_url":"http://arxiv.org/abs/0907.0884","pdf_url":"https://arxiv.org/pdf/0907.0884","source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":null,"issn":null,"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":"https://openalex.org/I205783295","host_organization_name":"Cornell University","host_organization_lineage":["https://openalex.org/I205783295"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":25,"referenced_works":["https://openalex.org/W1847031659","https://openalex.org/W1972369894","https://openalex.org/W1999396007","https://openalex.org/W2003185949","https://openalex.org/W2008581147","https://openalex.org/W2013596337","https://openalex.org/W2016153661","https://openalex.org/W2018317497","https://openalex.org/W2041645394","https://openalex.org/W2044931094","https://openalex.org/W2049774319","https://openalex.org/W2061845601","https://openalex.org/W2065354456","https://openalex.org/W2066823629","https://openalex.org/W2068297738","https://openalex.org/W2074863496","https://openalex.org/W2078589215","https://openalex.org/W2103893986","https://openalex.org/W2124919631","https://openalex.org/W2130055503","https://openalex.org/W2146517658","https://openalex.org/W2150580945","https://openalex.org/W2168320878","https://openalex.org/W4241581870","https://openalex.org/W4254977685"],"related_works":[],"abstract_inverted_index":{"We":[0,24,89],"investigate":[1],"ways":[2],"in":[3,142],"which":[4,129,143],"an":[5,19,69],"algorithm":[6,70],"can":[7],"improve":[8],"its":[9],"expected":[10,78,118],"performance":[11],"by":[12,138],"fine-tuning":[13],"itself":[14],"automatically":[15],"with":[16,124],"respect":[17],"to":[18,39,67,147],"unknown":[20,61],"input":[21,86,135],"distribution":[22,62,87],"$\\mathcal{D}$.":[23],"assume":[25],"here":[26],"that":[27,36,75],"$\\mathcal{D}$":[28],"is":[29,55,66],"of":[30,44,47,101,109],"product":[31],"type.":[32],"More":[33],"precisely,":[34],"suppose":[35],"we":[37],"need":[38],"process":[40],"a":[41,99,110,125,139],"sequence":[42,100],"$I_1,I_2,\\ldots$":[43],"inputs":[45,73],"$I=(x_1,x_2,\\ldots,x_n)$":[46],"some":[48,59],"fixed":[49],"length":[50],"n,":[51],"where":[52],"each":[53],"$x_i$":[54],"drawn":[56],"independently":[57],"from":[58],"arbitrary,":[60],"$\\mathcal{D}_i$.":[63],"The":[64,121],"goal":[65],"design":[68],"for":[71,84,94],"these":[72],"so":[74],"eventually":[76],"the":[77,85,106,134,144],"running":[79],"time":[80],"will":[81],"be":[82],"optimal":[83,117],"$\\mathcal{D}=\\prod_i\\mathcal{D}_i$.":[88],"give":[90],"such":[91],"self-improving":[92],"algorithms":[93,115,122,145],"two":[95],"problems:":[96],"(i)":[97],"sorting":[98],"numbers":[102],"and":[103],"(ii)":[104],"computing":[105],"Delaunay":[107],"triangulation":[108],"planar":[111],"point":[112],"set.":[113],"Both":[114],"achieve":[116],"limiting":[119],"complexity.":[120],"begin":[123],"training":[126],"phase":[127],"during":[128],"they":[130],"collect":[131],"information":[132],"about":[133],"distribution,":[136],"followed":[137],"stationary":[140],"regime":[141],"settle":[146],"their":[148],"optimized":[149],"incarnations.":[150]},"counts_by_year":[{"year":2025,"cited_by_count":2},{"year":2022,"cited_by_count":1},{"year":2021,"cited_by_count":2},{"year":2019,"cited_by_count":1},{"year":2017,"cited_by_count":2},{"year":2015,"cited_by_count":1},{"year":2014,"cited_by_count":3},{"year":2013,"cited_by_count":3},{"year":2012,"cited_by_count":3}],"updated_date":"2026-06-25T06:16:34.145877","created_date":"2017-10-20T00:00:00"}