{"id":"https://openalex.org/W7154008865","doi":"https://doi.org/10.48550/arxiv.2604.09417","title":"Do We Really Need to Approach the Entire Pareto Front in Many-Objective Bayesian Optimisation?","display_name":"Do We Really Need to Approach the Entire Pareto Front in Many-Objective Bayesian Optimisation?","publication_year":2026,"publication_date":"2026-04-10","ids":{"openalex":"https://openalex.org/W7154008865","doi":"https://doi.org/10.48550/arxiv.2604.09417"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2604.09417","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.09417","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.2604.09417","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5133500021","display_name":"Chao Jiang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Jiang, Chao","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5133537608","display_name":"Jingyu Huang","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Huang, Jingyu","raw_affiliation_strings":[],"raw_orcid":null,"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5122978030","display_name":"Miqing Li","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Li, Miqing","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.992900013923645,"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.992900013923645,"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/T12814","display_name":"Gaussian Processes and Bayesian Inference","score":0.0017000000225380063,"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/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.00139999995008111,"subfield":{"id":"https://openalex.org/subfields/1803","display_name":"Management Science and Operations Research"},"field":{"id":"https://openalex.org/fields/18","display_name":"Decision Sciences"},"domain":{"id":"https://openalex.org/domains/2","display_name":"Social Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/bayesian-probability","display_name":"Bayesian probability","score":0.5812000036239624},{"id":"https://openalex.org/keywords/convergence","display_name":"Convergence (economics)","score":0.5482000112533569},{"id":"https://openalex.org/keywords/pareto-principle","display_name":"Pareto principle","score":0.542900025844574},{"id":"https://openalex.org/keywords/focus","display_name":"Focus (optics)","score":0.5351999998092651},{"id":"https://openalex.org/keywords/sample","display_name":"Sample (material)","score":0.49880000948905945},{"id":"https://openalex.org/keywords/quality","display_name":"Quality (philosophy)","score":0.45190000534057617},{"id":"https://openalex.org/keywords/pareto-optimal","display_name":"Pareto optimal","score":0.43549999594688416}],"concepts":[{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.6496999859809875},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5853000283241272},{"id":"https://openalex.org/C107673813","wikidata":"https://www.wikidata.org/wiki/Q812534","display_name":"Bayesian probability","level":2,"score":0.5812000036239624},{"id":"https://openalex.org/C2777303404","wikidata":"https://www.wikidata.org/wiki/Q759757","display_name":"Convergence (economics)","level":2,"score":0.5482000112533569},{"id":"https://openalex.org/C137635306","wikidata":"https://www.wikidata.org/wiki/Q182667","display_name":"Pareto principle","level":2,"score":0.542900025844574},{"id":"https://openalex.org/C192209626","wikidata":"https://www.wikidata.org/wiki/Q190909","display_name":"Focus (optics)","level":2,"score":0.5351999998092651},{"id":"https://openalex.org/C198531522","wikidata":"https://www.wikidata.org/wiki/Q485146","display_name":"Sample (material)","level":2,"score":0.49880000948905945},{"id":"https://openalex.org/C2779530757","wikidata":"https://www.wikidata.org/wiki/Q1207505","display_name":"Quality (philosophy)","level":2,"score":0.45190000534057617},{"id":"https://openalex.org/C2986314615","wikidata":"https://www.wikidata.org/wiki/Q36829","display_name":"Pareto optimal","level":3,"score":0.43549999594688416},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4239000082015991},{"id":"https://openalex.org/C2778049539","wikidata":"https://www.wikidata.org/wiki/Q17002908","display_name":"Bayesian optimization","level":2,"score":0.3937999904155731},{"id":"https://openalex.org/C68781425","wikidata":"https://www.wikidata.org/wiki/Q2052203","display_name":"Multi-objective optimization","level":2,"score":0.3901999890804291},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.28360000252723694},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.26989999413490295},{"id":"https://openalex.org/C199978012","wikidata":"https://www.wikidata.org/wiki/Q1273815","display_name":"Bearing (navigation)","level":2,"score":0.26820001006126404},{"id":"https://openalex.org/C160234255","wikidata":"https://www.wikidata.org/wiki/Q812535","display_name":"Bayesian inference","level":3,"score":0.26739999651908875},{"id":"https://openalex.org/C129848803","wikidata":"https://www.wikidata.org/wiki/Q2564360","display_name":"Sample size determination","level":2,"score":0.2581000030040741},{"id":"https://openalex.org/C148764684","wikidata":"https://www.wikidata.org/wiki/Q621751","display_name":"Approximation algorithm","level":2,"score":0.2556000053882599},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.2517000138759613}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2604.09417","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.09417","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.2604.09417","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2604.09417","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":{"Many-objective":[0],"optimisation,":[1,6],"a":[2,45,73,79,117,131,167,183,188,197,255],"subset":[3],"of":[4,18,23,49,76,99,109,134,180,258],"multi-objective":[5],"involves":[7],"optimisation":[8,64,87,155],"problems":[9],"with":[10,221],"more":[11,125],"than":[12,143],"three":[13],"objectives.":[14,192],"As":[15],"the":[16,21,29,52,62,86,89,135,140,147,178,225,238,245],"number":[17,22,75],"objectives":[19],"increases,":[20],"solutions":[24,77,104,181],"needed":[25],"to":[26,43,127,145,176,187],"adequately":[27],"represent":[28],"entire":[30,53,148],"Pareto":[31,54,149],"front":[32,150],"typically":[33,157],"grows":[34],"substantially.":[35],"This":[36,56],"makes":[37],"it":[38,122],"challenging,":[39],"if":[40],"not":[41],"infeasible,":[42],"design":[44],"search":[46,171],"algorithm":[47],"capable":[48],"effectively":[50,220],"exploring":[51],"front.":[55],"difficulty":[57],"is":[58,69,248],"particularly":[59],"acute":[60],"in":[61,162],"Bayesian":[63,154],"paradigm,":[65],"where":[66],"sample":[67,226],"efficiency":[68],"critical":[70],"and":[71,210,231,251,260],"only":[72],"limited":[74,119],"(often":[78],"few":[80],"hundred)":[81],"are":[82,105],"evaluated.":[83],"Moreover,":[84],"after":[85],"process,":[88],"decision-maker":[90],"eventually":[91],"selects":[92],"just":[93],"one":[94],"solution":[95,133],"for":[96,139],"deployment,":[97],"regardless":[98],"how":[100],"many":[101],"high-quality,":[102],"diverse":[103],"available.":[106],"In":[107],"light":[108],"this,":[110],"we":[111,195],"argue":[112],"an":[113],"idea":[114,161],"that":[115,174,185,215,244],"under":[116,207,237],"very":[118],"evaluation":[120],"budget,":[121],"may":[123],"be":[124,218],"useful":[126],"focus":[128],"on":[129,254],"finding":[130],"single":[132],"highest":[136],"possible":[137],"quality":[138,179],"decision-maker,":[141],"rather":[142],"aiming":[144],"approximate":[146],"as":[151],"existing":[152],"many-/multi-objective":[153],"methods":[156,223],"do.":[158],"Bearing":[159],"this":[160,164],"mind,":[163],"paper":[165],"proposes":[166],"\\underline{s}ingle":[168],"\\underline{p}oint-based":[169],"\\underline{m}ulti-\\underline{o}bjective":[170],"framework":[172],"(SPMO)":[173],"aims":[175],"improve":[177],"along":[182],"direction":[184],"leads":[186],"good":[189],"tradeoff":[190],"between":[191],"Within":[193],"SPMO,":[194],"present":[196],"simple":[198],"acquisition":[199],"function,":[200],"called":[201],"expected":[202],"single-point":[203],"improvement":[204],"(ESPI),":[205],"working":[206],"both":[208],"noiseless":[209],"noisy":[211],"scenarios.":[212],"We":[213,240],"show":[214],"ESPI":[216],"can":[217],"optimised":[219],"gradient-based":[222],"via":[224],"average":[227],"approximation":[228],"(SAA)":[229],"approach":[230],"theoretically":[232],"prove":[233],"its":[234],"convergence":[235],"guarantees":[236],"SAA.":[239],"also":[241],"empirically":[242],"demonstrate":[243],"proposed":[246],"SPMO":[247],"computationally":[249],"tractable":[250],"outperforms":[252],"state-of-the-arts":[253],"wide":[256],"range":[257],"benchmark":[259],"real-world":[261],"problems.":[262]},"counts_by_year":[],"updated_date":"2026-07-28T07:46:37.118299","created_date":"2026-04-14T00:00:00"}