{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:56:15Z","timestamp":1773377775197,"version":"3.50.1"},"reference-count":41,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"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":[],"published-print":{"date-parts":[[2022,6,26]]},"DOI":"10.1109\/isit50566.2022.9834636","type":"proceedings-article","created":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T15:34:22Z","timestamp":1659540862000},"page":"1659-1664","source":"Crossref","is-referenced-by-count":0,"title":["Multi-Environment Meta-Learning in Stochastic Linear Bandits"],"prefix":"10.1109","author":[{"given":"Ahmadreza","family":"Moradipari","sequence":"first","affiliation":[{"name":"University of California,Santa Barbara"}]},{"given":"Mohammad","family":"Ghavamzadeh","sequence":"additional","affiliation":[{"name":"Google Research"}]},{"given":"Taha","family":"Rajabzadeh","sequence":"additional","affiliation":[{"name":"Stanford University"}]},{"given":"Christos","family":"Thrampoulidis","sequence":"additional","affiliation":[{"name":"University of British Columbia"}]},{"given":"Mahnoosh","family":"Alizadeh","sequence":"additional","affiliation":[{"name":"University of California,Santa Barbara"}]}],"member":"263","reference":[{"key":"ref39","article-title":"Thompson sampling with a mixture prior","author":"hong","year":"2021"},{"key":"ref38","article-title":"Meta-thompson sampling","author":"kveton","year":"2021"},{"key":"ref33","article-title":"Multi-task linear bandits","author":"soare","year":"2014","journal-title":"NIPS workshop on Transfer and Multi-Task Learning Theory meets Practice"},{"key":"ref32","article-title":"Multi-task learning for contextual bandits","author":"deshmukh","year":"2017"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.24963\/ijcai.2017\/186"},{"key":"ref30","article-title":"Sequential transfer in multi-armed bandit with finite set of models","author":"azar","year":"2013"},{"key":"ref37","article-title":"Hierarchical bayesian bandits","author":"hong","year":"2021"},{"key":"ref36","article-title":"Parameter and feature selection in stochastic linear bandits","author":"moradipari","year":"2021"},{"key":"ref35","article-title":"Provable benefits of representation learning in linear bandits","author":"yang","year":"2020"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1609\/aaai.v32i1.11699"},{"key":"ref10","first-page":"2312","article-title":"Improved algorithms for linear stochastic bandits","author":"abbasi-yadkori","year":"2011","journal-title":"Advances in neural information processing systems"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1017\/9781108571401"},{"key":"ref11","first-page":"11191","article-title":"Stage-wise conservative linear bandits","volume":"33","author":"moradipari","year":"2020","journal-title":"Advances in neural information processing systems"},{"key":"ref12","first-page":"127","article-title":"Thompson sampling for contextual bandits with linear payoffs","author":"agrawal","year":"2013","journal-title":"International Conference on Machine Learning"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1214\/17-EJS1341SI"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TSP.2021.3089822"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ICASSP40776.2020.9053865"},{"key":"ref16","article-title":"A framework for learning predictive structures from multiple tasks and unlabeled data","volume":"6","author":"ando","year":"2005","journal-title":"Journal of Machine Learning Research"},{"key":"ref17","first-page":"55","article-title":"Excess risk bounds for multitask learning with trace norm regularization","author":"pontil","year":"2013","journal-title":"Conference on Learning Theory"},{"key":"ref18","first-page":"343","article-title":"Sparse coding for multitask and transfer learning","author":"maurer","year":"2013","journal-title":"International Conference on Machine Learning"},{"key":"ref19","first-page":"1","article-title":"The benefit of multitask representation learning","volume":"17","author":"maurer","year":"2016","journal-title":"Journal of Machine Learning Research"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2019.01091"},{"key":"ref4","first-page":"586","article-title":"Parametric´ bandits: The generalized linear case","author":"filippi","year":"2010","journal-title":"Advances in neural information processing systems"},{"key":"ref27","article-title":"Adaptive gradient-based meta-learning methods","author":"khodak","year":"2019"},{"key":"ref3","doi-asserted-by":"crossref","first-page":"661","DOI":"10.1145\/1772690.1772758","article-title":"A contextual-bandit approach to personalized news article recommendation","author":"li","year":"2010","journal-title":"Proceedings of the 19th International Conference on World Wide Web"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-34106-9_18"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.3233\/IA-150080"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.2307\/2332286"},{"key":"ref8","article-title":"Stochastic linear optimization under bandit feedback","author":"dani","year":"2008","journal-title":"21st Annual Conference on Learning Theory"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2014.0650"},{"key":"ref2","doi-asserted-by":"crossref","first-page":"235","DOI":"10.1023\/A:1013689704352","article-title":"Finite-time analysis of the multiarmed bandit problem","volume":"47","author":"auer","year":"2002","journal-title":"Mach Learn"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1100.0446"},{"key":"ref1","article-title":"Meta-learning with stochastic linear bandits","author":"cella","year":"2020"},{"key":"ref20","first-page":"2901","article-title":"Linear algorithms for online multitask classification","volume":"11","author":"cavallanti","year":"2010","journal-title":"The Journal of Machine Learning Research"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1613\/jair.731"},{"key":"ref21","article-title":"Few-shot learning via learning the representation, provably","author":"du","year":"2020"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.4249\/scholarpedia.4650"},{"key":"ref41","first-page":"10169","article-title":"Learning to learn around a common mean","volume":"31","author":"denevi","year":"2018","journal-title":"Advances in neural information processing systems"},{"key":"ref23","first-page":"261","article-title":"Regret bounds for lifelong learning","author":"alquier","year":"2017","journal-title":"Artificial Intelligence and Statistics"},{"key":"ref26","first-page":"1920","article-title":"Online meta-learning","author":"finn","year":"2019","journal-title":"International Conference on Machine Learning"},{"key":"ref25","first-page":"1566","article-title":"Learning-to-learn stochastic gradient descent with biased regularization","author":"denevi","year":"2019","journal-title":"International Conference on Machine Learning"}],"event":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","location":"Espoo, Finland","start":{"date-parts":[[2022,6,26]]},"end":{"date-parts":[[2022,7,1]]}},"container-title":["2022 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9834325\/9834269\/09834636.pdf?arnumber=9834636","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:07Z","timestamp":1773347707000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9834636\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,26]]},"references-count":41,"URL":"https:\/\/doi.org\/10.1109\/isit50566.2022.9834636","relation":{},"subject":[],"published":{"date-parts":[[2022,6,26]]}}}