{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:59:29Z","timestamp":1773377969727,"version":"3.50.1"},"reference-count":18,"publisher":"IEEE","license":[{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2021,7,12]],"date-time":"2021-07-12T00:00:00Z","timestamp":1626048000000},"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":[[2021,7,12]]},"DOI":"10.1109\/isit45174.2021.9517964","type":"proceedings-article","created":{"date-parts":[[2021,9,1]],"date-time":"2021-09-01T16:52:42Z","timestamp":1630515162000},"page":"2173-2178","source":"Crossref","is-referenced-by-count":6,"title":["Optimal Confidence Sets for the Multinomial Parameter"],"prefix":"10.1109","author":[{"given":"Matthew L.","family":"Malloy","sequence":"first","affiliation":[{"name":"University of Wisconsin-Madison,Electrical & Computer Engineering Department"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Ardhendu","family":"Tripathy","sequence":"additional","affiliation":[{"name":"Missouri University of Science & Technology,Computer Science Department"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Robert D.","family":"Nowak","sequence":"additional","affiliation":[{"name":"University of Wisconsin-Madison,Electrical & Computer Engineering Department"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref10","first-page":"423","article-title":"lil'UCB: An optimal exploration algorithm for multi-armed bandits","author":"jamieson","year":"0","journal-title":"Conference on Learning Theory"},{"key":"ref11","article-title":"On finding the largest mean among many","year":"2013","journal-title":"ArXiv Preprint"},{"key":"ref12","first-page":"1","author":"frigyik","year":"2010","journal-title":"Introduction to the Dirichlet Distribution and Related Processes"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.2307\/2287116"},{"key":"ref14","author":"cover","year":"2012","journal-title":"Elements of Information Theory"},{"key":"ref15","article-title":"Concentration inequalities for the empirical distribution","author":"mardia","year":"2018","journal-title":"ArXiv Preprint"},{"key":"ref16","first-page":"359","article-title":"The KL-UCB algorithm for bounded stochastic bandits and beyond","author":"garivier","year":"0","journal-title":"Proceedings of the 24th Annual Conference on Learning Theory"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2015.7282643"},{"key":"ref18","article-title":"A simple algorithm for exact multinomial tests","author":"resin","year":"2020","journal-title":"ArXiv Preprint"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1198\/jasa.2009.tm08152"},{"key":"ref3","author":"nowak","year":"2019","journal-title":"Tighter confidence intervals for rating systems"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1191\/0962280203sm311ra"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.2307\/2685469"},{"key":"ref8","article-title":"Empirical Bernstein bounds and sample variance penalization","author":"maurer","year":"0","journal-title":"COLT 2009 The 22nd Conference on Learning Theory"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1145\/1390156.1390241"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/26.4.404"},{"key":"ref1","author":"malloy","year":"2021","journal-title":"Optimal confidence regions for the multinomial parameter"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1016\/j.tcs.2009.01.016"}],"event":{"name":"2021 IEEE International Symposium on Information Theory (ISIT)","location":"Melbourne, Australia","start":{"date-parts":[[2021,7,12]]},"end":{"date-parts":[[2021,7,20]]}},"container-title":["2021 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9517708\/9517709\/09517964.pdf?arnumber=9517964","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:35:43Z","timestamp":1773347743000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9517964\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2021,7,12]]},"references-count":18,"URL":"https:\/\/doi.org\/10.1109\/isit45174.2021.9517964","relation":{},"subject":[],"published":{"date-parts":[[2021,7,12]]}}}