{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2024,11,19]],"date-time":"2024-11-19T17:42:29Z","timestamp":1732038149903,"version":"3.28.0"},"reference-count":44,"publisher":"IEEE","content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2018,11]]},"DOI":"10.1109\/icdmw.2018.00045","type":"proceedings-article","created":{"date-parts":[[2019,2,11]],"date-time":"2019-02-11T20:55:06Z","timestamp":1549918506000},"page":"258-265","source":"Crossref","is-referenced-by-count":7,"title":["Parallel Contextual Bandits in Wireless Handover Optimization"],"prefix":"10.1109","author":[{"given":"Igor","family":"Colin","sequence":"first","affiliation":[]},{"given":"Albert","family":"Thomas","sequence":"additional","affiliation":[]},{"given":"Moez","family":"Draief","sequence":"additional","affiliation":[]}],"member":"263","reference":[{"key":"ref39","first-page":"199","article-title":"Thompson sampling: An asymptotically optimal finite-time analysis","author":"kaufmann","year":"2012","journal-title":"ALT"},{"key":"ref38","first-page":"99","article-title":"Further optimal regret bounds for thompson sampling","year":"2013","journal-title":"AISTATS"},{"key":"ref33","first-page":"3126","article-title":"The parallel knowledge gradient method for batch bayesian optimization","author":"wu","year":"2016","journal-title":"NIPS"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1007\/s00158-016-1432-3"},{"key":"ref31","first-page":"3330","article-title":"Parallel predictive entropy search for batch global optimization of expensive objective functions","author":"shah","year":"2015","journal-title":"NIPS"},{"key":"ref30","first-page":"648","article-title":"Batch bayesian optimization via local penalization","author":"gonz\u00e1lez","year":"2016","journal-title":"AISTATS"},{"key":"ref37","first-page":"39","article-title":"Analysis of thompson sampling for the multi- armed bandit problem","author":"agrawal","year":"2012","journal-title":"COLT"},{"key":"ref36","first-page":"2312","article-title":"Improved algorithms for linear stochastic bandits","author":"abbasi-yadkori","year":"2011","journal-title":"NIPS"},{"journal-title":"Paral-lelised bayesian optimisation via thompson sampling","year":"2018","author":"kandasamy","key":"ref35"},{"journal-title":"Parallel and distributed thompson sampling for large-scale accelerated exploration of chemical space","year":"2017","author":"hern\u00e1ndez-lobato","key":"ref34"},{"key":"ref10","first-page":"225","article-title":"Parallel gaussian process optimization with upper confidence bound and pure exploration","author":"contal","year":"2013","journal-title":"ECML-PKDD"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/978-981-10-4355-0"},{"key":"ref11","first-page":"3873","article-title":"Parallelizing exploration-exploitation tradeoffs in gaussian process bandit optimization","volume":"15","author":"desautels","year":"2014","journal-title":"JMLR"},{"key":"ref12","first-page":"737","article-title":"Hyperparameter optimization with approximate gradient","author":"pedregosa","year":"2016","journal-title":"ICML"},{"key":"ref13","first-page":"208","article-title":"Contextual bandits with linear payoff functions","author":"chu","year":"2011","journal-title":"AISTATS"},{"key":"ref14","first-page":"127","article-title":"Thompson sampling for contextual bandits with linear payoffs","author":"agrawal","year":"2013","journal-title":"ICML"},{"key":"ref15","first-page":"1453","article-title":"Online learning under delayed feedback","author":"joulani","year":"2013","journal-title":"ICML"},{"key":"ref16","article-title":"Best arm identification in multi-armed bandits","author":"audibert","year":"2010","journal-title":"COLT"},{"key":"ref17","article-title":"Fully adaptive algorithm for pure exploration in linear bandits","author":"xu","year":"2018","journal-title":"AISTATS"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-319-31750-2_12"},{"key":"ref19","first-page":"2249","article-title":"An empirical evaluation of thompson sampling","author":"chapelle","year":"2011","journal-title":"NIPS"},{"key":"ref28","first-page":"951","article-title":"Distributed batch Gaussian process optimization","volume":"70","author":"daxberger","year":"2017","journal-title":"ICML"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISCAIE.2015.7298317"},{"key":"ref27","doi-asserted-by":"publisher","DOI":"10.1214\/15-AOS1381"},{"key":"ref3","first-page":"133","article-title":"Self-optimization of handover parameters in LTE networks","author":"capdevielle","year":"2013","journal-title":"2013 11th International Symposium and Workshops on Modeling and Optimization in Mobile Ad Hoc and Wireless Networks (WiOpt) WiOpt"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1016\/0196-8858(85)90002-8"},{"key":"ref29","article-title":"Batched high-dimensional bayesian optimization via structural kernel learning","author":"wang","year":"2017","journal-title":"ICML"},{"key":"ref5","first-page":"485","article-title":"Contextual multi-armed bandits","author":"lu","year":"2010","journal-title":"AISTATS"},{"key":"ref8","first-page":"201","article-title":"Online optimization in x-armed bandits","author":"bubeck","year":"2009","journal-title":"NIPS"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1023\/A:1013689704352"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2011.2163326"},{"key":"ref9","first-page":"1015","article-title":"Gaussian process optimization in the bandit setting: No regret and experimental design","author":"srinivas","year":"2010","journal-title":"ICML"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1109\/MWC.2006.275194"},{"key":"ref20","first-page":"61","article-title":"Simple and scalable response prediction for display advertising","volume":"5","author":"chapelle","year":"2015","journal-title":"ACM TIST"},{"key":"ref22","first-page":"654","article-title":"Finite-time analysis of kernelised contextual bandits","author":"valko","year":"2013","journal-title":"UAl"},{"key":"ref21","first-page":"1638","article-title":"Taming the monster: A fast and simple algorithm for contextual bandits","author":"agarwal","year":"2014","journal-title":"ICML"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1109\/ISCC.2014.6912619"},{"key":"ref24","article-title":"Low-rank bandits with latent mixtures","volume":"abs 1609 1508","author":"gopalan","year":"2016","journal-title":"CoRR"},{"key":"ref41","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2013.2247778"},{"key":"ref23","first-page":"-136i","article-title":"Latent bandits","author":"maillard","year":"2014","journal-title":"ICML"},{"journal-title":"Pattern Recognition and Machine Learning (Information Science and Statistics)","year":"2006","author":"bishop","key":"ref44"},{"journal-title":"Stochastic bandit models for delayed conversions","year":"2017","author":"vernade","key":"ref26"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/TVT.2013.2251922"},{"journal-title":"Multiarmed bandit problems with delayed feedback","year":"2010","author":"guha","key":"ref25"}],"event":{"name":"2018 IEEE International Conference on Data Mining Workshops (ICDMW)","start":{"date-parts":[[2018,11,17]]},"location":"Singapore, Singapore","end":{"date-parts":[[2018,11,20]]}},"container-title":["2018 IEEE International Conference on Data Mining Workshops (ICDMW)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/8626049\/8637356\/08637488.pdf?arnumber=8637488","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,1,27]],"date-time":"2022-01-27T00:17:21Z","timestamp":1643242641000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8637488\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,11]]},"references-count":44,"URL":"https:\/\/doi.org\/10.1109\/icdmw.2018.00045","relation":{},"subject":[],"published":{"date-parts":[[2018,11]]}}}