{"id":"https://openalex.org/W7130588917","doi":"https://doi.org/10.48550/arxiv.2602.16038","title":"Heuristic Search as Language-Guided Program Optimization","display_name":"Heuristic Search as Language-Guided Program Optimization","publication_year":2026,"publication_date":"2026-02-17","ids":{"openalex":"https://openalex.org/W7130588917","doi":"https://doi.org/10.48550/arxiv.2602.16038"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2602.16038","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":null,"any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5126426267","display_name":"Mingxin Yu","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Yu, Mingxin","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5126408396","display_name":"Ruixiao Yang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Yang, Ruixiao","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5121504364","display_name":"Chuchu Fan","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Fan, Chuchu","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5126426267"],"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/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.1761000007390976,"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"}},"topics":[{"id":"https://openalex.org/T11596","display_name":"Constraint Satisfaction and Optimization","score":0.1761000007390976,"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.0828000009059906,"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/T12535","display_name":"Machine Learning and Data Classification","score":0.06710000336170197,"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/heuristic","display_name":"Heuristic","score":0.7023000121116638},{"id":"https://openalex.org/keywords/modular-design","display_name":"Modular design","score":0.6887000203132629},{"id":"https://openalex.org/keywords/process","display_name":"Process (computing)","score":0.5751000046730042},{"id":"https://openalex.org/keywords/abstraction","display_name":"Abstraction","score":0.5493000149726868},{"id":"https://openalex.org/keywords/pipeline","display_name":"Pipeline (software)","score":0.5095000267028809},{"id":"https://openalex.org/keywords/domain","display_name":"Domain (mathematical analysis)","score":0.4693000018596649},{"id":"https://openalex.org/keywords/limit","display_name":"Limit (mathematics)","score":0.4361000061035156},{"id":"https://openalex.org/keywords/iterative-and-incremental-development","display_name":"Iterative and incremental development","score":0.4269999861717224}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7853000164031982},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.7023000121116638},{"id":"https://openalex.org/C101468663","wikidata":"https://www.wikidata.org/wiki/Q1620158","display_name":"Modular design","level":2,"score":0.6887000203132629},{"id":"https://openalex.org/C98045186","wikidata":"https://www.wikidata.org/wiki/Q205663","display_name":"Process (computing)","level":2,"score":0.5751000046730042},{"id":"https://openalex.org/C124304363","wikidata":"https://www.wikidata.org/wiki/Q673661","display_name":"Abstraction","level":2,"score":0.5493000149726868},{"id":"https://openalex.org/C43521106","wikidata":"https://www.wikidata.org/wiki/Q2165493","display_name":"Pipeline (software)","level":2,"score":0.5095000267028809},{"id":"https://openalex.org/C36503486","wikidata":"https://www.wikidata.org/wiki/Q11235244","display_name":"Domain (mathematical analysis)","level":2,"score":0.4693000018596649},{"id":"https://openalex.org/C151201525","wikidata":"https://www.wikidata.org/wiki/Q177239","display_name":"Limit (mathematics)","level":2,"score":0.4361000061035156},{"id":"https://openalex.org/C143587482","wikidata":"https://www.wikidata.org/wiki/Q1543216","display_name":"Iterative and incremental development","level":2,"score":0.4269999861717224},{"id":"https://openalex.org/C2780615140","wikidata":"https://www.wikidata.org/wiki/Q920419","display_name":"Upgrade","level":2,"score":0.3837999999523163},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.37630000710487366},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.34929999709129333},{"id":"https://openalex.org/C168167062","wikidata":"https://www.wikidata.org/wiki/Q1117970","display_name":"Component (thermodynamics)","level":2,"score":0.3310999870300293},{"id":"https://openalex.org/C80444323","wikidata":"https://www.wikidata.org/wiki/Q2878974","display_name":"Theoretical computer science","level":1,"score":0.31940001249313354},{"id":"https://openalex.org/C147764199","wikidata":"https://www.wikidata.org/wiki/Q6865248","display_name":"Minification","level":2,"score":0.3068999946117401},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.2833999991416931},{"id":"https://openalex.org/C207685749","wikidata":"https://www.wikidata.org/wiki/Q2088941","display_name":"Domain knowledge","level":2,"score":0.27459999918937683},{"id":"https://openalex.org/C2778112365","wikidata":"https://www.wikidata.org/wiki/Q3511065","display_name":"Sequence (biology)","level":2,"score":0.26919999718666077},{"id":"https://openalex.org/C34972735","wikidata":"https://www.wikidata.org/wiki/Q2920267","display_name":"Engineering design process","level":2,"score":0.2603999972343445},{"id":"https://openalex.org/C48262172","wikidata":"https://www.wikidata.org/wiki/Q16908765","display_name":"Design process","level":3,"score":0.2590000033378601},{"id":"https://openalex.org/C2781011336","wikidata":"https://www.wikidata.org/wiki/Q1465133","display_name":"Time limit","level":2,"score":0.2565999925136566},{"id":"https://openalex.org/C2779982483","wikidata":"https://www.wikidata.org/wiki/Q6094420","display_name":"Iterative refinement","level":2,"score":0.2535000145435333},{"id":"https://openalex.org/C2776235265","wikidata":"https://www.wikidata.org/wiki/Q18392052","display_name":"Fragment (logic)","level":2,"score":0.2515999972820282}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2602.16038","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},{"id":"doi:10.48550/arxiv.2602.16038","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2602.16038","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"pmh:doi:10.48550/arxiv.2602.16038","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"Article"},"sustainable_development_goals":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":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],"advanced":[5],"Automated":[6],"Heuristic":[7],"Design":[8],"(AHD)":[9],"in":[10,14,132,155],"combinatorial":[11],"optimization":[12],"(CO)":[13],"the":[15,52,71,162],"past":[16],"few":[17],"years.":[18],"However,":[19],"existing":[20],"discovery":[21,73],"pipelines":[22],"often":[23],"require":[24],"extensive":[25],"manual":[26],"trial-and-error":[27],"or":[28,37],"reliance":[29],"on":[30,134],"domain":[31],"expertise":[32],"to":[33,35,129],"adapt":[34],"new":[36],"complex":[38],"problems.":[39],"This":[40,96],"stems":[41],"from":[42],"tightly":[43],"coupled":[44],"internal":[45],"mechanisms":[46],"that":[47,68,141],"limit":[48],"systematic":[49],"improvement":[50,131],"of":[51,109,149],"LLM-driven":[53,66],"design":[54],"process.":[55],"To":[56],"address":[57],"this":[58],"challenge,":[59],"we":[60,139,159],"propose":[61],"a":[62,78,83,99],"structured":[63,157],"framework":[64,115],"for":[65,81,86,93,102],"AHD":[67,144],"explicitly":[69],"decomposes":[70],"heuristic":[72],"process":[74],"into":[75],"modular":[76],"stages:":[77],"forward":[79],"pass":[80,85],"evaluation,":[82],"backward":[84],"analytical":[87],"feedback,":[88],"and":[89,105,165],"an":[90],"update":[91],"step":[92],"program":[94],"refinement.":[95],"separation":[97],"provides":[98],"clear":[100],"abstraction":[101],"iterative":[103],"refinement":[104],"enables":[106],"principled":[107],"improvements":[108],"individual":[110],"components.":[111],"We":[112],"validate":[113],"our":[114,150,156],"across":[116],"four":[117],"diverse":[118],"real-world":[119],"CO":[120],"domains,":[121],"where":[122],"it":[123],"consistently":[124],"outperforms":[125],"baselines,":[126],"achieving":[127],"up":[128],"$0.17$":[130],"QYI":[133],"unseen":[135],"test":[136],"sets.":[137],"Finally,":[138],"show":[140],"several":[142],"popular":[143],"methods":[145],"are":[146],"restricted":[147],"instantiations":[148],"framework.":[151],"By":[152],"integrating":[153],"them":[154],"pipeline,":[158],"can":[160],"upgrade":[161],"components":[163],"modularly":[164],"significantly":[166],"improve":[167],"their":[168],"performance.":[169]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2026-02-20T00:00:00"}