{"id":"https://openalex.org/W7106322896","doi":"https://doi.org/10.48550/arxiv.2511.15315","title":"Robust Bayesian Optimisation with Unbounded Corruptions","display_name":"Robust Bayesian Optimisation with Unbounded Corruptions","publication_year":2025,"publication_date":"2025-11-19","ids":{"openalex":"https://openalex.org/W7106322896","doi":"https://doi.org/10.48550/arxiv.2511.15315"},"language":null,"primary_location":{"id":"pmh:doi:10.48550/arxiv.2511.15315","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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":"Article"},"type":"preprint","indexed_in":["datacite"],"open_access":{"is_oa":true,"oa_status":"green","oa_url":null,"any_repository_has_fulltext":true},"authorships":[{"author_position":"first","author":{"id":null,"display_name":"Ezzerg, Abdelhamid","orcid":null},"institutions":[],"countries":[],"is_corresponding":true,"raw_author_name":"Ezzerg, Abdelhamid","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"middle","author":{"id":null,"display_name":"Bogunovic, Ilija","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Bogunovic, Ilija","raw_affiliation_strings":[],"affiliations":[]},{"author_position":"last","author":{"id":null,"display_name":"Knoblauch, Jeremias","orcid":null},"institutions":[],"countries":[],"is_corresponding":false,"raw_author_name":"Knoblauch, Jeremias","raw_affiliation_strings":[],"affiliations":[]}],"institutions":[],"countries_distinct_count":0,"institutions_distinct_count":3,"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/T12101","display_name":"Advanced Bandit Algorithms Research","score":0.8205999732017517,"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.8205999732017517,"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/T12814","display_name":"Gaussian Processes and Bayesian Inference","score":0.05979999899864197,"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/T11612","display_name":"Stochastic Gradient Optimization Techniques","score":0.05559999868273735,"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.7857000231742859},{"id":"https://openalex.org/keywords/bounded-function","display_name":"Bounded function","score":0.6967999935150146},{"id":"https://openalex.org/keywords/sublinear-function","display_name":"Sublinear function","score":0.6937999725341797},{"id":"https://openalex.org/keywords/upper-and-lower-bounds","display_name":"Upper and lower bounds","score":0.5824000239372253},{"id":"https://openalex.org/keywords/robustness","display_name":"Robustness (evolution)","score":0.5530999898910522},{"id":"https://openalex.org/keywords/bayesian-probability","display_name":"Bayesian probability","score":0.5299000144004822},{"id":"https://openalex.org/keywords/gaussian","display_name":"Gaussian","score":0.38909998536109924}],"concepts":[{"id":"https://openalex.org/C50817715","wikidata":"https://www.wikidata.org/wiki/Q79895177","display_name":"Regret","level":2,"score":0.7857000231742859},{"id":"https://openalex.org/C34388435","wikidata":"https://www.wikidata.org/wiki/Q2267362","display_name":"Bounded function","level":2,"score":0.6967999935150146},{"id":"https://openalex.org/C117160843","wikidata":"https://www.wikidata.org/wiki/Q338652","display_name":"Sublinear function","level":2,"score":0.6937999725341797},{"id":"https://openalex.org/C33923547","wikidata":"https://www.wikidata.org/wiki/Q395","display_name":"Mathematics","level":0,"score":0.5985000133514404},{"id":"https://openalex.org/C77553402","wikidata":"https://www.wikidata.org/wiki/Q13222579","display_name":"Upper and lower bounds","level":2,"score":0.5824000239372253},{"id":"https://openalex.org/C63479239","wikidata":"https://www.wikidata.org/wiki/Q7353546","display_name":"Robustness (evolution)","level":3,"score":0.5530999898910522},{"id":"https://openalex.org/C107673813","wikidata":"https://www.wikidata.org/wiki/Q812534","display_name":"Bayesian probability","level":2,"score":0.5299000144004822},{"id":"https://openalex.org/C126255220","wikidata":"https://www.wikidata.org/wiki/Q141495","display_name":"Mathematical optimization","level":1,"score":0.49070000648498535},{"id":"https://openalex.org/C163716315","wikidata":"https://www.wikidata.org/wiki/Q901177","display_name":"Gaussian","level":2,"score":0.38909998536109924},{"id":"https://openalex.org/C41008148","wikidata":"https://www.wikidata.org/wiki/Q21198","display_name":"Computer science","level":0,"score":0.36629998683929443},{"id":"https://openalex.org/C90377204","wikidata":"https://www.wikidata.org/wiki/Q1052594","display_name":"Uniform boundedness","level":3,"score":0.3409999907016754},{"id":"https://openalex.org/C61326573","wikidata":"https://www.wikidata.org/wiki/Q1496376","display_name":"Gaussian process","level":3,"score":0.31859999895095825},{"id":"https://openalex.org/C2780813799","wikidata":"https://www.wikidata.org/wiki/Q3274237","display_name":"Zero (linguistics)","level":2,"score":0.3095000088214874},{"id":"https://openalex.org/C11413529","wikidata":"https://www.wikidata.org/wiki/Q8366","display_name":"Algorithm","level":1,"score":0.3028999865055084},{"id":"https://openalex.org/C149728462","wikidata":"https://www.wikidata.org/wiki/Q751319","display_name":"Minimax","level":2,"score":0.29019999504089355},{"id":"https://openalex.org/C28826006","wikidata":"https://www.wikidata.org/wiki/Q33521","display_name":"Applied mathematics","level":1,"score":0.27459999918937683},{"id":"https://openalex.org/C122770356","wikidata":"https://www.wikidata.org/wiki/Q1656753","display_name":"Identifiability","level":2,"score":0.27230000495910645},{"id":"https://openalex.org/C176181172","wikidata":"https://www.wikidata.org/wiki/Q3490301","display_name":"Nondeterministic algorithm","level":2,"score":0.2578999996185303},{"id":"https://openalex.org/C185429906","wikidata":"https://www.wikidata.org/wiki/Q1130160","display_name":"Estimator","level":2,"score":0.25780001282691956}],"mesh":[],"locations_count":2,"locations":[{"id":"pmh:doi:10.48550/arxiv.2511.15315","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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":"Article"},{"id":"doi:10.48550/arxiv.2511.15315","is_oa":true,"landing_page_url":"https://doi.org/10.48550/arxiv.2511.15315","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":"pmh:doi:10.48550/arxiv.2511.15315","is_oa":true,"landing_page_url":null,"pdf_url":null,"source":{"id":"https://openalex.org/S4406922384","display_name":"Open MIND","issn_l":null,"issn":null,"is_oa":false,"is_in_doaj":false,"is_core":false,"host_organization":null,"host_organization_name":null,"host_organization_lineage":[],"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":"Article"},"sustainable_development_goals":[{"id":"https://metadata.un.org/sdg/16","score":0.8252347707748413,"display_name":"Peace, Justice and strong institutions"}],"awards":[],"funders":[],"has_content":{"grobid_xml":false,"pdf":false},"content_urls":null,"referenced_works_count":0,"referenced_works":[],"related_works":[],"abstract_inverted_index":{"Bayesian":[0],"Optimization":[1],"is":[2,41],"critically":[3],"vulnerable":[4],"to":[5,94],"extreme":[6],"outliers.":[7],"Existing":[8],"provably":[9],"robust":[10],"methods":[11],"typically":[12],"assume":[13],"a":[14,25,36,68],"bounded":[15,43],"cumulative":[16],"corruption":[17,27],"budget,":[18],"which":[19],"makes":[20],"them":[21],"defenseless":[22],"against":[23],"even":[24],"single":[26],"of":[28,47,80,92,117],"sufficient":[29],"magnitude.":[30,52,102],"To":[31],"address":[32],"this,":[33],"we":[34],"introduce":[35],"new":[37],"adversary":[38],"whose":[39],"budget":[40],"only":[42],"in":[44,50,89],"the":[45,60,90,118],"frequency":[46],"corruptions,":[48],"not":[49],"their":[51],"We":[53,74],"then":[54],"derive":[55],"RCGP-UCB,":[56,81],"an":[57],"algorithm":[58],"coupling":[59],"famous":[61],"upper":[62],"confidence":[63],"bound":[64],"(UCB)":[65],"approach":[66],"with":[67,99],"Robust":[69],"Conjugate":[70],"Gaussian":[71],"Process":[72],"(RCGP).":[73],"present":[75],"stable":[76],"and":[77,82,96],"adaptive":[78],"versions":[79],"prove":[83],"that":[84],"they":[85],"achieve":[86],"sublinear":[87],"regret":[88,113],"presence":[91],"up":[93],"$O(T^{1/4})$":[95],"$O(T^{1/7})$":[97],"corruptions":[98],"possibly":[100],"infinite":[101],"This":[103],"robustness":[104],"comes":[105],"at":[106],"near":[107],"zero":[108],"cost:":[109],"without":[110],"outliers,":[111],"RCGP-UCB's":[112],"bounds":[114],"match":[115],"those":[116],"standard":[119],"GP-UCB":[120],"algorithm.":[121]},"counts_by_year":[],"updated_date":"2026-04-04T16:13:02.066488","created_date":"2025-11-23T00:00:00"}
