{"id":"https://openalex.org/W7151604652","doi":"https://doi.org/10.48550/arxiv.2604.04238","title":"Agentic Code Optimization via Compiler-LLM Cooperation","display_name":"Agentic Code Optimization via Compiler-LLM Cooperation","publication_year":2026,"publication_date":"2026-04-05","ids":{"openalex":"https://openalex.org/W7151604652","doi":"https://doi.org/10.48550/arxiv.2604.04238"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.04238","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.04238","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.2604.04238","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5044460206","display_name":"Benjamin Mikek","orcid":"https://orcid.org/0000-0002-4195-8464"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Mikek, Benjamin","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5133138572","display_name":"Danylo Vashchilenko","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Vashchilenko, Danylo","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5133098470","display_name":"Bryan Lu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lu, Bryan","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5133126914","display_name":"Panpan Xu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Xu, Panpan","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/T10126","display_name":"Logic, programming, and type systems","score":0.7764999866485596,"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/T10126","display_name":"Logic, programming, and type systems","score":0.7764999866485596,"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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.10530000180006027,"subfield":{"id":"https://openalex.org/subfields/1708","display_name":"Hardware and Architecture"},"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/T10639","display_name":"Advanced Software Engineering Methodologies","score":0.012400000356137753,"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/compiler","display_name":"Compiler","score":0.8385000228881836},{"id":"https://openalex.org/keywords/executable","display_name":"Executable","score":0.7354999780654907},{"id":"https://openalex.org/keywords/program-optimization","display_name":"Program optimization","score":0.6399000287055969},{"id":"https://openalex.org/keywords/code-generation","display_name":"Code generation","score":0.6330000162124634},{"id":"https://openalex.org/keywords/correctness","display_name":"Correctness","score":0.6255000233650208},{"id":"https://openalex.org/keywords/optimizing-compiler","display_name":"Optimizing compiler","score":0.6092000007629395},{"id":"https://openalex.org/keywords/dead-code-elimination","display_name":"Dead code elimination","score":0.5489000082015991},{"id":"https://openalex.org/keywords/code","display_name":"Code (set theory)","score":0.47920000553131104}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.864300012588501},{"id":"https://openalex.org/C169590947","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler","level":2,"score":0.8385000228881836},{"id":"https://openalex.org/C160145156","wikidata":"https://www.wikidata.org/wiki/Q778586","display_name":"Executable","level":2,"score":0.7354999780654907},{"id":"https://openalex.org/C139571649","wikidata":"https://www.wikidata.org/wiki/Q1156793","display_name":"Program optimization","level":3,"score":0.6399000287055969},{"id":"https://openalex.org/C133162039","wikidata":"https://www.wikidata.org/wiki/Q1061077","display_name":"Code generation","level":3,"score":0.6330000162124634},{"id":"https://openalex.org/C55439883","wikidata":"https://www.wikidata.org/wiki/Q360812","display_name":"Correctness","level":2,"score":0.6255000233650208},{"id":"https://openalex.org/C190902152","wikidata":"https://www.wikidata.org/wiki/Q1325106","display_name":"Optimizing compiler","level":3,"score":0.6092000007629395},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.5541999936103821},{"id":"https://openalex.org/C2144512","wikidata":"https://www.wikidata.org/wiki/Q1143090","display_name":"Dead code elimination","level":5,"score":0.5489000082015991},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.47920000553131104},{"id":"https://openalex.org/C111564260","wikidata":"https://www.wikidata.org/wiki/Q4288856","display_name":"Interprocedural optimization","level":5,"score":0.45260000228881836},{"id":"https://openalex.org/C124304363","wikidata":"https://www.wikidata.org/wiki/Q673661","display_name":"Abstraction","level":2,"score":0.4325000047683716},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.40389999747276306},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.36570000648498535},{"id":"https://openalex.org/C204323151","wikidata":"https://www.wikidata.org/wiki/Q905424","display_name":"Range (aeronautics)","level":2,"score":0.3619999885559082},{"id":"https://openalex.org/C2777904410","wikidata":"https://www.wikidata.org/wiki/Q7397","display_name":"Software","level":2,"score":0.35280001163482666},{"id":"https://openalex.org/C29331672","wikidata":"https://www.wikidata.org/wiki/Q3354468","display_name":"Loop optimization","level":4,"score":0.30300000309944153},{"id":"https://openalex.org/C120314980","wikidata":"https://www.wikidata.org/wiki/Q180634","display_name":"Distributed computing","level":1,"score":0.27129998803138733},{"id":"https://openalex.org/C9957790","wikidata":"https://www.wikidata.org/wiki/Q47506","display_name":"Compiler construction","level":3,"score":0.2700999975204468},{"id":"https://openalex.org/C43126263","wikidata":"https://www.wikidata.org/wiki/Q128751","display_name":"Source code","level":2,"score":0.2669999897480011},{"id":"https://openalex.org/C2780902518","wikidata":"https://www.wikidata.org/wiki/Q6033780","display_name":"Inheritance (genetic algorithm)","level":3,"score":0.2535000145435333}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.04238","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.04238","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.2604.04238","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.04238","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":[{"display_name":"Partnerships for the goals","score":0.5802909135818481,"id":"https://metadata.un.org/sdg/17"}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Generating":[0],"performant":[1],"executables":[2],"from":[3],"high":[4],"level":[5,143],"languages":[6],"is":[7,75],"critical":[8],"to":[9,57,84,219],"software":[10],"performance":[11,163],"across":[12],"a":[13,27,48,82,132,169,192],"wide":[14],"range":[15],"of":[16,29,36,88,95,115,121,124,144,164,182,188],"domains.":[17],"Modern":[18],"compilers":[19],"perform":[20],"this":[21,59,78],"task":[22],"by":[23],"passing":[24],"code":[25,73,97,110,125],"through":[26],"series":[28],"well-studied":[30],"optimizations":[31,91,211],"at":[32,112,185],"progressively":[33],"lower":[34],"levels":[35,114,187],"abstraction,":[37,116,145],"but":[38],"may":[39],"miss":[40],"optimization":[41,106,139,181],"opportunities":[42],"that":[43,74,135,158,172,204],"require":[44],"high-level":[45],"reasoning":[46],"about":[47],"program's":[49],"purpose.":[50],"Recent":[51],"work":[52],"has":[53],"proposed":[54],"using":[55],"LLMs":[56,62],"fill":[58],"gap.":[60],"While":[61],"can":[63],"achieve":[64],"large":[65],"speedups":[66,217],"on":[67],"some":[68],"programs,":[69],"they":[70],"frequently":[71],"generate":[72],"incorrect.":[76],"In":[77],"work,":[79],"we":[80],"propose":[81],"method":[83,193],"balance":[85],"the":[86,93,118,160,174],"correctness":[87,161],"conventional":[89],"compiler":[90,105,148,210],"with":[92,108,131],"``creativity''":[94],"LLM-based":[96,109,138,154,180,214],"generation:":[98],"compiler-LLM":[99,205],"cooperation.":[100],"Our":[101,200],"approach":[102,130],"integrates":[103],"existing":[104,209],"passes":[107],"generation":[111,156],"multiple":[113,186],"retaining":[117],"best":[119],"features":[120],"both":[122,208],"types":[123],"optimization.":[126],"We":[127],"realize":[128],"our":[129],"multi-agent":[133],"system":[134],"includes":[136],"(1)":[137],"agents":[140],"for":[141,194],"each":[142],"(2)":[146],"individual":[147],"constituents":[149],"as":[150],"tools,":[151],"(3)":[152],"an":[153],"test":[155],"agent":[157],"probes":[159],"and":[162,167,190,212],"generated":[165],"code,":[166],"(4)":[168],"guiding":[170],"LLM":[171],"orchestrates":[173],"other":[175],"components.":[176],"The":[177],"strategy":[178],"enables":[179],"input":[183],"programs":[184],"abstraction":[189],"introduces":[191],"distributing":[195],"computational":[196],"budget":[197],"between":[198],"levels.":[199],"extensive":[201],"evaluation":[202],"shows":[203],"cooperation":[206],"outperforms":[207],"level-specific":[213],"baselines,":[215],"producing":[216],"up":[218],"1.25x.":[220]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-04-08T00:00:00"}