{"id":"https://openalex.org/W4413311571","doi":"https://doi.org/10.1145/3729878.3746704","title":"Trust Region-Based Bayesian Optimisation to Discover Diverse Solutions","display_name":"Trust Region-Based Bayesian Optimisation to Discover Diverse Solutions","publication_year":2025,"publication_date":"2025-08-19","ids":{"openalex":"https://openalex.org/W4413311571","doi":"https://doi.org/10.1145/3729878.3746704"},"language":"en","primary_location":{"id":"doi:10.1145/3729878.3746704","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3729878.3746704","pdf_url":null,"source":null,"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 18th ACM/SIGEVO Conference on Foundations of Genetic Algorithms","raw_type":"proceedings-article"},"type":"conference-paper","indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"gold","oa_url":"https://doi.org/10.1145/3729878.3746704","any_repository_has_fulltext":null},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5010187710","display_name":"Kokila Kasuni Perera","orcid":"https://orcid.org/0000-0002-0748-0815"},"institutions":[{"id":"https://openalex.org/I5681781","display_name":"The University of Adelaide","ror":"https://ror.org/00892tw58","country_code":"AU","type":"education","lineage":["https://openalex.org/I5681781"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Kokila Kasuni Perera","raw_affiliation_strings":["Optimisation and Logistics, School of Computer and Mathematical Sciences, The University of Adelaide, Adelaide, Australia"],"raw_orcid":"https://orcid.org/0000-0002-0748-0815","affiliations":[{"raw_affiliation_string":"Optimisation and Logistics, School of Computer and Mathematical Sciences, The University of Adelaide, Adelaide, Australia","institution_ids":["https://openalex.org/I5681781"]}]},{"author_position":"middle","author":{"id":"https://openalex.org/A5089531887","display_name":"Frank Neumann","orcid":"https://orcid.org/0000-0002-2721-3618"},"institutions":[{"id":"https://openalex.org/I5681781","display_name":"The University of Adelaide","ror":"https://ror.org/00892tw58","country_code":"AU","type":"education","lineage":["https://openalex.org/I5681781"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Frank Neumann","raw_affiliation_strings":["Optimisation and Logistics, School of Computer and Mathematical Sciences, The University of Adelaide, Adelaide, Australia"],"raw_orcid":"https://orcid.org/0000-0002-2721-3618","affiliations":[{"raw_affiliation_string":"Optimisation and Logistics, School of Computer and Mathematical Sciences, The University of Adelaide, Adelaide, Australia","institution_ids":["https://openalex.org/I5681781"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5001757263","display_name":"Aneta Neumann","orcid":"https://orcid.org/0000-0002-0036-4782"},"institutions":[{"id":"https://openalex.org/I5681781","display_name":"The University of Adelaide","ror":"https://ror.org/00892tw58","country_code":"AU","type":"education","lineage":["https://openalex.org/I5681781"]}],"countries":["AU"],"is_corresponding":false,"raw_author_name":"Aneta Neumann","raw_affiliation_strings":["Optimisation and Logistics, School of Computer and Mathematical Sciences, The University of Adelaide, Adelaide, Australia"],"raw_orcid":"https://orcid.org/0000-0002-0036-4782","affiliations":[{"raw_affiliation_string":"Optimisation and Logistics, School of Computer and Mathematical Sciences, The University of Adelaide, Adelaide, Australia","institution_ids":["https://openalex.org/I5681781"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I5681781"],"apc_list":null,"apc_paid":null,"fwci":null,"has_fulltext":false,"cited_by_count":1,"citation_normalized_percentile":null,"cited_by_percentile_year":null,"biblio":{"volume":null,"issue":null,"first_page":"214","last_page":"225"},"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.9987000226974487,"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.9987000226974487,"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/T12072","display_name":"Machine Learning and Algorithms","score":0.9836000204086304,"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/T11948","display_name":"Machine Learning in Materials Science","score":0.983299970626831,"subfield":{"id":"https://openalex.org/subfields/2505","display_name":"Materials Chemistry"},"field":{"id":"https://openalex.org/fields/25","display_name":"Materials Science"},"domain":{"id":"https://openalex.org/domains/3","display_name":"Physical Sciences"}}],"keywords":[{"id":"https://openalex.org/keywords/computer-science","display_name":"Computer science","score":0.6665114164352417},{"id":"https://openalex.org/keywords/bayesian-probability","display_name":"Bayesian probability","score":0.581488311290741},{"id":"https://openalex.org/keywords/data-science","display_name":"Data science","score":0.37803810834884644},{"id":"https://openalex.org/keywords/artificial-intelligence","display_name":"Artificial intelligence","score":0.3584386110305786},{"id":"https://openalex.org/keywords/data-mining","display_name":"Data mining","score":0.32372933626174927}],"concepts":[{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.6665114164352417},{"id":"https://openalex.org/C107673813","wikidata":"https://www.wikidata.org/wiki/Q812534","display_name":"Bayesian probability","level":2,"score":0.581488311290741},{"id":"https://openalex.org/C2522767166","wikidata":"https://www.wikidata.org/wiki/Q2374463","display_name":"Data science","level":1,"score":0.37803810834884644},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.3584386110305786},{"id":"https://openalex.org/C124101348","wikidata":"https://www.wikidata.org/wiki/Q172491","display_name":"Data mining","level":1,"score":0.32372933626174927}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.1145/3729878.3746704","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3729878.3746704","pdf_url":null,"source":null,"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 18th ACM/SIGEVO Conference on Foundations of Genetic Algorithms","raw_type":"proceedings-article"}],"best_oa_location":{"id":"doi:10.1145/3729878.3746704","is_oa":true,"landing_page_url":"https://doi.org/10.1145/3729878.3746704","pdf_url":null,"source":null,"license":"cc-by-nc","license_id":"https://openalex.org/licenses/cc-by-nc","version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"Proceedings of the 18th ACM/SIGEVO Conference on Foundations of Genetic Algorithms","raw_type":"proceedings-article"},"sustainable_development_goals":[],"awards":[{"id":"https://openalex.org/G810031174","display_name":null,"funder_award_id":"FT200100536","funder_id":"https://openalex.org/F4320323817","funder_display_name":"Universitas Brawijaya"}],"funders":[{"id":"https://openalex.org/F4320323817","display_name":"Universitas Brawijaya","ror":"https://ror.org/01wk3d929"}],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":16,"referenced_works":["https://openalex.org/W2128563800","https://openalex.org/W2314046539","https://openalex.org/W2604272474","https://openalex.org/W2962961217","https://openalex.org/W2963640987","https://openalex.org/W3174479306","https://openalex.org/W3216733725","https://openalex.org/W4291900849","https://openalex.org/W4292103447","https://openalex.org/W4367000260","https://openalex.org/W4384007770","https://openalex.org/W4384024043","https://openalex.org/W4393283970","https://openalex.org/W4399702139","https://openalex.org/W4400411219","https://openalex.org/W4400411982"],"related_works":["https://openalex.org/W4391375266","https://openalex.org/W2899084033","https://openalex.org/W2748952813","https://openalex.org/W2390279801","https://openalex.org/W4391913857","https://openalex.org/W2358668433","https://openalex.org/W4396701345","https://openalex.org/W2376932109","https://openalex.org/W2001405890","https://openalex.org/W4396696052"],"abstract_inverted_index":{"Bayesian":[0,145],"optimisation":[1,6,53,63,146],"(BO)":[2],"is":[3,68],"a":[4,75,93,99,119,177],"surrogate-based":[5],"technique":[7],"that":[8,73,138,165],"efficiently":[9],"solves":[10],"expensive":[11],"black-box":[12,112],"functions":[13,113,156],"with":[14,137,147,157,176],"small":[15],"evaluation":[16,179],"budgets.":[17],"Recent":[18],"studies":[19],"consider":[20],"trust":[21,47,76,148],"regions":[22],"to":[23,35,98,107,160],"improve":[24],"the":[25,31,44,69,130,140,166],"scalability":[26],"of":[27,46,139],"BO":[28,49,71],"approaches":[29,64,106],"when":[30],"problem":[32],"space":[33],"scales":[34],"more":[36],"dimensions.":[37],"Motivated":[38],"by":[39,114],"this":[40],"research,":[41],"we":[42],"explore":[43],"effectiveness":[45],"region-based":[48,77],"algorithms":[50,132,153],"for":[51,79,111],"diversity":[52,62],"in":[54,118,172],"different":[55],"dimensional":[56],"black":[57],"box":[58],"problems.":[59],"We":[60,81,103,125,150],"propose":[61,104],"extending":[65],"TuRBO1,":[66],"which":[67,86],"first":[70],"method":[72],"uses":[74],"approach":[78],"scalability.":[80],"extend":[82],"TuRBO1":[83],"as":[84],"divTuRBO1,":[85],"finds":[87],"an":[88,122],"optimal":[89],"solution":[90,101],"while":[91],"maintaining":[92],"given":[94],"distance":[95],"threshold":[96],"relative":[97],"reference":[100],"set.":[102],"two":[105],"find":[108],"diverse":[109],"solutions":[110],"combining":[115],"divTuRBO1":[116],"runs":[117],"sequential":[120],"and":[121,133],"interleaving":[123],"fashion.":[124],"conduct":[126],"experimental":[127],"investigations":[128,163],"on":[129,154],"proposed":[131,152,167],"compare":[134],"their":[135],"performance":[136],"baseline":[141],"method,":[142],"ROBOT":[143],"(rank-ordered":[144],"regions).":[149],"evaluate":[151],"benchmark":[155],"dimensions":[158],"2":[159],"20.":[161],"Experimental":[162],"demonstrate":[164],"methods":[168],"perform":[169],"well,":[170],"particularly":[171],"larger":[173],"dimensions,":[174],"even":[175],"limited":[178],"budget.":[180]},"counts_by_year":[{"year":2026,"cited_by_count":1}],"updated_date":"2026-07-14T23:27:15.235271","created_date":"2025-10-10T00:00:00"}