{"id":"https://openalex.org/W7160917511","doi":"https://doi.org/10.48550/arxiv.2605.10598","title":"Budget-Efficient Automatic Algorithm Design via Code Graph","display_name":"Budget-Efficient Automatic Algorithm Design via Code Graph","publication_year":2026,"publication_date":"2026-05-11","ids":{"openalex":"https://openalex.org/W7160917511","doi":"https://doi.org/10.48550/arxiv.2605.10598"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2605.10598","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.10598","pdf_url":null,"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":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2605.10598","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5135913335","display_name":"Maxime Bouscary","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Bouscary, Maxime","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5103061454","display_name":"Manxi Wu","orcid":"https://orcid.org/0000-0001-5334-4163"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wu, Manxi","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5112133200","display_name":"Saurabh Amin","orcid":"https://orcid.org/0000-0003-1554-015X"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Amin, Saurabh","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":null,"has_fulltext":false,"cited_by_count":0,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":null,"last_page":null},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10181","display_name":"Natural Language Processing Techniques","score":0.3578000068664551,"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/T10181","display_name":"Natural Language Processing Techniques","score":0.3578000068664551,"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/T14347","display_name":"Big Data and Digital Economy","score":0.08730000257492065,"subfield":{"id":"https://openalex.org/subfields/1710","display_name":"Information Systems"},"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/T12072","display_name":"Machine Learning and Algorithms","score":0.08129999786615372,"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/granularity","display_name":"Granularity","score":0.4830000102519989},{"id":"https://openalex.org/keywords/exploit","display_name":"Exploit","score":0.4758000075817108},{"id":"https://openalex.org/keywords/search-algorithm","display_name":"Search algorithm","score":0.4702000021934509},{"id":"https://openalex.org/keywords/security-token","display_name":"Security token","score":0.44510000944137573},{"id":"https://openalex.org/keywords/graph","display_name":"Graph","score":0.4449999928474426},{"id":"https://openalex.org/keywords/dependency-graph","display_name":"Dependency graph","score":0.4327000081539154},{"id":"https://openalex.org/keywords/representation","display_name":"Representation (politics)","score":0.37139999866485596},{"id":"https://openalex.org/keywords/complement","display_name":"Complement (music)","score":0.3596999943256378},{"id":"https://openalex.org/keywords/rewriting","display_name":"Rewriting","score":0.35409998893737793},{"id":"https://openalex.org/keywords/beam-search","display_name":"Beam search","score":0.35199999809265137}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7477999925613403},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.5206000208854675},{"id":"https://openalex.org/C177774035","wikidata":"https://www.wikidata.org/wiki/Q1246948","display_name":"Granularity","level":2,"score":0.4830000102519989},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.4758000075817108},{"id":"https://openalex.org/C125583679","wikidata":"https://www.wikidata.org/wiki/Q755673","display_name":"Search algorithm","level":2,"score":0.4702000021934509},{"id":"https://openalex.org/C48145219","wikidata":"https://www.wikidata.org/wiki/Q1335365","display_name":"Security token","level":2,"score":0.44510000944137573},{"id":"https://openalex.org/C132525143","wikidata":"https://www.wikidata.org/wiki/Q141488","display_name":"Graph","level":2,"score":0.4449999928474426},{"id":"https://openalex.org/C16311509","wikidata":"https://www.wikidata.org/wiki/Q4148050","display_name":"Dependency graph","level":3,"score":0.4327000081539154},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.39959999918937683},{"id":"https://openalex.org/C2776359362","wikidata":"https://www.wikidata.org/wiki/Q2145286","display_name":"Representation (politics)","level":3,"score":0.37139999866485596},{"id":"https://openalex.org/C112313634","wikidata":"https://www.wikidata.org/wiki/Q7886648","display_name":"Complement (music)","level":5,"score":0.3596999943256378},{"id":"https://openalex.org/C154690210","wikidata":"https://www.wikidata.org/wiki/Q1668499","display_name":"Rewriting","level":2,"score":0.35409998893737793},{"id":"https://openalex.org/C19889080","wikidata":"https://www.wikidata.org/wiki/Q2835852","display_name":"Beam search","level":3,"score":0.35199999809265137},{"id":"https://openalex.org/C74197172","wikidata":"https://www.wikidata.org/wiki/Q1195339","display_name":"Directed acyclic graph","level":2,"score":0.34599998593330383},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.34380000829696655},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.33469998836517334},{"id":"https://openalex.org/C558772884","wikidata":"https://www.wikidata.org/wiki/Q1508564","display_name":"Graph rewriting","level":3,"score":0.32899999618530273},{"id":"https://openalex.org/C43126263","wikidata":"https://www.wikidata.org/wiki/Q128751","display_name":"Source code","level":2,"score":0.32330000400543213},{"id":"https://openalex.org/C96333769","wikidata":"https://www.wikidata.org/wiki/Q907955","display_name":"Graph traversal","level":3,"score":0.3221000134944916},{"id":"https://openalex.org/C2333172","wikidata":"https://www.wikidata.org/wiki/Q1425985","display_name":"Preorder","level":2,"score":0.3199999928474426},{"id":"https://openalex.org/C146380142","wikidata":"https://www.wikidata.org/wiki/Q1137726","display_name":"Directed graph","level":2,"score":0.2980000078678131},{"id":"https://openalex.org/C125411270","wikidata":"https://www.wikidata.org/wiki/Q18653","display_name":"Encoding (memory)","level":2,"score":0.2962999939918518},{"id":"https://openalex.org/C311688","wikidata":"https://www.wikidata.org/wiki/Q2393193","display_name":"Time complexity","level":2,"score":0.295199990272522},{"id":"https://openalex.org/C162319229","wikidata":"https://www.wikidata.org/wiki/Q175263","display_name":"Data structure","level":2,"score":0.29490000009536743},{"id":"https://openalex.org/C176032523","wikidata":"https://www.wikidata.org/wiki/Q753127","display_name":"Topological sorting","level":3,"score":0.28700000047683716},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.2777999937534332},{"id":"https://openalex.org/C201789804","wikidata":"https://www.wikidata.org/wiki/Q2362762","display_name":"Search problem","level":2,"score":0.2775999903678894},{"id":"https://openalex.org/C2776639384","wikidata":"https://www.wikidata.org/wiki/Q840396","display_name":"Ideal (ethics)","level":2,"score":0.27469998598098755},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.26190000772476196},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.2524000108242035}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2605.10598","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.10598","pdf_url":null,"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":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2605.10598","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2605.10598","pdf_url":null,"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":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Preprint"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Large":[0],"language":[1],"models":[2],"(LLMs)":[3],"have":[4],"emerged":[5],"as":[6],"powerful":[7],"tools":[8],"for":[9,84],"automatic":[10,44],"algorithm":[11,45],"design":[12],"(AAD).":[13],"However,":[14],"existing":[15],"pipelines":[16],"remain":[17],"inefficient.":[18],"They":[19],"operate":[20],"at":[21,148,172],"the":[22,48,76,82,105,140,186],"granularity":[23],"of":[24,66,80,122,165],"full":[25,85],"algorithms,":[26,86],"redundantly":[27],"rewriting":[28],"recurring":[29],"substructures":[30],"and":[31,68,146,192],"discarding":[32],"low-fitness":[33],"candidates":[34],"that":[35,73,95,110,128,180],"may":[36],"contain":[37],"valuable":[38],"algorithmic":[39],"features.":[40],"We":[41,59,132,152],"formalize":[42],"budget-efficient":[43],"design,":[46],"wherein":[47],"search":[49,71,144,168,171],"policy":[50],"maximizes":[51],"realized":[52],"fitness":[53],"subject":[54],"to":[55,90],"limited":[56],"computational":[57],"cost.":[58],"propose":[60],"a":[61,70],"directed":[62],"acyclic":[63],"graph":[64,116],"representation":[65],"algorithms":[67,109,119],"build":[69],"framework":[72,135],"fully":[74],"exploits":[75],"LLM's":[77,187],"output.":[78],"Instead":[79],"querying":[81],"LLM":[83],"we":[87],"use":[88],"it":[89],"obtain":[91],"corrections:":[92],"compact":[93],"operators":[94],"add,":[96],"replace,":[97],"or":[98],"remove":[99],"code":[100],"blocks.":[101],"Each":[102],"correction":[103],"augments":[104],"graph,":[106],"yielding":[107],"new":[108],"compose":[111],"with":[112,136],"prior":[113,188],"corrections.":[114],"This":[115],"structure":[117],"decomposes":[118],"into":[120,139],"sets":[121],"corrections,":[123],"enabling":[124],"correction-level":[125],"credit":[126],"assignment":[127],"informs":[129],"subsequent":[130],"queries.":[131],"complement":[133],"this":[134],"theoretical":[137],"insights":[138],"ideal":[141],"balance":[142],"between":[143],"depth":[145],"breadth":[147],"different":[149],"budget":[150],"levels.":[151],"validate":[153],"our":[154,166,177],"method":[155],"empirically":[156],"on":[157],"three":[158],"combinatorial":[159],"optimization":[160],"problems,":[161],"demonstrating":[162],"consistent":[163],"superiority":[164],"graph-based":[167],"over":[169],"full-algorithm":[170],"equal":[173],"token":[174],"budget.":[175],"Finally,":[176],"experiments":[178],"suggest":[179],"rich":[181],"contexts":[182],"help":[183],"only":[184],"when":[185],"knowledge":[189],"is":[190],"shallow,":[191],"can":[193],"hinder":[194],"performance":[195],"otherwise.":[196]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-05-13T00:00:00"}