{"id":"https://openalex.org/W4232476522","doi":"https://doi.org/10.1109/wsc.2018.8632417","title":"ON PARALLELIZING MULTI-TASK BAYESIAN OPTIMIZATION","display_name":"ON PARALLELIZING MULTI-TASK BAYESIAN OPTIMIZATION","publication_year":2018,"publication_date":"2018-12-01","ids":{"openalex":"https://openalex.org/W4232476522","doi":"https://doi.org/10.1109/wsc.2018.8632417","mag":"2912451170"},"language":"en","primary_location":{"id":"doi:10.1109/wsc.2018.8632417","doi":"https://doi.org/10.1109/wsc.2018.8632417","is_oa":false,"landing_page_url":"https://doi.org/10.1109/wsc.2018.8632417","pdf_url":null,"source":{"id":"https://openalex.org/S4306421180","display_name":"Winter Simulation Conference","issn_l":"0891-7736","issn":["0891-7736"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":["norway-1"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 Winter Simulation Conference (WSC)","raw_type":"proceedings-article"},"volume":null,"type":"conference-paper","is_traditional":true,"indexed_in":["crossref"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://figshare.com/articles/conference_contribution/ON_PARALLELIZING_MULTI-TASK_BAYESIAN_OPTIMIZATION/22818152","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Matthew Groves","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I39555362","display_name":"University of Warwick","ror":"https://ror.org/01a77tt86","country_code":"GB","type":"education","lineage":["https://openalex.org/I39555362"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Matthew Groves","raw_affiliation_strings":["University of Warwick, Coventry, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Warwick, Coventry, UK","institution_ids":["https://openalex.org/I39555362"]}]},{"author_position":"middle","author":{"id":null,"display_name":"Michael Pearce","orcid":null,"observed_orcids":[]},"institutions":[{"id":"https://openalex.org/I39555362","display_name":"University of Warwick","ror":"https://ror.org/01a77tt86","country_code":"GB","type":"education","lineage":["https://openalex.org/I39555362"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Michael Pearce","raw_affiliation_strings":["University of Warwick, Coventry, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Warwick, Coventry, UK","institution_ids":["https://openalex.org/I39555362"]}]},{"author_position":"last","author":{"id":"https://openalex.org/A5036018560","display_name":"Juergen Branke","orcid":"https://orcid.org/0000-0002-4343-5878","observed_orcids":["https://orcid.org/0000-0002-4343-5878"]},"institutions":[{"id":"https://openalex.org/I39555362","display_name":"University of Warwick","ror":"https://ror.org/01a77tt86","country_code":"GB","type":"education","lineage":["https://openalex.org/I39555362"]}],"countries":["GB"],"is_corresponding":false,"raw_author_name":"Juergen Branke","raw_affiliation_strings":["University of Warwick, Coventry, UK"],"raw_orcid":null,"affiliations":[{"raw_affiliation_string":"University of Warwick, Coventry, UK","institution_ids":["https://openalex.org/I39555362"]}]}],"institutions":[],"countries_distinct_count":1,"institutions_distinct_count":1,"corresponding_author_ids":[],"corresponding_institution_ids":["https://openalex.org/I39555362"],"apc_list":null,"apc_paid":null,"fwci":1.2408,"has_fulltext":false,"cited_by_count":4,"citation_normalized_percentile":{"value":0.77442343,"is_in_top_1_percent":false,"is_in_top_10_percent":false},"cited_by_percentile_year":{"min":89,"max":96},"biblio":{"volume":null,"issue":null,"first_page":"1993","last_page":"2002"},"is_retracted":false,"is_paratext":false,"is_xpac":false,"primary_topic":{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.98580002784729,"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"}},"topics":[{"id":"https://openalex.org/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.98580002784729,"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"}},{"id":"https://openalex.org/T10848","display_name":"Advanced Multi-Objective Optimization Algorithms","score":0.006300000008195639,"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.0010999999940395355,"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/parallelization","display_name":"parallelization","score":0.7120000123977661},{"id":"https://openalex.org/keywords/sample-selection","display_name":"sample selection","score":0.39500001072883606},{"id":"https://openalex.org/keywords/posterior-distribution","display_name":"posterior distribution","score":0.4569999873638153},{"id":"https://openalex.org/keywords/penalty-function","display_name":"penalty method","score":0.8339999914169312},{"id":"https://openalex.org/keywords/task-space","display_name":"task space","score":0.6359999775886536}],"concepts":[{"id":"https://openalex.org/C2778049539","wikidata":"https://www.wikidata.org/wiki/Q17002908","display_name":"Bayesian optimization","level":2,"score":0.9151591062545776},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.8465468883514404},{"id":"https://openalex.org/C74193536","wikidata":"https://www.wikidata.org/wiki/Q574844","display_name":"Kernel (algebra)","level":2,"score":0.6659843921661377},{"id":"https://openalex.org/C107673813","wikidata":"https://www.wikidata.org/wiki/Q812534","display_name":"Bayesian probability","level":2,"score":0.6636074185371399},{"id":"https://openalex.org/C2780451532","wikidata":"https://www.wikidata.org/wiki/Q759676","display_name":"Task (project management)","level":2,"score":0.5958887338638306},{"id":"https://openalex.org/C165696696","wikidata":"https://www.wikidata.org/wiki/Q11287","display_name":"Exploit","level":2,"score":0.5311770439147949},{"id":"https://openalex.org/C45374587","wikidata":"https://www.wikidata.org/wiki/Q12525525","display_name":"Computation","level":2,"score":0.5250049829483032},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.44760411977767944},{"id":"https://openalex.org/C173608175","wikidata":"https://www.wikidata.org/wiki/Q232661","display_name":"Parallel computing","level":1,"score":0.44071441888809204},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3268412947654724},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2656363248825073},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.08676445484161377},{"id":"https://openalex.org/C162324750","wikidata":"https://www.wikidata.org/wiki/Q8134","display_name":"Economics","level":0,"score":0.0},{"id":"https://openalex.org/C114614502","wikidata":"https://www.wikidata.org/wiki/Q76592","display_name":"Combinatorics","level":1,"score":0.0},{"id":"https://openalex.org/C38652104","wikidata":"https://www.wikidata.org/wiki/Q3510521","display_name":"Computer security","level":1,"score":0.0},{"id":"https://openalex.org/C187736073","wikidata":"https://www.wikidata.org/wiki/Q2920921","display_name":"Management","level":1,"score":0.0}],"mesh":[],"locations_count":4,"locations":[{"id":"doi:10.1109/wsc.2018.8632417","doi":"https://doi.org/10.1109/wsc.2018.8632417","is_oa":false,"landing_page_url":"https://doi.org/10.1109/wsc.2018.8632417","pdf_url":null,"source":{"id":"https://openalex.org/S4306421180","display_name":"Winter Simulation Conference","issn_l":"0891-7736","issn":["0891-7736"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":["norway-1"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":"publishedVersion","is_accepted":true,"is_published":true,"raw_source_name":"2018 Winter Simulation Conference (WSC)","raw_type":"proceedings-article"},{"id":"pmh:oai:figshare.com:article/22818152","doi":null,"is_oa":true,"landing_page_url":"https://figshare.com/articles/conference_contribution/ON_PARALLELIZING_MULTI-TASK_BAYESIAN_OPTIMIZATION/22818152","pdf_url":null,"source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"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":"Conference contribution"},{"id":"pmh:oai:wrap.warwick.ac.uk:120225","doi":null,"is_oa":false,"landing_page_url":"http://wrap.warwick.ac.uk/120225/","pdf_url":null,"source":{"id":"https://openalex.org/S4306400665","display_name":"Warwick Research Archive Portal (University of Warwick)","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I39555362","host_organization_name":"University of Warwick","host_organization_lineage":["https://openalex.org/I39555362"],"host_organization_lineage_names":[],"type":"repository"},"license":null,"license_id":null,"version":"submittedVersion","is_accepted":false,"is_published":false,"raw_source_name":"","raw_type":"Conference Item"},{"id":"mag:2912451170","doi":null,"is_oa":false,"landing_page_url":"https://dblp.uni-trier.de/db/conf/wsc/wsc2018.html#GrovesPB18","pdf_url":null,"source":{"id":"https://openalex.org/S4306421180","display_name":"Winter Simulation Conference","issn_l":"0891-7736","issn":["0891-7736"],"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":["norway-1"],"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"host_organization_lineage_names":[],"type":"conference"},"license":null,"license_id":null,"version":null,"is_accepted":false,"is_published":false,"raw_source_name":"Winter Simulation Conference","raw_type":null}],"best_oa_location":{"id":"pmh:oai:figshare.com:article/22818152","doi":null,"is_oa":true,"landing_page_url":"https://figshare.com/articles/conference_contribution/ON_PARALLELIZING_MULTI-TASK_BAYESIAN_OPTIMIZATION/22818152","pdf_url":null,"source":{"id":"https://openalex.org/S4377196282","display_name":"Figshare","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"listed_in":[],"host_organization":"https://openalex.org/I4210132348","host_organization_name":"Figshare (United Kingdom)","host_organization_lineage":["https://openalex.org/I4210132348"],"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":"Conference contribution"},"sustainable_development_goals":[],"study_designs":[],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":21,"referenced_works":["https://openalex.org/W61667912","https://openalex.org/W135104305","https://openalex.org/W1510052597","https://openalex.org/W1746819321","https://openalex.org/W1778518767","https://openalex.org/W1975238690","https://openalex.org/W1990570841","https://openalex.org/W2113145584","https://openalex.org/W2119595900","https://openalex.org/W2139182243","https://openalex.org/W2155927283","https://openalex.org/W2409689189","https://openalex.org/W2427941034","https://openalex.org/W2516831108","https://openalex.org/W2607385956","https://openalex.org/W2793133812","https://openalex.org/W2798238895","https://openalex.org/W2963439757","https://openalex.org/W2963742654","https://openalex.org/W3036152138","https://openalex.org/W4246307274"],"related_works":["https://openalex.org/W3176851215","https://openalex.org/W2793133812","https://openalex.org/W2618347144","https://openalex.org/W3036152138","https://openalex.org/W2811511494","https://openalex.org/W2991037246","https://openalex.org/W3046617878","https://openalex.org/W3082015779","https://openalex.org/W3158270565","https://openalex.org/W3037760973"],"abstract_inverted_index":{"Parallelizing":[0],"Bayesian":[1,50,102],"Optimization":[2,103],"has":[3],"recently":[4],"attracted":[5],"a":[6,76],"lot":[7],"of":[8,27,35,58,98,130],"attention.":[9],"The":[10],"challenge":[11],"is":[12,53,60,105],"usually":[13],"to":[14,81,107,114,118],"estimate":[15],"the":[16,24,28,32,36,56,71,85,91,96,108,124],"effect":[17],"multiple":[18],"new":[19],"samples":[20,59],"will":[21],"have":[22],"on":[23,84,123],"posterior":[25],"distribution":[26],"objective":[29],"function,":[30],"and":[31,87,134],"combinatorial":[33],"explosion":[34],"possible":[37],"sample":[38],"locations.":[39],"In":[40],"this":[41],"paper,":[42],"we":[43,94,127],"show":[44],"that":[45,89],"at":[46],"least":[47],"for":[48,90],"multi-task":[49,101],"Optimization,":[51],"parallelization":[52,131],"straightforward":[54],"because":[55],"benefit":[57],"independent":[61],"as":[62,64],"long":[63],"they":[65],"are":[66],"sufficiently":[67],"far":[68],"apart":[69],"in":[70],"task":[72],"space.":[73],"We":[74],"propose":[75],"simple":[77],"penalization":[78],"approach":[79],"proportional":[80],"correlation":[82],"based":[83],"kernel":[86],"demonstrate":[88],"problem":[92],"settings":[93],"considered,":[95,126],"efficacy":[97],"our":[99],"parallel":[100,116],"algorithm":[104],"close":[106],"sequential":[109],"version,":[110],"while":[111],"being":[112],"able":[113],"exploit":[115],"computation":[117],"speed":[119],"up":[120],"optimization.":[121],"Depending":[122],"setup":[125],"observe":[128],"efficiencies":[129],"between":[132],"69%":[133],"100%.":[135]},"counts_by_year":[{"year":2025,"cited_by_count":1},{"year":2020,"cited_by_count":3}],"updated_date":"2026-11-04T10:54:05.112534","created_date":"2022-05-12T00:00:00"}
