{"id":"https://openalex.org/W7133299841","doi":"https://doi.org/10.48550/arxiv.2603.01470","title":"Randomized Kriging Believer for Parallel Bayesian Optimization with Regret Bounds","display_name":"Randomized Kriging Believer for Parallel Bayesian Optimization with Regret Bounds","publication_year":2026,"publication_date":"2026-03-02","ids":{"openalex":"https://openalex.org/W7133299841","doi":"https://doi.org/10.48550/arxiv.2603.01470"},"language":null,"primary_location":{"id":"doi:10.48550/arxiv.2603.01470","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.01470","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":"https://doi.org/10.48550/arxiv.2603.01470","any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":"https://openalex.org/A5073686178","display_name":"Shuhei Sugiura","orcid":"https://orcid.org/0000-0002-3119-0316"},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Sugiura, Shuhei","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":"https://openalex.org/A5127876950","display_name":"Ichiro Takeuchi","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Takeuchi, Ichiro","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":"https://openalex.org/A5081716738","display_name":"Shion Takeno","orcid":"https://orcid.org/0009-0000-3638-8658"},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Takeno, Shion","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"corresponding_author_ids":["https://openalex.org/A5073686178"],"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/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.5813999772071838,"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.5813999772071838,"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.15610000491142273,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.12240000069141388,"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/regret","display_name":"Regret","score":0.7692999839782715},{"id":"https://openalex.org/keywords/bayesian-optimization","display_name":"Bayesian optimization","score":0.6132000088691711},{"id":"https://openalex.org/keywords/benchmark","display_name":"Benchmark (surveying)","score":0.6089000105857849},{"id":"https://openalex.org/keywords/set","display_name":"Set (abstract data type)","score":0.6025000214576721},{"id":"https://openalex.org/keywords/bayesian-probability","display_name":"Bayesian probability","score":0.5622000098228455},{"id":"https://openalex.org/keywords/function","display_name":"Function (biology)","score":0.48840001225471497},{"id":"https://openalex.org/keywords/heuristic","display_name":"Heuristic","score":0.47870001196861267},{"id":"https://openalex.org/keywords/asynchronous-communication","display_name":"Asynchronous communication","score":0.4690000116825104}],"concepts":[{"id":"https://openalex.org/C50817715","wikidata":"https://www.wikidata.org/wiki/Q79895177","display_name":"Regret","level":2,"score":0.7692999839782715},{"id":"https://openalex.org/C2778049539","wikidata":"https://www.wikidata.org/wiki/Q17002908","display_name":"Bayesian optimization","level":2,"score":0.6132000088691711},{"id":"https://openalex.org/C185798385","wikidata":"https://www.wikidata.org/wiki/Q1161707","display_name":"Benchmark (surveying)","level":2,"score":0.6089000105857849},{"id":"https://openalex.org/C177264268","wikidata":"https://www.wikidata.org/wiki/Q1514741","display_name":"Set (abstract data type)","level":2,"score":0.6025000214576721},{"id":"https://openalex.org/C107673813","wikidata":"https://www.wikidata.org/wiki/Q812534","display_name":"Bayesian probability","level":2,"score":0.5622000098228455},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.5565000176429749},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.5214999914169312},{"id":"https://openalex.org/C14036430","wikidata":"https://www.wikidata.org/wiki/Q3736076","display_name":"Function (biology)","level":2,"score":0.48840001225471497},{"id":"https://openalex.org/C173801870","wikidata":"https://www.wikidata.org/wiki/Q201413","display_name":"Heuristic","level":2,"score":0.47870001196861267},{"id":"https://openalex.org/C151319957","wikidata":"https://www.wikidata.org/wiki/Q752739","display_name":"Asynchronous communication","level":2,"score":0.4690000116825104},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.4325000047683716},{"id":"https://openalex.org/C2780586882","wikidata":"https://www.wikidata.org/wiki/Q7520643","display_name":"Simple (philosophy)","level":2,"score":0.4074000120162964},{"id":"https://openalex.org/C137836250","wikidata":"https://www.wikidata.org/wiki/Q984063","display_name":"Optimization problem","level":2,"score":0.3822999894618988},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.3781000077724457},{"id":"https://openalex.org/C128669082","wikidata":"https://www.wikidata.org/wiki/Q583461","display_name":"Randomized algorithm","level":2,"score":0.3698999881744385},{"id":"https://openalex.org/C81692654","wikidata":"https://www.wikidata.org/wiki/Q225926","display_name":"Kriging","level":2,"score":0.35499998927116394},{"id":"https://openalex.org/C21200559","wikidata":"https://www.wikidata.org/wiki/Q7451068","display_name":"Sensitivity (control systems)","level":2,"score":0.328000009059906},{"id":"https://openalex.org/C207201462","wikidata":"https://www.wikidata.org/wiki/Q182505","display_name":"Bayes' theorem","level":3,"score":0.3041999936103821},{"id":"https://openalex.org/C164752517","wikidata":"https://www.wikidata.org/wiki/Q5570875","display_name":"Global optimization","level":2,"score":0.2962999939918518},{"id":"https://openalex.org/C165064840","wikidata":"https://www.wikidata.org/wiki/Q1321061","display_name":"Matching (statistics)","level":2,"score":0.2879999876022339},{"id":"https://openalex.org/C154945302","wikidata":"https://www.wikidata.org/wiki/Q11660","display_name":"Artificial intelligence","level":1,"score":0.2671999931335449}],"mesh":[],"locations_count":1,"locations":[{"id":"doi:10.48550/arxiv.2603.01470","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.01470","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":null,"raw_source_name":null,"raw_type":"article"}],"best_oa_location":{"id":"doi:10.48550/arxiv.2603.01470","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2603.01470","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":"cc-by","license_id":"https://openalex.org/licenses/cc-by","version":null,"is_accepted":false,"is_published":false,"raw_source_name":null,"raw_type":"article"},"sustainable_development_goals":[{"display_name":"No poverty","id":"https://metadata.un.org/sdg/1","score":0.6789878010749817}],"awards":[],"funders":[],"has_content":{"pdf":false,"grobid_xml":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"We":[0,116],"consider":[1],"an":[2,6],"optimization":[3,25],"problem":[4],"of":[5,84,120,133],"expensive-to-evaluate":[7],"black-box":[8],"function,":[9],"in":[10,18],"which":[11,31],"we":[12,64,105],"can":[13],"obtain":[14],"noisy":[15],"function":[16,37],"values":[17],"parallel.":[19],"For":[20],"this":[21,62],"problem,":[22],"parallel":[23,46],"Bayesian":[24,112],"(PBO)":[26],"is":[27],"a":[28,41,66,76,91],"promising":[29],"approach,":[30],"aims":[32],"to":[33,101],"optimize":[34],"with":[35],"fewer":[36],"evaluations":[38],"by":[39],"selecting":[40],"diverse":[42],"input":[43],"set":[44],"for":[45],"evaluation.":[47],"However,":[48],"existing":[49],"PBO":[50,67],"methods":[51],"suffer":[52],"from":[53],"poor":[54],"practical":[55],"performance":[56],"or":[57],"lack":[58],"theoretical":[59],"guarantees.":[60,115],"In":[61],"study,":[63],"propose":[65],"method,":[68],"called":[69],"randomized":[70,109],"kriging":[71],"believer":[72],"(KB),":[73],"based":[74],"on":[75,126],"well-known":[77],"KB":[78,110],"heuristic":[79],"and":[80,99,128,131],"inheriting":[81],"the":[82,85,118,121],"advantages":[83],"original":[86],"KB:":[87],"low":[88],"computational":[89],"complexity,":[90],"simple":[92],"implementation,":[93],"versatility":[94],"across":[95],"various":[96],"BO":[97],"methods,":[98],"applicability":[100],"asynchronous":[102],"parallelization.":[103],"Furthermore,":[104],"show":[106],"that":[107],"our":[108],"achieves":[111],"expected":[113],"regret":[114],"demonstrate":[117],"effectiveness":[119],"proposed":[122],"method":[123],"through":[124],"experiments":[125],"synthetic":[127],"benchmark":[129],"functions":[130],"emulators":[132],"real-world":[134],"data.":[135]},"counts_by_year":[],"updated_date":"2026-03-14T06:41:57.775601","created_date":"2026-03-04T00:00:00"}