{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,5,18]],"date-time":"2026-05-18T16:46:36Z","timestamp":1779122796586,"version":"3.51.4"},"reference-count":52,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","license":[{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,1,1]],"date-time":"2022-01-01T00:00:00Z","timestamp":1640995200000},"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":["IEEE Trans. on Signal and Inf. Process. over Networks"],"published-print":{"date-parts":[[2022]]},"DOI":"10.1109\/tsipn.2022.3164352","type":"journal-article","created":{"date-parts":[[2022,4,1]],"date-time":"2022-04-01T20:06:03Z","timestamp":1648843563000},"page":"330-343","source":"Crossref","is-referenced-by-count":2,"title":["Greedy $k$-Center From Noisy Distance Samples"],"prefix":"10.1109","volume":"8","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-2290-7979","authenticated-orcid":false,"given":"Neharika","family":"Jali","sequence":"first","affiliation":[{"name":"Department of Electrical Engineering, Indian Institute of Technology Bombay, Mumbai, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0002-7233-0717","authenticated-orcid":false,"given":"Nikhil","family":"Karamchandani","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering, Indian Institute of Technology Bombay, Mumbai, India"}],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-9393-9276","authenticated-orcid":false,"given":"Sharayu","family":"Moharir","sequence":"additional","affiliation":[{"name":"Department of Electrical Engineering, Indian Institute of Technology Bombay, Mumbai, India"}],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","first-page":"1","article-title":"lil’UCB: An optimal exploration algorithm for multi-armed bandits","author":"jamieson","year":"0","journal-title":"Proc 27th Annu Conf Learn Theory"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1016\/0196-8858(85)90002-8"},{"key":"ref33","first-page":"1028","article-title":"Maximin action identification: A new bandit framework for games","author":"garivier","year":"0","journal-title":"Conf Learn Theory"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/CISS.2014.6814096"},{"key":"ref31","doi-asserted-by":"publisher","DOI":"10.14778\/3467861.3467862"},{"key":"ref30","article-title":"Banditpam: Almost linear time k-medoids clustering via multi-armed bandits","author":"tiwari","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1080\/07474946.2021.1847965"},{"key":"ref36","article-title":"Finite sample prediction and recovery bounds for ordinal embedding","author":"jain","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1109\/FOCS.2006.49"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1145\/1132516.1132597"},{"key":"ref28","first-page":"500","article-title":"Medoids in almost-linear time via multi-armed bandits","author":"bagaria","year":"0","journal-title":"Proc 21st Int Conf Artif Intell Statist"},{"key":"ref27","first-page":"240","article-title":"Non-stochastic best arm identification and hyperparameter optimization","author":"jamieson","year":"0","journal-title":"Mach Learn Res"},{"key":"ref29","first-page":"3655","article-title":"Ultra fast medoid identification via correlated sequential halving","author":"baharav","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2021.3076447"},{"key":"ref1","author":"kleinberg","year":"2005","journal-title":"Algorithm Design"},{"key":"ref20","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(85)90224-5"},{"key":"ref22","doi-asserted-by":"publisher","DOI":"10.1145\/5925.5933"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1145\/62212.62255"},{"key":"ref24","doi-asserted-by":"publisher","DOI":"10.1145\/258533.258657"},{"key":"ref23","doi-asserted-by":"publisher","DOI":"10.14778\/3317315.3317319"},{"key":"ref26","article-title":"Efficient hyperparameter optimization and infinitely many armed bandits","author":"rostamizadeh","year":"0","journal-title":"Proc 5th Int Conf Learn Representations"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1007\/11871842_29"},{"key":"ref50","first-page":"1","article-title":"Information complexity in bandit subset selection","author":"kaufmann","year":"0","journal-title":"Mach Learn Res"},{"key":"ref51","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-4380-9_27"},{"key":"ref52","article-title":"Active perceptual similarity modeling with auxiliary information","author":"heim","year":"2015"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1017\/9781108571401"},{"key":"ref11","first-page":"998","article-title":"Optimal best arm identification with fixed confidence","author":"garivier","year":"0","journal-title":"Proc 29th Conf Learn Theory"},{"key":"ref40","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":"ref12","doi-asserted-by":"publisher","DOI":"10.1007\/s11263-015-0816-y"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/CVPR.2014.32"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1109\/ICCV.2017.594"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1007\/3-540-48224-5_21"},{"key":"ref16","doi-asserted-by":"publisher","DOI":"10.1007\/s00453-001-0110-y"},{"key":"ref17","first-page":"250","article-title":"Approximate clustering via core-sets","author":"bundefineddoiu","year":"0","journal-title":"Proc 34th Annu ACM Symp Theory Comput"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1145\/2462356.2462401"},{"key":"ref19","doi-asserted-by":"publisher","DOI":"10.1109\/IPDPS.2016.61"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/1028788.1028809"},{"key":"ref3","first-page":"3099","article-title":"Adaptive estimation for approximate $k$-nearest-neighbor computations","author":"lejeune","year":"0","journal-title":"Mach Learn Res"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1007\/BF02289630"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1007\/BF02289694"},{"key":"ref8","first-page":"9586","article-title":"Learning nearest neighbor graphs from noisy distance samples","author":"mason","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref7","first-page":"4142","article-title":"Learning low-dimensional metrics","author":"mason","year":"0","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref49","first-page":"777","article-title":"Bandit algorithms based on thompson sampling for bounded reward distributions","author":"riou","year":"0","journal-title":"Proc 31st Int Conf Algorithmic Learn Theory"},{"key":"ref9","first-page":"1777","article-title":"Nearest neighbor search under uncertainity","author":"mason","year":"0","journal-title":"Mach Learn Res"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2019.1911"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1561\/9781680834710"},{"key":"ref48","first-page":"39.1","article-title":"Analysis of thompson sampling for the multi-armed bandit problem","author":"agrawal","year":"0","journal-title":"Proc 25th Annu Conf Learn Theory"},{"key":"ref47","first-page":"1823","article-title":"Fixed-confidence guarantees for Bayesian best-arm identification","author":"shang","year":"0","journal-title":"Proc 23rd Int Conf Artif Intell Statist"},{"key":"ref42","doi-asserted-by":"publisher","DOI":"10.1016\/j.snb.2012.01.074"},{"key":"ref41","author":"cormen","year":"2009","journal-title":"Introduction to Algorithms"},{"key":"ref44","first-page":"1824","article-title":"Sample complexity of partition identification using multi-armed bandits","author":"juneja","year":"0","journal-title":"Proc 32nd Annu Conf Learn Theory"},{"key":"ref43","first-page":"6335","article-title":"Sequential test for the lowest mean: From Thompson to Murphy sampling","author":"kaufmann","year":"0","journal-title":"Adv Neural Inf Process Syst"}],"container-title":["IEEE Transactions on Signal and Information Processing over Networks"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/6884276\/9666472\/09748031.pdf?arnumber=9748031","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,5,30]],"date-time":"2022-05-30T21:51:31Z","timestamp":1653947491000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9748031\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022]]},"references-count":52,"URL":"https:\/\/doi.org\/10.1109\/tsipn.2022.3164352","relation":{},"ISSN":["2373-776X","2373-7778"],"issn-type":[{"value":"2373-776X","type":"electronic"},{"value":"2373-7778","type":"electronic"}],"subject":[],"published":{"date-parts":[[2022]]}}}