{"id":"https://openalex.org/W7166839657","doi":"https://doi.org/10.18653/v1/2026.findings-acl.245","title":"Experience-Driven Reflective Co-Evolution of Prompts and Heuristics for Autonomous Algorithm Design","display_name":"Experience-Driven Reflective Co-Evolution of Prompts and Heuristics for Autonomous Algorithm Design","publication_year":2026,"publication_date":"2026-01-01","ids":{"openalex":"https://openalex.org/W7166839657","doi":"https://doi.org/10.18653/v1/2026.findings-acl.245"},"language":null,"primary_location":{"id":"doi:10.18653/v1/2026.findings-acl.245","is_oa":true,"landing_page_url":"https://doi.org/10.18653/v1/2026.findings-acl.245","pdf_url":"https://aclanthology.org/2026.findings-acl.245.pdf","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Findings of the Association for Computational Linguistics: ACL 2026","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://aclanthology.org/2026.findings-acl.245.pdf","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5139750533","display_name":"Yihong Liu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yihong Liu","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5139849722","display_name":"Junyi Jessy Li","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Junyi Li","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5139849927","display_name":"Hongyu Lu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Hongyu Lu","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5139830268","display_name":"Xin Zhao","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Xin Zhao","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5139737149","display_name":"Ji-Rong Wen","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Ji-Rong Wen","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":true,"cited_by_count":0,"citation_normalized_percentile":{"value":0.84003004,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"4981","last_page":"4995"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.08049999922513962,"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"}},"topics":[{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.08049999922513962,"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.07270000129938126,"subfield":{"id":"https://openalex.org/subfields/1705","display_name":"Computer Networks and Communications"},"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.06499999761581421,"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/heuristics","display_name":"Heuristics","score":0.4952000081539154},{"id":"https://openalex.org/keywords/key","display_name":"Key (lock)","score":0.29190000891685486},{"id":"https://openalex.org/keywords/algorithm-design","display_name":"Algorithm design","score":0.2766000032424927},{"id":"https://openalex.org/keywords/feature","display_name":"Feature (linguistics)","score":0.26840001344680786},{"id":"https://openalex.org/keywords/work","display_name":"Work (physics)","score":0.25929999351501465}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6029000282287598},{"id":"https://openalex.org/C127705205","wikidata":"https://www.wikidata.org/wiki/Q5748245","display_name":"Heuristics","level":2,"score":0.4952000081539154},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.42480000853538513},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3589000105857849},{"id":"https://openalex.org/C26517878","wikidata":"https://www.wikidata.org/wiki/Q228039","display_name":"Key (lock)","level":2,"score":0.29190000891685486},{"id":"https://openalex.org/C106516650","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm design","level":2,"score":0.2766000032424927},{"id":"https://openalex.org/C2776401178","wikidata":"https://www.wikidata.org/wiki/Q12050496","display_name":"Feature (linguistics)","level":2,"score":0.26840001344680786},{"id":"https://openalex.org/C31972630","wikidata":"https://www.wikidata.org/wiki/Q844240","display_name":"Computer vision","level":1,"score":0.2660999894142151},{"id":"https://openalex.org/C18762648","wikidata":"https://www.wikidata.org/wiki/Q42213","display_name":"Work (physics)","level":2,"score":0.25929999351501465},{"id":"https://openalex.org/C2780791683","wikidata":"https://www.wikidata.org/wiki/Q846785","display_name":"Action (physics)","level":2,"score":0.2578999996185303}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.18653/v1/2026.findings-acl.245","is_oa":true,"landing_page_url":"https://doi.org/10.18653/v1/2026.findings-acl.245","pdf_url":"https://aclanthology.org/2026.findings-acl.245.pdf","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Findings of the Association for Computational Linguistics: ACL 2026","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.18653/v1/2026.findings-acl.245","is_oa":true,"landing_page_url":"https://doi.org/10.18653/v1/2026.findings-acl.245","pdf_url":"https://aclanthology.org/2026.findings-acl.245.pdf","source":null,"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Findings of the Association for Computational Linguistics: ACL 2026","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G4128466783","display_name":null,"funder_award_id":"92470205","funder_id":"https://openalex.org/F4320321001","funder_display_name":"National Natural Science Foundation of China"}],"funders":[{"id":"https://openalex.org/F4320321001","display_name":"National Natural Science Foundation of China","ror":"https://ror.org/01h0zpd94"}],"has_content":{"grobid_xml":true,"pdf":true},"content_urls":{"pdf":"https://content.openalex.org/works/W7166839657.pdf","grobid_xml":"https://content.openalex.org/works/W7166839657.grobid-xml"},"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Combinatorial":[0],"optimization":[1,33,152],"has":[2,24],"long":[3],"been":[4],"dominated":[5],"by":[6,108,344],"manually":[7],"engineered":[8],"heuristics,":[9],"a":[10,77,104,138,147,203,219,272,321,359,371,385,426,461],"paradigm":[11],"requiring":[12],"substantial":[13],"expert":[14,149],"intuition":[15],"and":[16,32,70,99,123,153,160,198,208,293,400,415,434,470],"implementation":[17],"overhead.The":[18],"advent":[19],"of":[20,34,68,195,476],"Large":[21],"Language":[22],"Models":[23],"disrupted":[25],"this":[26,300],"landscape,":[27],"enabling":[28],"the":[29,64,96,100,113,120,169,182,192,240,246,261,288,306,331,336,353,364,367,390,436,464,477],"autonomous":[30,74],"synthesis":[31],"algorithms.Recent":[35],"approaches":[36],"typically":[37],"iterate":[38],"on":[39,119,218,330],"heuristic":[40,310,323],"populations":[41],"using":[42,103,348],"LLMs":[43],"as":[44,237,243],"mutators;":[45],"however,":[46],"these":[47],"strategies":[48],"often":[49,269,439],"suffer":[50],"from":[51,363],"limited":[52],"exploration,":[53],"leading":[54],"to":[55,89,111,135,157,167,180,239,291,297,418],"stagnation":[56],"in":[57,142,150,185],"local":[58,373,424],"optima.To":[59],"overcome":[60],"this,":[61],"we":[62],"present":[63],"Experience-Driven":[65],"Reflective":[66],"Co-Evolution":[67],"Prompt":[69],"Heuristics":[71],"(EvoPH)":[72],"for":[73,384],"algorithm":[75,144,338,354],"design,":[76],"novel":[78],"framework":[79],"that":[80,129,205,324],"couples":[81],"an":[82,162],"island":[83],"migration":[84],"model":[85],"with":[86,358,392],"elite":[87],"selection":[88],"maintain":[90],"population":[91],"diversity.Uniquely,":[92],"EvoPH":[93,130],"co-evolves":[94],"both":[95],"guiding":[97],"prompts":[98],"heuristics":[101],"themselves,":[102],"feedback":[105],"loop":[106],"driven":[107],"past":[109],"experience":[110],"refine":[112],"search":[114],"process.We":[115],"demonstrate":[116],"EvoPH's":[117],"efficacy":[118],"Traveling":[121,170],"Salesman":[122],"Bin":[124],"Packing":[125],"Problems.Our":[126],"results":[127],"show":[128],"achieves":[131],"superior":[132],"accuracy":[133],"compared":[134],"baselines,":[136],"marking":[137],"significant":[139],"step":[140],"forward":[141],"LLM-aided":[143],"design.You":[145],"are":[146,201,314,452],"top":[148,247],"combinatorial":[151],"algorithms.Your":[154],"task":[155],"is":[156,179,216,245,268,311,408,438],"**iteratively":[158],"evolve":[159],"refine**":[161],"existing":[163],"Python":[164],"function,":[165],"`solve_tsp_approximate(dist_matrix)`,":[166],"solve":[168],"Salesperson":[171],"Problem":[172],"(TSP).##":[173],"Evolutionary":[174,280],"Goal":[175],"Your":[176,214,279,409],"primary":[177],"objective":[178],"enhance":[181],"provided":[183,290],"function":[184,204,255,289,368,391,458,479],"each":[186,283],"evolutionary":[187,333],"step,":[188],"pushing":[189],"it":[190,296,312,397],"towards":[191],"optimal":[193],"balance":[194],"solution":[196,267,462],"quality":[197],"speed.Assume":[199],"you":[200,285,292],"receiving":[202],"already":[206,369],"exists":[207],"needs":[209],"improvement.##":[210],"Key":[211],"Optimization":[212],"Metrics":[213],"success":[215],"measured":[217],"trade-off":[220],"between":[221],"two":[222,378],"competing":[223],"goals:":[224],"1.":[225,302],"**Minimize":[226,249],"Relative":[227],"Error":[228],"(Solution":[229],"Quality)**:":[230],"The":[231,254,449,473],"solution's":[232],"path":[233],"length":[234],"must":[235,256,286,459],"be":[236,298,380],"close":[238],"known":[241],"optimum":[242],"possible.This":[244],"priority.2.":[248],"Execution":[250],"Time":[251],"(Computational":[252],"Efficiency)**:":[253],"execute":[257],"extremely":[258],"quickly":[259],"within":[260,463],"evaluator's":[262],"strict":[263],"time":[264,456,465],"limit.A":[265],"faster":[266,440],"better":[270,349,386],"than":[271,441],"marginally":[273],"more":[274,360],"accurate":[275],"but":[276,340],"slower":[277],"one.##":[278],"Directives":[281],"In":[282],"round,":[284],"analyze":[287],"then":[294],"rewrite":[295],"better.Follow":[299],"process:":[301],"**Analyze**:":[303],"Quickly":[304],"understand":[305],"current":[307,337],"function's":[308],"strategy.What":[309],"using?What":[313],"its":[315],"potential":[316],"weaknesses":[317],"(e.g.,":[318],"slow":[319],"loops,":[320],"simple":[322],"gets":[325],"stuck)?":[326],"2.":[327],"**Strategize**:":[328],"Decide":[329],"best":[332,450],"step.*":[334],"Is":[335,352],"good":[339,432],"implemented":[341],"inefficiently?**Refine":[342],"it**":[343,357,375],"optimizing":[345],"loops":[346],"or":[347],"data":[350],"structures.*":[351],"too":[355],"basic?**Replace":[356],"powerful":[361],"one":[362,431],"toolbox.*":[365],"Does":[366],"have":[370],"strong":[372],"search?**Enhance":[374],".*":[376],"Can":[377],"ideas":[379],"combined?**Hybridize**":[381],"different":[382],"techniques":[383],"result.3.":[387],"**Implement**:":[388],"Rewrite":[389],"your":[393],"proposed":[394],"improvements,":[395],"ensuring":[396],"remains":[398],"robust":[399],"efficient.##":[401],"Performance":[402],"&":[403],"Implementation":[404],"Tips":[405],"*":[406],"**NumPy":[407],"Friend**:":[410],"Always":[411],"favor":[412],"`NumPy`for":[413],"vectorized":[414],"matrix":[416],"operations":[417],"maximize":[419],"speed.*":[420],"**Smart":[421],"Search**:":[422],"For":[423],"search,":[425],"\"first":[427],"improvement\"":[428,443],"strategy":[429],"(find":[430],"swap":[433],"restart":[435],"search)":[437],"\"best":[442],"(testing":[444],"all":[445],"possible":[446],"swaps).*":[447],"**Time-Awareness**:":[448],"algorithms":[451],"useless":[453],"if":[454],"they":[455],"out.The":[457],"return":[460],"limit.*":[466],"**Complete":[467],"provision**:Provide":[468],"complete":[469],"executable":[471],"code,":[472],"input":[474],"parsing":[475],"main":[478]},"counts_by_year":[],"updated_date":"2026-07-29T14:22:42.915294","created_date":"2026-07-02T00:00:00"}