{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,2,21]],"date-time":"2026-02-21T04:03:11Z","timestamp":1771646591249,"version":"3.50.1"},"reference-count":62,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2021,1,1]],"date-time":"2021-01-01T00:00:00Z","timestamp":1609459200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/creativecommons.org\/licenses\/by\/4.0\/legalcode"}],"funder":[{"DOI":"10.13039\/100000181","name":"Air Force Office of Scientific Research","doi-asserted-by":"publisher","award":["FA9550-16-1-0171"],"award-info":[{"award-number":["FA9550-16-1-0171"]}],"id":[{"id":"10.13039\/100000181","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Access"],"published-print":{"date-parts":[[2021]]},"DOI":"10.1109\/access.2021.3095755","type":"journal-article","created":{"date-parts":[[2021,7,8]],"date-time":"2021-07-08T19:33:36Z","timestamp":1625772816000},"page":"100125-100140","source":"Crossref","is-referenced-by-count":2,"title":["Multi-Armed Bandit Regularized Expected Improvement for Efficient Global Optimization of Expensive Computer Experiments With Low Noise"],"prefix":"10.1109","volume":"9","author":[{"given":"Rajitha","family":"Meka","sequence":"first","affiliation":[]},{"given":"Adel","family":"Alaeddini","sequence":"additional","affiliation":[]},{"given":"Chinonso","family":"Ovuegbe","sequence":"additional","affiliation":[]},{"given":"Pranav A.","family":"Bhounsule","sequence":"additional","affiliation":[]},{"given":"Peyman","family":"Najafirad","sequence":"additional","affiliation":[]},{"given":"Kai","family":"Yang","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","first-page":"100","article-title":"Thompson sampling for complex online problems","author":"gopalan","year":"2014","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref38","first-page":"2442","article-title":"An information-theoretic analysis of thompson sampling","volume":"17","author":"russo","year":"2015","journal-title":"J Mach Learn Res"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1108\/EC-05-2016-0158"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/s00158-017-1648-x"},{"key":"ref31","article-title":"A tutorial on Bayesian optimization","author":"frazier","year":"2018","journal-title":"arXiv 1807 02811"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1137\/070693424"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2014.0650"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2182033"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1214\/13-AOS1119"},{"key":"ref34","first-page":"2447","article-title":"Contextual Gaussian process bandit optimization","author":"krause","year":"2011","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref60","doi-asserted-by":"publisher","DOI":"10.1109\/TIM.2010.2058531"},{"key":"ref62","doi-asserted-by":"publisher","DOI":"10.1109\/JPROC.2015.2494218"},{"key":"ref61","doi-asserted-by":"crossref","first-page":"302","DOI":"10.1016\/j.ifacol.2019.12.324","article-title":"Hybrid collision avoidance with moving obstacles","volume":"52","author":"chai","year":"2019","journal-title":"IFAC-PapersOnLine"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-005-2454-3"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-020-00923-x"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1016\/0378-3758(95)00169-7"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1080\/00401706.2016.1142902"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1201\/9781420034899"},{"key":"ref20","first-page":"11","article-title":"Global versus local search in constrained optimization of computer models","volume":"34","author":"schonlau","year":"1998","journal-title":"Lect Notes Control"},{"key":"ref22","article-title":"Constrained Bayesian optimization and applications","author":"gelbart","year":"2015"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1080\/00401706.2015.1014065"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1023\/A:1012771025575"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1080\/00401706.2012.707580"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.2514\/6.2010-3090"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-016-0449-x"},{"key":"ref50","article-title":"On weight initialization in deep neural networks","author":"krishna kumar","year":"2017","journal-title":"arXiv 1704 08863"},{"key":"ref51","first-page":"3011","article-title":"Gaussian processes for machine learning (GPML) toolbox","volume":"11","author":"rasmussen","year":"2010","journal-title":"J Mach Learn Res"},{"key":"ref59","doi-asserted-by":"publisher","DOI":"10.1109\/ROBOT.1999.770002"},{"key":"ref58","article-title":"PythonRobotics: A Python code collection of robotics algorithms","author":"sakai","year":"2018","journal-title":"arXiv 1808 10703"},{"key":"ref57","doi-asserted-by":"publisher","DOI":"10.1109\/100.580977"},{"key":"ref56","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-014-0184-0"},{"key":"ref55","doi-asserted-by":"publisher","DOI":"10.1016\/j.cor.2010.09.013"},{"key":"ref54","article-title":"Gaussian process optimization in the bandit setting: No regret and experimental design","author":"srinivas","year":"2009","journal-title":"arXiv 0912 3995"},{"key":"ref53","first-page":"1","article-title":"Gaussian process based optimization algorithms with input uncertainty","volume":"52","author":"wang","year":"2019","journal-title":"ISE Transactions"},{"key":"ref52","first-page":"45","article-title":"Bayesian optimization for materials design","author":"frazier","year":"2016","journal-title":"Proc Inf Sci Mater Discovery Design"},{"key":"ref10","doi-asserted-by":"crossref","first-page":"145","DOI":"10.1007\/978-1-4939-8847-1_5","article-title":"Space-filling designs for computer experiments","author":"santner","year":"2018","journal-title":"The Design and Analysis of Computer Experiments"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.2307\/1268522"},{"key":"ref40","first-page":"924","article-title":"Efficient large-scale Gaussian process bandits by believing only informative actions","author":"bedi","year":"2020","journal-title":"Proc Learn Dyn Control"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s11222-011-9242-3"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1016\/0378-3758(90)90122-B"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.2307\/1271079"},{"key":"ref15","article-title":"A tutorial on Bayesian optimization of expensive cost functions, with application to active user modeling and hierarchical reinforcement learning","author":"brochu","year":"2010","journal-title":"ArXiv 1012 2599"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1002\/sam.11343"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/SMC.2017.8122656"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1023\/A:1008306431147"},{"key":"ref19","article-title":"Flexibility and efficiency enhancements for constrained global design optimization with kriging approximations","author":"sasena","year":"2002"},{"key":"ref4","author":"williams","year":"2006","journal-title":"Gaussian Processes for Machine Learning"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1080\/00401706.2019.1677269"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.23919\/ACC.2004.1383790"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1214\/ss\/1177012413"},{"key":"ref8","doi-asserted-by":"crossref","DOI":"10.1007\/978-1-4757-3799-8","volume":"1","author":"santner","year":"2003","journal-title":"The Design and Analysis of Computer Experiments"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1080\/07408170801971502"},{"key":"ref49","author":"montgomery","year":"2021","journal-title":"Introduction to Linear Regression Analysis"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.4018\/978-1-5225-2498-4.ch013"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1109\/ICMLA.2011.144"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/25.3-4.285"},{"key":"ref48","doi-asserted-by":"crossref","first-page":"30","DOI":"10.1080\/00031305.1971.10477279","article-title":"A simple approximation for unbiased estimation of the standard deviation","volume":"25","author":"gurland","year":"1971","journal-title":"Amer Statistician"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1561\/2200000070"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1561\/2200000024"},{"key":"ref41","first-page":"1295","article-title":"Near-linear time Gaussian process optimization with adaptive batching and resparsification","author":"calandriello","year":"2020","journal-title":"Proc Int Conf Mach Learn"},{"key":"ref44","doi-asserted-by":"publisher","DOI":"10.1090\/S0002-9904-1952-09620-8"},{"key":"ref43","author":"murphy","year":"2012","journal-title":"Machine Learning A Probabilistic Perspective"}],"container-title":["IEEE Access"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6287639\/9312710\/09477602.pdf?arnumber=9477602","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2024,9,3]],"date-time":"2024-09-03T18:57:29Z","timestamp":1725389849000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9477602\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021]]},"references-count":62,"URL":"https:\/\/doi.org\/10.1109\/access.2021.3095755","relation":{},"ISSN":["2169-3536"],"issn-type":[{"value":"2169-3536","type":"electronic"}],"subject":[],"published":{"date-parts":[[2021]]}}}