{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,4,22]],"date-time":"2026-04-22T20:27:48Z","timestamp":1776889668225,"version":"3.51.2"},"reference-count":32,"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"}],"funder":[{"name":"Singapore National Research Foundation under its Artificial Intelligence (AI) Visiting Professorship Programme"}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2025,3]]},"DOI":"10.1109\/tit.2025.3528655","type":"journal-article","created":{"date-parts":[[2025,1,13]],"date-time":"2025-01-13T19:44:21Z","timestamp":1736797461000},"page":"2116-2139","source":"Crossref","is-referenced-by-count":3,"title":["A General Framework for Clustering and Distribution Matching With Bandit Feedback"],"prefix":"10.1109","volume":"71","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-5640-515X","authenticated-orcid":false,"given":"Recep Can","family":"Yavas","sequence":"first","affiliation":[{"name":"DesCartes Program, CNRS@CREATE, CREATE Tower, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0009-0007-1458-3760","authenticated-orcid":false,"given":"Yuqi","family":"Huang","sequence":"additional","affiliation":[{"name":"Department of Information Systems and Analytics, School of Computing, National University of Singapore, Queenstown, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-5008-4527","authenticated-orcid":false,"given":"Vincent Y. F.","family":"Tan","sequence":"additional","affiliation":[{"name":"Department of Mathematics, Department of Electrical and Computer Engineering, National University of Singapore, Queenstown, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0003-1403-9160","authenticated-orcid":false,"given":"Jonathan","family":"Scarlett","sequence":"additional","affiliation":[{"name":"Department of Computer Science, the Department of Mathematics, Institute of Data Science, National University of Singapore, Queenstown, Singapore"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.2307\/2332286"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1214\/aoms\/1177706205"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1561\/2200000024"},{"key":"ref4","first-page":"998","article-title":"Optimal best arm identification with fixed confidence","volume-title":"Proc. 29th Annu. Conf. Learn. Theory","author":"Garivier"},{"key":"ref5","first-page":"20707","article-title":"Finding all \u03f5-good arms in stochastic bandits","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"33","author":"Mason"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2778264"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.2972875"},{"issue":"186","key":"ref8","first-page":"1","article-title":"Optimal clustering with bandit feedback","volume":"25","author":"Yang","year":"2024","journal-title":"J. Mach. Learn. Res."},{"key":"ref9","article-title":"Active clustering with bandit feedback","author":"Thuot","year":"2024","journal-title":"arXiv:2406.11485"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-45435-7_18"},{"key":"ref11","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04414-4_7"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2022.3159600"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1214\/13-AOS1144"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2374157"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT57864.2024.10619312"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2024.3464586"},{"key":"ref17","first-page":"5810","article-title":"Fast pure exploration via Frank\u2013Wolfe","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"34","author":"Wang"},{"key":"ref18","first-page":"14492","article-title":"Non-asymptotic pure exploration by solving games","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"32","author":"Degenne"},{"key":"ref19","first-page":"10078","article-title":"A non-asymptotic approach to best-arm identification for Gaussian bandits","volume-title":"Proc. 25th Int. Conf. Artif. Intell. Statist.","volume":"151","author":"Barrier"},{"key":"ref20","first-page":"25578","article-title":"Optimal best-arm identification methods for tail-risk measures","volume-title":"Proc. Adv. Neural Inf. Process. Syst.","volume":"34","author":"Agrawal"},{"key":"ref21","first-page":"61","article-title":"Optimal \u03b4-correct best-arm selection for heavy-tailed distributions","volume-title":"Proc. 31st Int. Conf. Algorithmic Learn. Theory","volume":"117","author":"Agrawal"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1002\/nav.3800030109"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3059272"},{"issue":"1","key":"ref24","first-page":"1","article-title":"On the complexity of best-arm identification in multi-armed bandit models","volume":"17","author":"Kaufmann","year":"2016","journal-title":"J. Mach. Learn. Res."},{"key":"ref25","first-page":"10994","article-title":"Posterior tracking algorithm for classification bandits","volume-title":"Proc. 26th Int. Conf. Artif. Intell. Statist.","volume":"206","author":"Tabata"},{"issue":"1","key":"ref26","first-page":"427","article-title":"Revisiting Frank\u2013Wolfe: Projection-free sparse convex optimization","volume-title":"Proc. 30th Int. Conf. Mach. Learn.","volume":"28","author":"Jaggi"},{"key":"ref27","volume-title":"Information Theory: From Coding To Learning","author":"Polyanskiy","year":"2023"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1093\/imaiai\/iaz025"},{"key":"ref29","article-title":"Representative arm identification: A fixed confidence approach to identify cluster representatives","author":"Gharat","year":"2024","journal-title":"arXiv:2408.14195"},{"key":"ref30","first-page":"1839","article-title":"Adaptive sampling for coarse ranking","volume-title":"Proc. 21st Int. Conf. Artif. Intell. Statist.","volume":"84","author":"Katariya"},{"key":"ref31","first-page":"24315","article-title":"Optimal clustering with noisy queries via multi-armed bandit","volume-title":"Proc. Int. Conf. Mach. Learn.","author":"Xia"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1002\/047174882x"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx8\/18\/10896902\/10838574.pdf?arnumber=10838574","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2025,2,21]],"date-time":"2025-02-21T12:11:21Z","timestamp":1740139881000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10838574\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2025,3]]},"references-count":32,"journal-issue":{"issue":"3"},"URL":"https:\/\/doi.org\/10.1109\/tit.2025.3528655","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"value":"0018-9448","type":"print"},{"value":"1557-9654","type":"electronic"}],"subject":[],"published":{"date-parts":[[2025,3]]}}}