{"id":"https://openalex.org/W7163130830","doi":"https://doi.org/10.48550/arxiv.2606.00862","title":"Meta-Black-Box Optimization with Ensemble Surrogate Modeling for Robustness-Accuracy Trade-off within SAEA","display_name":"Meta-Black-Box Optimization with Ensemble Surrogate Modeling for Robustness-Accuracy Trade-off within SAEA","publication_year":2026,"publication_date":"2026-05-30","ids":{"openalex":"https://openalex.org/W7163130830","doi":"https://doi.org/10.48550/arxiv.2606.00862"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2606.00862","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.00862","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.2606.00862","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5137648985","display_name":"Xiao Jin","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jin, Xiao","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5021144916","display_name":"Yongxiong Wang","orcid":"https://orcid.org/0000-0002-7390-3089"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Wang, Yongxiong","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5135989484","display_name":"Haobo Liu","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Liu, Haobo","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5129968050","display_name":"Yudong Du","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Du, Yudong","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5137663985","display_name":"Yukun Du","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Du, Yukun","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/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.9416999816894531,"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.9416999816894531,"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/T10100","display_name":"Metaheuristic Optimization Algorithms Research","score":0.021199999377131462,"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/T12535","display_name":"Machine Learning and Data Classification","score":0.007600000128149986,"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/robustness","display_name":"Robustness (evolution)","score":0.6571999788284302},{"id":"https://openalex.org/keywords/boosting","display_name":"Boosting (machine learning)","score":0.6420000195503235},{"id":"https://openalex.org/keywords/surrogate-model","display_name":"Surrogate model","score":0.5971999764442444},{"id":"https://openalex.org/keywords/flexibility","display_name":"Flexibility (engineering)","score":0.4973999857902527},{"id":"https://openalex.org/keywords/ensemble-learning","display_name":"Ensemble learning","score":0.47510001063346863},{"id":"https://openalex.org/keywords/evolutionary-algorithm","display_name":"Evolutionary algorithm","score":0.4742000102996826},{"id":"https://openalex.org/keywords/adaptive-sampling","display_name":"Adaptive sampling","score":0.438400000333786},{"id":"https://openalex.org/keywords/sampling","display_name":"Sampling (signal processing)","score":0.4115000069141388}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6676999926567078},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.6571999788284302},{"id":"https://openalex.org/C46686674","wikidata":"https://www.wikidata.org/wiki/Q466303","display_name":"Boosting (machine learning)","level":2,"score":0.6420000195503235},{"id":"https://openalex.org/C131675550","wikidata":"https://www.wikidata.org/wiki/Q7646884","display_name":"Surrogate model","level":2,"score":0.5971999764442444},{"id":"https://openalex.org/C119857082","wikidata":"https://www.wikidata.org/wiki/Q2539","display_name":"Machine learning","level":1,"score":0.5332000255584717},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5062999725341797},{"id":"https://openalex.org/C2780598303","wikidata":"https://www.wikidata.org/wiki/Q65921492","display_name":"Flexibility (engineering)","level":2,"score":0.4973999857902527},{"id":"https://openalex.org/C45942800","wikidata":"https://www.wikidata.org/wiki/Q245652","display_name":"Ensemble learning","level":2,"score":0.47510001063346863},{"id":"https://openalex.org/C159149176","wikidata":"https://www.wikidata.org/wiki/Q14489129","display_name":"Evolutionary algorithm","level":2,"score":0.4742000102996826},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.4593000113964081},{"id":"https://openalex.org/C2781395549","wikidata":"https://www.wikidata.org/wiki/Q4680762","display_name":"Adaptive sampling","level":3,"score":0.438400000333786},{"id":"https://openalex.org/C140779682","wikidata":"https://www.wikidata.org/wiki/Q210868","display_name":"Sampling (signal processing)","level":3,"score":0.4115000069141388},{"id":"https://openalex.org/C177148314","wikidata":"https://www.wikidata.org/wiki/Q170084","display_name":"Generalization","level":2,"score":0.3619000017642975},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.35269999504089355},{"id":"https://openalex.org/C110332635","wikidata":"https://www.wikidata.org/wiki/Q629498","display_name":"Genetic programming","level":2,"score":0.328000009059906},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3197999894618988},{"id":"https://openalex.org/C105902424","wikidata":"https://www.wikidata.org/wiki/Q1197129","display_name":"Evolutionary computation","level":2,"score":0.30959999561309814},{"id":"https://openalex.org/C112972136","wikidata":"https://www.wikidata.org/wiki/Q7595718","display_name":"Stability (learning theory)","level":2,"score":0.28760001063346863},{"id":"https://openalex.org/C97541855","wikidata":"https://www.wikidata.org/wiki/Q830687","display_name":"Reinforcement learning","level":2,"score":0.2791000008583069},{"id":"https://openalex.org/C2781219549","wikidata":"https://www.wikidata.org/wiki/Q811475","display_name":"Infill","level":2,"score":0.262800008058548},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.2556999921798706},{"id":"https://openalex.org/C2775924081","wikidata":"https://www.wikidata.org/wiki/Q55608371","display_name":"Control (management)","level":2,"score":0.2551000118255615},{"id":"https://openalex.org/C119898033","wikidata":"https://www.wikidata.org/wiki/Q3433888","display_name":"Ensemble forecasting","level":2,"score":0.25060001015663147}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2606.00862","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.00862","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.2606.00862","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2606.00862","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":[],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Surrogate-assisted":[0],"evolutionary":[1,99],"algorithms":[2],"(SAEAs)":[3],"have":[4,54],"been":[5,85],"widely":[6],"used":[7],"for":[8,36,75,101,205],"expensive":[9,102],"black-box":[10],"optimization":[11,30],"problems.":[12],"However,":[13],"their":[14,23],"reliance":[15],"on":[16,179],"rigid":[17],"and":[18,25,51,79,116,122,128,140,169,176,181,190,226],"manually":[19],"designed":[20,131],"components":[21],"limits":[22],"flexibility":[24],"generalization":[26],"across":[27,142],"tasks.":[28],"Meta-black-box":[29],"(MetaBBO)":[31],"provides":[32],"a":[33,48],"promising":[34],"paradigm":[35],"adaptively":[37,137],"configuring":[38],"algorithmic":[39],"components.":[40],"Nevertheless,":[41],"existing":[42],"MetaBBO":[43,114],"methods":[44],"usually":[45],"control":[46,58,222],"only":[47],"single":[49],"component,":[50],"few":[52],"studies":[53],"investigated":[55],"the":[56,66,109,113,119,147,151,196,201,209,216,221,234],"unified":[57],"of":[59,198,211,223],"multi-component":[60],"optimizers":[61],"such":[62],"as":[63,108,132,200],"SAEAs.":[64],"Moreover,":[65],"robustness-accuracy":[67],"trade-off":[68],"in":[69,229],"surrogate":[70,124,133,203,224],"modeling,":[71],"which":[72],"is":[73,161,215],"crucial":[74],"stable":[76],"early-stage":[77],"exploration":[78],"accurate":[80],"late-stage":[81],"exploitation,":[82],"has":[83],"rarely":[84],"explicitly":[86,232],"considered.":[87],"To":[88,208],"address":[89],"these":[90],"issues,":[91],"we":[92],"propose":[93],"AdaE-SAEA,":[94],"an":[95],"adaptive":[96,156],"ensemble":[97,206],"surrogate-assisted":[98],"algorithm":[100],"multi-objective":[103],"optimization.":[104],"AdaE-SAEA":[105,186],"embeds":[106],"SAEA":[107],"low-level":[110],"optimizer":[111],"within":[112],"framework":[115],"jointly":[117],"controls":[118],"infill":[120,152,227],"criterion":[121,153],"ensemble-based":[123],"modeling.":[125],"Specifically,":[126],"bagging":[127],"boosting":[129],"are":[130],"modeling":[134,225],"modules":[135],"to":[136,154,219],"balance":[138],"robustness":[139],"accuracy":[141],"different":[143],"search":[144],"phases,":[145],"while":[146,231],"meta-policy":[148,160],"simultaneously":[149],"selects":[150],"enable":[155],"sampling":[157,168],"decisions.":[158],"The":[159],"trained":[162],"through":[163],"reinforcement":[164],"learning":[165],"with":[166],"parallel":[167],"centralized":[170],"training,":[171],"improving":[172],"both":[173],"training":[174],"efficiency":[175],"transferability.":[177],"Experiments":[178],"synthetic":[180],"real-world":[182],"problems":[183],"demonstrate":[184],"that":[185],"outperforms":[187],"state-of-the-art":[188],"baselines":[189],"MetaBBO-based":[191],"methods.":[192],"We":[193],"further":[194],"verify":[195],"effectiveness":[197],"TabPFN":[199],"base":[202],"model":[204],"learning.":[207],"best":[210],"our":[212],"knowledge,":[213],"this":[214],"first":[217],"work":[218],"unify":[220],"criteria":[228],"SAEAs":[230],"addressing":[233],"robustness--accuracy":[235],"trade-off.":[236]},"counts_by_year":[],"updated_date":"2026-07-01T06:00:48.157686","created_date":"2026-06-03T00:00:00"}