{"id":"https://openalex.org/W7171541028","doi":"https://doi.org/10.48550/arxiv.2607.23665","title":"Multi-level Code Optimization via Mixture of Prompts","display_name":"Multi-level Code Optimization via Mixture of Prompts","publication_year":2026,"publication_date":"2026-07-26","ids":{"openalex":"https://openalex.org/W7171541028","doi":"https://doi.org/10.48550/arxiv.2607.23665"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2607.23665","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.23665","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","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.2607.23665","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5143757003","display_name":"Yun Peng","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Peng, Yun","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5143767105","display_name":"Jun Wan","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wan, Jun","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5143750626","display_name":"Jiakun Liu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Liu, Jiakun","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5143810806","display_name":"Shuzheng Gao","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Gao, Shuzheng","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5143851095","display_name":"David Lo","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Lo, David","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5143793962","display_name":"Xiaoxue Ren","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ren, Xiaoxue","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/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.5041999816894531,"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"}},"topics":[{"id":"https://openalex.org/T10054","display_name":"Parallel Computing and Optimization Techniques","score":0.5041999816894531,"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/T10260","display_name":"Software Engineering Research","score":0.1923000067472458,"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/T10126","display_name":"Logic, programming, and type systems","score":0.0997999981045723,"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/code","display_name":"Code (set theory)","score":0.6894999742507935},{"id":"https://openalex.org/keywords/speedup","display_name":"Speedup","score":0.6561999917030334},{"id":"https://openalex.org/keywords/source-code","display_name":"Source code","score":0.48919999599456787},{"id":"https://openalex.org/keywords/program-optimization","display_name":"Program optimization","score":0.4862000048160553},{"id":"https://openalex.org/keywords/software","display_name":"Software","score":0.3953000009059906},{"id":"https://openalex.org/keywords/code-generation","display_name":"Code generation","score":0.38850000500679016},{"id":"https://openalex.org/keywords/focus","display_name":"Focus (optics)","score":0.37299999594688416},{"id":"https://openalex.org/keywords/optimization-algorithm","display_name":"Optimization algorithm","score":0.35830000042915344}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.805899977684021},{"id":"https://openalex.org/C2776760102","wikidata":"https://www.wikidata.org/wiki/Q5139990","display_name":"Code (set theory)","level":3,"score":0.6894999742507935},{"id":"https://openalex.org/C68339613","wikidata":"https://www.wikidata.org/wiki/Q1549489","display_name":"Speedup","level":2,"score":0.6561999917030334},{"id":"https://openalex.org/C43126263","wikidata":"https://www.wikidata.org/wiki/Q128751","display_name":"Source code","level":2,"score":0.48919999599456787},{"id":"https://openalex.org/C139571649","wikidata":"https://www.wikidata.org/wiki/Q1156793","display_name":"Program optimization","level":3,"score":0.4862000048160553},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.40149998664855957},{"id":"https://openalex.org/C2777904410","wikidata":"https://www.wikidata.org/wiki/Q7397","display_name":"Software","level":2,"score":0.3953000009059906},{"id":"https://openalex.org/C199360897","wikidata":"https://www.wikidata.org/wiki/Q9143","display_name":"Programming language","level":1,"score":0.39430001378059387},{"id":"https://openalex.org/C133162039","wikidata":"https://www.wikidata.org/wiki/Q1061077","display_name":"Code generation","level":3,"score":0.38850000500679016},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.3813999891281128},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.37299999594688416},{"id":"https://openalex.org/C2987595161","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Optimization algorithm","level":2,"score":0.35830000042915344},{"id":"https://openalex.org/C2781039887","wikidata":"https://www.wikidata.org/wiki/Q1391724","display_name":"Factor (programming language)","level":2,"score":0.3257000148296356},{"id":"https://openalex.org/C12725497","wikidata":"https://www.wikidata.org/wiki/Q810247","display_name":"Baseline (sea)","level":2,"score":0.3183000087738037},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.31679999828338623},{"id":"https://openalex.org/C2779530757","wikidata":"https://www.wikidata.org/wiki/Q1207505","display_name":"Quality (philosophy)","level":2,"score":0.296999990940094},{"id":"https://openalex.org/C150292731","wikidata":"https://www.wikidata.org/wiki/Q1342704","display_name":"Code review","level":5,"score":0.29109999537467957},{"id":"https://openalex.org/C3018263672","wikidata":"https://www.wikidata.org/wiki/Q1296251","display_name":"Efficient algorithm","level":2,"score":0.2874000072479248},{"id":"https://openalex.org/C50951305","wikidata":"https://www.wikidata.org/wiki/Q2482534","display_name":"Unreachable code","level":5,"score":0.27730000019073486},{"id":"https://openalex.org/C115051666","wikidata":"https://www.wikidata.org/wiki/Q6522493","display_name":"Ranging","level":2,"score":0.27709999680519104},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.26919999718666077},{"id":"https://openalex.org/C115168132","wikidata":"https://www.wikidata.org/wiki/Q55813","display_name":"Machine code","level":3,"score":0.26460000872612},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.2644999921321869},{"id":"https://openalex.org/C8767382","wikidata":"https://www.wikidata.org/wiki/Q1058454","display_name":"Dynamic compilation","level":3,"score":0.262800008058548},{"id":"https://openalex.org/C113775141","wikidata":"https://www.wikidata.org/wiki/Q428691","display_name":"Computer engineering","level":1,"score":0.2535000145435333}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2607.23665","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.23665","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"Preprint"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2607.23665","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2607.23665","pdf_url":null,"source":{"id":"https://openalex.org/S4306400194","display_name":"arXiv (Cornell University)","issn_l":"2331-8422","issn":["2331-8422"],"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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","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":{"Runtime":[0],"efficiency":[1,175],"is":[2],"a":[3,92,100],"critical":[4],"factor":[5],"that":[6,49,145,183,197],"impacts":[7],"both":[8],"software":[9],"quality":[10],"and":[11,79,178,200,209,219,242],"user":[12],"satisfaction.":[13],"There":[14],"are":[15,41,122,198],"many":[16],"approaches":[17,144],"proposed":[18],"for":[19,37],"code":[20,27,66,95,112,140,174],"optimization":[21,28,77,96,127],"to":[22,45,62,74,125,130,137,163,188,212,228,239,245],"improve":[23],"runtime":[24],"efficiency.":[25],"Traditional":[26],"methods":[29,72],"operate":[30],"on":[31,99,148,172],"intermediate":[32],"representations":[33],"(IRs)":[34],"during":[35],"compilation":[36],"static":[38],"languages.":[39,69],"They":[40],"effective":[42],"but":[43],"struggle":[44],"handle":[46],"dynamic":[47,68],"languages":[48],"do":[50],"not":[51],"require":[52],"compilation.":[53],"Recently,":[54],"large":[55],"language":[56],"models":[57,132],"(LLMs)":[58],"have":[59],"been":[60],"leveraged":[61],"directly":[63],"optimize":[64,138],"source":[65],"in":[67,133,166,230],"However,":[70],"these":[71,87],"fail":[73],"identify":[75],"suitable":[76],"targets":[78],"usually":[80],"conduct":[81],"incomprehensive":[82],"single-level":[83],"optimization.":[84],"To":[85],"address":[86],"challenges,":[88],"we":[89],"propose":[90],"Optimo,":[91],"multi-level":[93],"LLM-based":[94],"approach":[97],"built":[98],"novel":[101],"Mixture-of-Prompts":[102],"(MoP)":[103],"architecture.":[104],"In":[105],"the":[106,192,206,223],"MoP":[107],"architecture,":[108],"Optimo":[109,151,171,184,235],"identifies":[110],"time-critical":[111],"structures":[113,121],"as":[114],"performance":[115],"bottlenecks":[116],"via":[117],"differential":[118],"profiling.":[119],"These":[120],"then":[123],"routed":[124],"some":[126],"strategies,":[128],"akin":[129],"expert":[131],"MoE,":[134],"each":[135],"tailored":[136],"specific":[139],"patterns.":[141],"Unlike":[142],"traditional":[143],"focus":[146],"only":[147],"statement-level":[149],"optimizations,":[150],"operates":[152],"at":[153,201],"four":[154],"levels":[155],"of":[156,194,232],"abstraction,":[157],"ranging":[158],"from":[159],"coarse-grained":[160],"algorithmic":[161],"improvements":[162],"fine-grained":[164],"optimizations":[165],"API":[167],"usage.":[168],"We":[169],"evaluate":[170],"two":[173],"benchmarks,":[176],"COFFE":[177],"Effibench.":[179],"Our":[180],"results":[181],"demonstrate":[182],"achieves":[185,236],"an":[186,210,237,243],"up":[187,211,227,238,244],"57.48%":[189],"opt%,":[190],"i.e.,":[191],"percentage":[193],"optimized":[195],"programs":[196],"correct":[199],"least":[202],"10%":[203],"faster":[204],"than":[205],"original":[207],"programs,":[208],"3.97x":[213],"speedup":[214,247],"when":[215,248],"optimizing":[216,249],"human-written":[217],"code,":[218],"it":[220],"consistently":[221],"outperforms":[222],"best":[224],"baseline":[225],"by":[226],"96.51%":[229],"terms":[231],"opt%.":[233],"Furthermore,":[234],"42.42%":[240],"opt%":[241],"13.51x":[246],"LLM-generated":[250],"code.":[251]},"counts_by_year":[],"updated_date":"2026-07-29T09:40:50.615796","created_date":"2026-07-29T00:00:00"}