{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,11,27]],"date-time":"2025-11-27T19:12:31Z","timestamp":1764270751125,"version":"3.46.0"},"reference-count":42,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"3","license":[{"start":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T00:00:00Z","timestamp":1740787200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T00:00:00Z","timestamp":1740787200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2025,3,1]],"date-time":"2025-03-01T00:00:00Z","timestamp":1740787200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Artif. Intell."],"published-print":{"date-parts":[[2025,3]]},"DOI":"10.1109\/tai.2023.3332023","type":"journal-article","created":{"date-parts":[[2023,11,13]],"date-time":"2023-11-13T14:46:59Z","timestamp":1699886819000},"page":"508-517","source":"Crossref","is-referenced-by-count":1,"title":["Regret and Belief Complexity Tradeoff in Gaussian Process Bandits via Information Thresholding"],"prefix":"10.1109","volume":"6","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-8807-2695","authenticated-orcid":false,"given":"Amrit Singh","family":"Bedi","sequence":"first","affiliation":[{"name":"University of Maryland, College Park, MD, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-5349-2705","authenticated-orcid":false,"given":"Dheeraj","family":"Peddireddy","sequence":"additional","affiliation":[{"name":"School of Industrial Engineering, Purdue University, West Lafayette, IN, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9131-4723","authenticated-orcid":false,"given":"Vaneet","family":"Aggarwal","sequence":"additional","affiliation":[{"name":"School of Industrial Engineering, Purdue University, West Lafayette, IN, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Brian M.","family":"Sadler","sequence":"additional","affiliation":[{"name":"DEVCOM Army Research Laboratory, Adelphi, MD, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-2447-2873","authenticated-orcid":false,"given":"Alec","family":"Koppel","sequence":"additional","affiliation":[{"name":"U.S. Army Research Laboratory, Adelphi, MD, USA"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","first-page":"10","article-title":"Efficient large-scale Gaussian process bandits by believing only informative actions","volume-title":"Proc. 2nd Conf. Learn. Dyn. Control, in Machine Learning Research","volume":"120","author":"Bedi","year":"2020"},{"article-title":"A tutorial on Bayesian optimization","year":"2018","author":"Frazier","key":"ref2"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1126\/science.220.4598.671"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1214\/ss\/1177011077"},{"volume-title":"Handbook of Genetic Algorithms","year":"1991","author":"Davis","key":"ref5"},{"key":"ref6","first-page":"2951","article-title":"Practical Bayesian optimization of machine learning algorithms","author":"Snoek","year":"2012","journal-title":"Proc. Adv. Neural Inf. Process. Syst."},{"issue":"1","key":"ref7","first-page":"6765","article-title":"Hyperband: A novel bandit-based approach to hyperparameter optimization","volume":"18","author":"Li","year":"2017","journal-title":"J. Mach. Learn. Res."},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1109\/Allerton.2013.6736565"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1214\/ss\/1177009939"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1073\/pnas.0912378106"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2008.4587503"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1002\/SERIES1345"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1561\/9781680834710"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1002\/9780470980033"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539701398375"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-24412-4_14"},{"key":"ref17","first-page":"975","article-title":"Lipschitz bandits: Regret lower bounds and optimal algorithms","volume-title":"Proc. COLT","volume":"35","author":"Magureanu","year":"2014"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-540-28650-9_4"},{"volume-title":"Sequential Monte Carlo Methods in Practice","year":"2013","author":"Smith","key":"ref19"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2011.2182033"},{"key":"ref21","first-page":"100","article-title":"Thompson sampling for complex online problems","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Gopalan","year":"2014"},{"issue":"6","key":"ref22","first-page":"119","article-title":"A statistical approach to some basic mine valuation problems on the witwatersrand","volume":"52","author":"Krige","year":"1951","journal-title":"J. Southern Afr. Inst. Min. Metall."},{"article-title":"Exponential regret bounds for Gaussian process bandits with deterministic observations","year":"2012","author":"Freitas","key":"ref23"},{"article-title":"Theoretical analysis of Bayesian optimisation with unknown Gaussian process hyper-parameters","year":"2014","author":"Wang","key":"ref24"},{"key":"ref25","first-page":"279","article-title":"Regret for expected improvement over the best-observed value and stopping condition","volume-title":"Proc. Asian Conf. Mach. Learn.","author":"Nguyen","year":"2017"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1007\/s10898-008-9354-2"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1137\/070693424"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.3150\/18-BEJ1074"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.1162\/089976602317250933"},{"key":"ref30","first-page":"1533","article-title":"Understanding probabilistic sparse Gaussian process approximations","author":"Bauer","year":"2016","journal-title":"Proc. Adv. Neural Inf. Process. Syst."},{"key":"ref31","first-page":"3301","article-title":"Streaming sparse Gaussian process approximations","author":"Bui","year":"2017","journal-title":"Proc. Adv. Neural Inf. Process. Syst."},{"key":"ref32","first-page":"533","article-title":"Gaussian process optimization with adaptive sketching: Scalable and no regret","volume-title":"Proc. Conf. Learn. Theory","author":"Calandriello","year":"2019"},{"key":"ref33","first-page":"1295","article-title":"Near-linear time Gaussian process optimization with adaptive batching and resparsification","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Calandriello","year":"2020"},{"article-title":"Approximation methods for kernelized bandits","year":"2020","author":"Takemori","key":"ref34"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.23919\/ACC.2019.8815206"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2016.2637324"},{"volume-title":"Elements of Information Theory","year":"2012","author":"Cover","key":"ref37"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1287\/opre.43.4.684"},{"key":"ref39","first-page":"235","article-title":"Near-optimal sensor placements in Gaussian processes: Theory, efficient algorithms and empirical studies","volume":"9","author":"Krause","year":"2008","journal-title":"J. Mach. Learn. Res."},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/BF01588971"},{"article-title":"MNIST handwritten digit database","year":"2010","author":"LeCun","key":"ref41"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2004.830985"}],"container-title":["IEEE Transactions on Artificial Intelligence"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9078688\/10918873\/10316334.pdf?arnumber=10316334","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,11,27]],"date-time":"2025-11-27T19:01:06Z","timestamp":1764270066000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10316334\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3]]},"references-count":42,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tai.2023.3332023","relation":{},"ISSN":["2691-4581"],"issn-type":[{"type":"electronic","value":"2691-4581"}],"subject":[],"published":{"date-parts":[[2025,3]]}}}