{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,2]],"date-time":"2026-03-02T22:10:27Z","timestamp":1772489427497,"version":"3.50.1"},"reference-count":23,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,1,1]],"date-time":"2025-01-01T00:00:00Z","timestamp":1735689600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Kjell och M\u00e4rta Beijer Foundation"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Control Syst. Lett."],"published-print":{"date-parts":[[2025]]},"DOI":"10.1109\/lcsys.2025.3645824","type":"journal-article","created":{"date-parts":[[2025,12,18]],"date-time":"2025-12-18T18:35:42Z","timestamp":1766082942000},"page":"3029-3034","source":"Crossref","is-referenced-by-count":0,"title":["Safe Bayesian Optimization Across Noise Models via Scenario Programming"],"prefix":"10.1109","volume":"9","author":[{"ORCID":"https:\/\/orcid.org\/0009-0004-7345-6807","authenticated-orcid":false,"given":"Abdullah","family":"Tokmak","sequence":"first","affiliation":[{"name":"Cyber-Physical Systems Group, Aalto University, Espoo, Finland"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5183-234X","authenticated-orcid":false,"given":"Thomas B.","family":"Sch\u00f6n","sequence":"additional","affiliation":[{"name":"Department of Information Technology, Uppsala University, Uppsala, Sweden"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-7340-2180","authenticated-orcid":false,"given":"Dominik","family":"Baumann","sequence":"additional","affiliation":[{"name":"Cyber-Physical Systems Group, Aalto University, Espoo, Finland"}]}],"member":"263","reference":[{"key":"ref1","volume-title":"Reinforcement Learning: An Introduction","author":"Sutton","year":"2018"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1017\/9781108348973"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.7551\/mitpress\/3206.001.0001"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1007\/s10472-015-9463-9"},{"key":"ref5","first-page":"997","article-title":"Safe exploration for optimization with Gaussian processes","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Sui"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2311125"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1080\/01691864.2024.2384425"},{"key":"ref8","first-page":"1","article-title":"Information directed sampling and bandits with heteroscedastic noise","volume-title":"Proc. Conf. Learn. Theory","author":"Kirschner"},{"key":"ref9","first-page":"17235","article-title":"Risk-averse heteroscedastic Bayesian optimization","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"34","author":"Makarova"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2182033"},{"key":"ref11","first-page":"1","article-title":"On kernelized multi-armed bandits","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Chowdhury"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s10994-021-06019-1"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/j.artint.2023.103922"},{"key":"ref14","first-page":"1","article-title":"Safe exploration in reproducing kernel Hilbert spaces","volume-title":"Proc. Int. Conf. Artif. Intell. Stat.","author":"Tokmak"},{"key":"ref15","first-page":"1","article-title":"PACSBO: Probably approximately correct safe Bayesian optimization","volume-title":"Proc. Symp. Syst. Theory Data Optim.","author":"Tokmak"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v35i8.16912"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2013.2277869"},{"key":"ref18","first-page":"8430","article-title":"Almost optimal algorithms for linear stochastic bandits with heavy-tailed payoffs","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Shao"},{"key":"ref19","first-page":"1","article-title":"Improved regret bounds for linear bandits with heavy-tailed rewards","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Tajdini"},{"key":"ref20","first-page":"1","article-title":"Bayesian optimization under heavy-tailed payoffs","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","author":"Chowdhury"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1137\/1.9781611975444"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1109\/TAC.2025.3558871"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/IROS.2012.6386109"}],"container-title":["IEEE Control Systems Letters"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/7782633\/10939047\/11303585.pdf?arnumber=11303585","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,2]],"date-time":"2026-03-02T20:57:49Z","timestamp":1772485069000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/11303585\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025]]},"references-count":23,"URL":"https:\/\/doi.org\/10.1109\/lcsys.2025.3645824","relation":{},"ISSN":["2475-1456"],"issn-type":[{"value":"2475-1456","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025]]}}}