{"id":"https://openalex.org/W4417104500","doi":"https://doi.org/10.48550/arxiv.2508.02503","title":"OptiHive: Ensemble Selection for LLM-Based Optimization via Statistical Modeling","display_name":"OptiHive: Ensemble Selection for LLM-Based Optimization via Statistical Modeling","publication_year":2025,"publication_date":"2025-08-04","ids":{"openalex":"https://openalex.org/W4417104500","doi":"https://doi.org/10.48550/arxiv.2508.02503"},"language":"en","primary_location":{"id":"pmh:oai:arXiv.org:2508.02503","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2508.02503","pdf_url":"https://arxiv.org/pdf/2508.02503","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"type":"preprint","indexed_in":["arxiv","datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://arxiv.org/pdf/2508.02503","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5120719037","display_name":"Maxime Bouscary","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Bouscary, Maxime","raw_affiliation_strings":[],"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":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":2,"corresponding_author_ids":["https://openalex.org/A5120719037"],"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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.21140000224113464,"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.21140000224113464,"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/T10567","display_name":"Vehicle Routing Optimization Methods","score":0.11060000211000443,"subfield":{"id":"https://openalex.org/subfields/2209","display_name":"Industrial and Manufacturing Engineering"},"field":{"id":"https://openalex.org/fields/22","display_name":"Engineering"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}},{"id":"https://openalex.org/T10142","display_name":"Formal Methods in Verification","score":0.1023000031709671,"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"}}],"keywords":[{"id":"https://openalex.org/keywords/solver","display_name":"Solver","score":0.6816999912261963},{"id":"https://openalex.org/keywords/pipeline","display_name":"Pipeline (software)","score":0.604200005531311},{"id":"https://openalex.org/keywords/selection","display_name":"Selection (genetic algorithm)","score":0.5163999795913696},{"id":"https://openalex.org/keywords/statistical-model","display_name":"Statistical model","score":0.5008000135421753},{"id":"https://openalex.org/keywords/ranging","display_name":"Ranging","score":0.4187000095844269},{"id":"https://openalex.org/keywords/model-selection","display_name":"Model selection","score":0.40450000762939453},{"id":"https://openalex.org/keywords/optimization-problem","display_name":"Optimization problem","score":0.3427000045776367}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.7214999794960022},{"id":"https://openalex.org/C2778770139","wikidata":"https://www.wikidata.org/wiki/Q1966904","display_name":"Solver","level":2,"score":0.6816999912261963},{"id":"https://openalex.org/C43521106","wikidata":"https://www.wikidata.org/wiki/Q2165493","display_name":"Pipeline (software)","level":2,"score":0.604200005531311},{"id":"https://openalex.org/C81917197","wikidata":"https://www.wikidata.org/wiki/Q628760","display_name":"Selection (genetic algorithm)","level":2,"score":0.5163999795913696},{"id":"https://openalex.org/C114289077","wikidata":"https://www.wikidata.org/wiki/Q3284399","display_name":"Statistical model","level":2,"score":0.5008000135421753},{"id":"https://openalex.org/C115051666","wikidata":"https://www.wikidata.org/wiki/Q6522493","display_name":"Ranging","level":2,"score":0.4187000095844269},{"id":"https://openalex.org/C93959086","wikidata":"https://www.wikidata.org/wiki/Q6888345","display_name":"Model selection","level":2,"score":0.40450000762939453},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.37070000171661377},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3427000045776367},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.34220001101493835},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.34130001068115234},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.31520000100135803},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.3138999938964844},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.2980000078678131},{"id":"https://openalex.org/C74172769","wikidata":"https://www.wikidata.org/wiki/Q1446839","display_name":"Routing (electronic design automation)","level":2,"score":0.2897000014781952},{"id":"https://openalex.org/C67186912","wikidata":"https://www.wikidata.org/wiki/Q367664","display_name":"Data modeling","level":2,"score":0.2766000032424927},{"id":"https://openalex.org/C32230216","wikidata":"https://www.wikidata.org/wiki/Q7882499","display_name":"Uncertainty quantification","level":2,"score":0.27649998664855957},{"id":"https://openalex.org/C159694833","wikidata":"https://www.wikidata.org/wiki/Q2321565","display_name":"Iterative method","level":2,"score":0.27059999108314514},{"id":"https://openalex.org/C41045048","wikidata":"https://www.wikidata.org/wiki/Q202843","display_name":"Linear programming","level":2,"score":0.2538999915122986}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:oai:arXiv.org:2508.02503","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2508.02503","pdf_url":"https://arxiv.org/pdf/2508.02503","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},{"id":"doi:10.48550/arxiv.2508.02503","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2508.02503","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":"article"}],"best_oa_location":{"id":"pmh:oai:arXiv.org:2508.02503","is_oa":true,"landing_page_url":"http://arxiv.org/abs/2508.02503","pdf_url":"https://arxiv.org/pdf/2508.02503","source":{"id":"https://openalex.org/S4393918464","display_name":"ArXiv.org","issn_l":"2331-8422","issn":["2331-8422"],"is_oa":true,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"text"},"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":{"LLM-based":[0],"solvers":[1,43],"have":[2],"emerged":[3],"as":[4],"a":[5,33,52,86],"promising":[6],"means":[7],"of":[8,47,80,111],"automating":[9],"problem":[10,61],"modeling":[11],"and":[12,18,63,66,98],"solving.":[13],"However,":[14],"they":[15],"remain":[16],"unreliable":[17],"often":[19],"depend":[20],"on":[21,129],"iterative":[22],"repair":[23],"loops":[24],"that":[25,35],"result":[26],"in":[27],"significant":[28],"latency.":[29],"We":[30],"introduce":[31],"OptiHive,":[32],"framework":[34],"enhances":[36],"any":[37],"solver-generation":[38],"pipeline":[39],"to":[40,56,71,89,108,127],"produce":[41,57],"higher-quality":[42],"from":[44,104,125],"natural-language":[45],"descriptions":[46],"optimization":[48,106],"problems.":[49,133],"OptiHive":[50,117],"uses":[51],"single":[53],"batched":[54],"generation":[55],"diverse":[58],"components":[59,70],"(solvers,":[60],"instances,":[62],"validation":[64],"tests)":[65],"filters":[67],"out":[68],"erroneous":[69],"ensure":[72],"fully":[73],"interpretable":[74],"outputs.":[75],"Accounting":[76],"for":[77],"the":[78,81,112,122,130],"imperfection":[79],"generated":[82],"components,":[83],"we":[84],"employ":[85],"statistical":[87],"model":[88],"infer":[90],"their":[91],"true":[92],"performance,":[93],"enabling":[94],"principled":[95],"uncertainty":[96],"quantification":[97],"solver":[99],"selection.":[100],"On":[101],"tasks":[102],"ranging":[103],"traditional":[105],"problems":[107],"challenging":[109],"variants":[110],"Multi-Depot":[113],"Vehicle":[114],"Routing":[115],"Problem,":[116],"significantly":[118],"outperforms":[119],"baselines,":[120],"increasing":[121],"optimality":[123],"rate":[124],"5%":[126],"92%":[128],"most":[131],"complex":[132]},"counts_by_year":[],"updated_date":"2026-03-07T16:01:11.037858","created_date":"2025-10-10T00:00:00"}