{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:54:09Z","timestamp":1773377649965,"version":"3.50.1"},"reference-count":10,"publisher":"IEEE","license":[{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2020,6,1]],"date-time":"2020-06-01T00:00:00Z","timestamp":1590969600000},"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":[[2020,6]]},"DOI":"10.1109\/isit44484.2020.9174371","type":"proceedings-article","created":{"date-parts":[[2020,8,24]],"date-time":"2020-08-24T17:28:01Z","timestamp":1598290081000},"page":"2783-2788","source":"Crossref","is-referenced-by-count":0,"title":["An Improved Regret Bound for Thompson Sampling in the Gaussian Linear Bandit Setting"],"prefix":"10.1109","author":[{"given":"Cem","family":"Kalkanl\u0131","sequence":"first","affiliation":[{"name":"Stanford University,Department of Electrical Engineering"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ayfer","family":"\u00d6zg\u00fcr","sequence":"additional","affiliation":[{"name":"Stanford University,Department of Electrical Engineering"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1287\/mksc.2016.1023"},{"key":"ref3","first-page":"1297","article-title":"Efficient thompson sampling for online matrix-factorization recommendation","author":"kawale","year":"2015","journal-title":"Advances in neural information processing systems"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511546921"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2014.0650"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2018.1755"},{"key":"ref8","first-page":"4157","article-title":"An information-theoretic analysis for thompson sampling with many actions","author":"dong","year":"2018","journal-title":"Advances in neural information processing systems"},{"key":"ref7","first-page":"2442","article-title":"An information-theoretic analysis of thompson sampling","volume":"17","author":"russo","year":"2016","journal-title":"The Journal of Machine Learning Research"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1002\/asmb.2104"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1287\/moor.1100.0446"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.2307\/2332286"}],"event":{"name":"2020 IEEE International Symposium on Information Theory (ISIT)","location":"Los Angeles, CA, USA","start":{"date-parts":[[2020,6,21]]},"end":{"date-parts":[[2020,6,26]]}},"container-title":["2020 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9166581\/9173928\/09174371.pdf?arnumber=9174371","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:34:45Z","timestamp":1773347685000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9174371\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2020,6]]},"references-count":10,"URL":"https:\/\/doi.org\/10.1109\/isit44484.2020.9174371","relation":{},"subject":[],"published":{"date-parts":[[2020,6]]}}}