{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2025,5,7]],"date-time":"2025-05-07T05:00:15Z","timestamp":1746594015233,"version":"3.37.3"},"reference-count":39,"publisher":"Institute of Electrical and Electronics Engineers (IEEE)","issue":"9","license":[{"start":{"date-parts":[[2018,9,1]],"date-time":"2018-09-01T00:00:00Z","timestamp":1535760000000},"content-version":"vor","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2018,9,1]],"date-time":"2018-09-01T00:00:00Z","timestamp":1535760000000},"content-version":"am","delay-in-days":0,"URL":"https:\/\/ieeexplore.ieee.org\/Xplorehelp\/downloads\/license-information\/IEEE.html"},{"start":{"date-parts":[[2018,9,1]],"date-time":"2018-09-01T00:00:00Z","timestamp":1535760000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2018,9,1]],"date-time":"2018-09-01T00:00:00Z","timestamp":1535760000000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"name":"Adobe Data Science Research Award"},{"name":"Alibaba Innovation Research Award"},{"name":"Bloomberg Data Science Research Grant"},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1523816","CCF-1217416"],"award-info":[{"award-number":["CCF-1523816","CCF-1217416"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]},{"DOI":"10.13039\/100000001","name":"National Science Foundation","doi-asserted-by":"publisher","award":["CCF-1149888","NSF CCF-1525342"],"award-info":[{"award-number":["CCF-1149888","NSF CCF-1525342"]}],"id":[{"id":"10.13039\/100000001","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":["IEEE Trans. Inform. Theory"],"published-print":{"date-parts":[[2018,9]]},"DOI":"10.1109\/tit.2018.2851986","type":"journal-article","created":{"date-parts":[[2018,7,2]],"date-time":"2018-07-02T23:55:35Z","timestamp":1530575735000},"page":"6139-6160","source":"Crossref","is-referenced-by-count":5,"title":["Optimal Instance Adaptive Algorithm for the Top-$K$  Ranking Problem"],"prefix":"10.1109","volume":"64","author":[{"ORCID":"https:\/\/orcid.org\/0000-0002-9049-9452","authenticated-orcid":false,"given":"Xi","family":"Chen","sequence":"first","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Sivakanth","family":"Gopi","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"ORCID":"https:\/\/orcid.org\/0000-0001-8416-0172","authenticated-orcid":false,"given":"Jieming","family":"Mao","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]},{"given":"Jon","family":"Schneider","sequence":"additional","affiliation":[],"role":[{"role":"author","vocabulary":"crossref"}]}],"member":"263","reference":[{"key":"ref39","first-page":"217","article-title":"Optimal PAC multiple arm identification with applications to crowdsourcing","author":"zhou","year":"2014","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"key":"ref38","first-page":"109","article-title":"Efficient ranking from pairwise comparisons","author":"wauthier","year":"2013","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"key":"ref33","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2016.7541480"},{"key":"ref32","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2016.2634418"},{"key":"ref31","first-page":"-118i","article-title":"A statistical convergence perspective of algorithms for rank aggregation from pairwise data","author":"rajkumar","year":"2014","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"key":"ref30","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2016.1534"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1037\/h0032955"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1037\/h0070288"},{"journal-title":"Simple robust and optimal ranking from pairwise comparisons","year":"2015","author":"shah","key":"ref35"},{"key":"ref34","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2017.2659660"},{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1214\/15-AOS1324"},{"journal-title":"On matrix estimation under monotonicity constraints","year":"2015","author":"chatterjee","key":"ref11"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1017\/CBO9780511921889"},{"key":"ref13","first-page":"371","article-title":"Spectral MLE: Top-K rank aggregation from pairwise comparisons","author":"chen","year":"2015","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"key":"ref14","doi-asserted-by":"publisher","DOI":"10.1145\/371920.372165"},{"key":"ref15","first-page":"233","article-title":"Experimental tests of a stochastic decision theory","volume":"17","author":"davidson","year":"1959","journal-title":"Measurement Definitions and Theories"},{"key":"ref16","first-page":"265","article-title":"Learning to Top-K search using pairwise comparisons","author":"eriksson","year":"2013","journal-title":"Proc Conf Artif Intell Stat"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1016\/0022-2496(73)90021-7"},{"key":"ref18","doi-asserted-by":"publisher","DOI":"10.1016\/S0022-0000(03)00026-6"},{"journal-title":"Spatial adaptation in trend filtering","year":"2017","author":"guntuboyina","key":"ref19"},{"journal-title":"Individual Choice Behavior A Theoretical Analysis","year":"1959","author":"luce","key":"ref28"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1145\/2688073.2688087"},{"key":"ref27","first-page":"145","article-title":"Learning mallows models with pairwise preferences","author":"lu","year":"2011","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"key":"ref3","first-page":"268","article-title":"Noisy sorting without resampling","author":"braverman","year":"2008","journal-title":"Proc ACM-SIAM Symp Discrete Algorithms (SODA)"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1093\/biomet\/39.3-4.324"},{"key":"ref29","doi-asserted-by":"publisher","DOI":"10.3758\/BF03343344"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/2897518.2897642"},{"key":"ref8","first-page":"258","article-title":"Multiple identifications in multi-armed bandits","author":"bubeck","year":"2013","journal-title":"Proc Int Conf Mach Learn (ICML)"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1111\/j.1468-0297.1997.tb00009.x"},{"key":"ref2","first-page":"810","article-title":"Active learning ranking from pairwise preferences with almost optimal query complexity","author":"ailon","year":"2011","journal-title":"Proc Adv Neural Inf Process Syst (NIPS)"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1017\/S0962492906230010"},{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1145\/1411509.1411513"},{"journal-title":"Global risk bounds and adaptation in univariate convex regression","year":"2013","author":"guntuboyina","key":"ref20"},{"journal-title":"Top-k ranking from pairwise comparisons When spectral ranking is optimal","year":"2013","author":"jang","key":"ref22"},{"journal-title":"Active ranking from pairwise comparisons and when parametric assumptions don’t help","year":"2016","author":"heckel","key":"ref21"},{"key":"ref24","first-page":"2240","article-title":"Active ranking using pairwise comparisons","author":"jamieson","year":"2011","journal-title":"Proc Adv Neural Inf Process Syst"},{"key":"ref23","first-page":"423","article-title":"lil’ UCB: An optimal exploration algorithm for multi-armed bandits","author":"jamieson","year":"2014","journal-title":"Proc Conf Learn Theory (COLT)"},{"key":"ref26","volume":"38","author":"koltchinskii","year":"2011","journal-title":"Oracle Inequalities in Empirical Risk Minimization and Sparse Recovery Problems École d-Été de Probabilités de Saint-Flour XXXVIII-2008"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.1145\/1250790.1250806"}],"container-title":["IEEE Transactions on Information Theory"],"original-title":[],"link":[{"URL":"https:\/\/ieeexplore.ieee.org\/ielaam\/18\/8438569\/8401531-aam.pdf","content-type":"application\/pdf","content-version":"am","intended-application":"syndication"},{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/18\/8438569\/08401531.pdf?arnumber=8401531","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2022,4,8]],"date-time":"2022-04-08T18:55:21Z","timestamp":1649444121000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/8401531\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2018,9]]},"references-count":39,"journal-issue":{"issue":"9"},"URL":"https:\/\/doi.org\/10.1109\/tit.2018.2851986","relation":{},"ISSN":["0018-9448","1557-9654"],"issn-type":[{"type":"print","value":"0018-9448"},{"type":"electronic","value":"1557-9654"}],"subject":[],"published":{"date-parts":[[2018,9]]}}}