{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T04:36:45Z","timestamp":1773376605598,"version":"3.50.1"},"reference-count":48,"publisher":"IEEE","license":[{"start":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:00:00Z","timestamp":1687651200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2023,6,25]],"date-time":"2023-06-25T00:00:00Z","timestamp":1687651200000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/100006190","name":"Research and Development","doi-asserted-by":"publisher","id":[{"id":"10.13039\/100006190","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2023,6,25]]},"DOI":"10.1109\/isit54713.2023.10206881","type":"proceedings-article","created":{"date-parts":[[2023,8,22]],"date-time":"2023-08-22T13:31:15Z","timestamp":1692711075000},"page":"1788-1793","source":"Crossref","is-referenced-by-count":0,"title":["On the Optimal Bounds for Noisy Computing"],"prefix":"10.1109","author":[{"given":"Banghua","family":"Zhu","sequence":"first","affiliation":[{"name":"University of California,Berkeley"}]},{"given":"Ziao","family":"Wang","sequence":"additional","affiliation":[{"name":"University of British Columbia"}]},{"given":"Nadim","family":"Ghaddar","sequence":"additional","affiliation":[{"name":"University of California San Diego"}]},{"given":"Jiantao","family":"Jiao","sequence":"additional","affiliation":[{"name":"University of California,Berkeley"}]},{"given":"Lele","family":"Wang","sequence":"additional","affiliation":[{"name":"University of British Columbia"}]}],"member":"263","reference":[{"key":"ref1","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539791195877"},{"key":"ref2","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":"Journal of Machine Learning Research"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1037\/h0020184"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1063\/1.3024514"},{"key":"ref5","article-title":"Block coding with noiseless feedback","volume-title":"Ph.D. Thesis","author":"Berlekamp","year":"1964"},{"key":"ref6","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.1963.1057832"},{"issue":"3","key":"ref7","first-page":"51","article-title":"An interval estimation problem for controlled observations","volume":"10","author":"Burnashev","year":"1974","journal-title":"Problemy Peredachi Informatsii"},{"key":"ref8","doi-asserted-by":"publisher","DOI":"10.1016\/0304-3975(89)90077-7"},{"key":"ref9","first-page":"881","article-title":"Noisy binary search and its applications","volume-title":"Proceedings of the Eighteenth Annual ACM-SIAM Symposium on Discrete Algorithms","author":"Karp"},{"issue":"4","key":"ref10","first-page":"10","article-title":"Data transmission over a discrete channel with feedback, random transmission time","volume":"12","author":"Burnashev","year":"1976","journal-title":"Problemy Peredachi Informatsii"},{"key":"ref11","doi-asserted-by":"crossref","DOI":"10.1145\/3564246.3585131","volume-title":"Optimal bounds for noisy sorting","author":"Gu","year":"2023"},{"key":"ref12","first-page":"2488","article-title":"Active learning for top-k rank aggregation from noisy comparisons","volume-title":"Proceedings of the 34th International Conference on Machine Learning - Volume 70","author":"Mohajer"},{"key":"ref13","first-page":"1088","article-title":"Maximum selection and ranking under noisy comparisons","volume-title":"Proceedings of the 34th International Conference on Machine Learning","volume":"70","author":"Falahatgar"},{"issue":"199","key":"ref14","first-page":"1","article-title":"Simple, robust and optimal ranking from pairwise comparisons","volume":"18","author":"Shah","year":"2018","journal-title":"J. Mach. Learn. Res."},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1214\/18-AOS1772"},{"key":"ref16","first-page":"39","article-title":"Learning with limited rounds of adaptivity: Coin tossing, multi-armed bandits, and ranking from pairwise comparisons","volume-title":"Proceedings of the 2017 Conference on Learning Theory","volume":"65","author":"Agarwal"},{"key":"ref17","doi-asserted-by":"publisher","DOI":"10.1145\/1411509.1411513"},{"key":"ref18","volume-title":"Sorting from noisy information","author":"Braverman","year":"2009"},{"key":"ref19","article-title":"Active learning ranking from pairwise preferences with almost optimal query complexity","volume-title":"Advances in Neural Information Processing Systems","volume":"24","author":"Ailon","year":"2011"},{"key":"ref20","article-title":"Iterative ranking from pair-wise comparisons","volume":"25","author":"Negahban","year":"2012","journal-title":"Advances in Neural Information Processing Systems"},{"issue":"3","key":"ref21","first-page":"109","article-title":"Efficient ranking from pairwise comparisons","volume-title":"Proceedings of the 30th International Conference on Machine Learning","volume":"28","author":"Wauthier"},{"key":"ref22","first-page":"I\u2013118","article-title":"A statistical convergence perspective of algorithms for rank aggregation from pairwise data","volume-title":"Proceedings of the 31st International Conference on International Conference on Machine Learning","volume":"32","author":"Rajkumar"},{"key":"ref23","first-page":"11","article-title":"Stochastically transitive models for pairwise comparisons: Statistical and computational issues","volume-title":"Proceedings of the 33rd International Conference on International Conference on Machine Learning","volume":"48","author":"Shah"},{"key":"ref24","first-page":"821","article-title":"Minimax rates and efficient algorithms for noisy sorting","volume-title":"Proceedings of Algorithmic Learning Theory","volume":"83","author":"Mao"},{"key":"ref25","doi-asserted-by":"publisher","DOI":"10.2307\/2334029"},{"key":"ref26","doi-asserted-by":"publisher","DOI":"10.1145\/2701427"},{"key":"ref27","first-page":"371","article-title":"Spectral MLE: Top-K rank aggregation from pairwise comparisons","volume-title":"Proceedings of the 32nd International Conference on Machine Learning","volume":"37","author":"Chen"},{"key":"ref28","doi-asserted-by":"publisher","DOI":"10.1287\/moor.2021.1209"},{"key":"ref29","author":"Ren","year":"2018","journal-title":"Pac ranking from pairwise and listwise queries: Lower bounds and upper bounds"},{"key":"ref30","first-page":"2240","article-title":"Active ranking using pairwise comparisons","volume-title":"Proceedings of the 24th International Conference on Neural Information Processing Systems","author":"Jamieson"},{"key":"ref31","author":"Ailon","year":"2011","journal-title":"A new active learning scheme with applications to learning to rank from pairwise preferences"},{"key":"ref32","volume-title":"Noisy sorting capacity","author":"Wang","year":"2023"},{"issue":"1","key":"ref33","first-page":"82","article-title":"Lower bound for the redundancy of self-correcting arrangements of unreliable functional elements","volume":"13","author":"Dobrushin","year":"1977","journal-title":"Problemy Peredachi Informatsii"},{"issue":"3","key":"ref34","first-page":"56","article-title":"Upper bound on the redundancy of self-correcting arrangements of unreliable functional elements","volume":"13","author":"Dobrushin","year":"1977","journal-title":"Problemy Peredachi Informatsii"},{"key":"ref35","doi-asserted-by":"publisher","DOI":"10.1515\/9781400882618-003"},{"key":"ref36","doi-asserted-by":"publisher","DOI":"10.1109\/18.79921"},{"key":"ref37","doi-asserted-by":"publisher","DOI":"10.1109\/18.312190"},{"key":"ref38","doi-asserted-by":"publisher","DOI":"10.1137\/S0097539796310102"},{"key":"ref39","doi-asserted-by":"publisher","DOI":"10.1109\/SFCS.1991.185425"},{"key":"ref40","doi-asserted-by":"publisher","DOI":"10.1007\/978-3-642-04414-4_7"},{"key":"ref41","first-page":"41","article-title":"Best arm identification in multi-armed bandits","volume-title":"COLT","author":"Audibert"},{"key":"ref42","article-title":"Optimal best arm identification with fixed confidence","volume-title":"Conference on Learning Theory","author":"Garivier"},{"key":"ref43","doi-asserted-by":"publisher","DOI":"10.1109\/CISS.2014.6814096"},{"key":"ref44","article-title":"Best arm identification: A unified approach to fixed budget and fixed confidence","volume":"25","author":"Gabillon","year":"2012","journal-title":"Advances in Neural Information Processing Systems"},{"key":"ref45","doi-asserted-by":"publisher","DOI":"10.1214\/aos\/1193342380"},{"key":"ref46","doi-asserted-by":"publisher","DOI":"10.1007\/978-1-4612-1880-7_29"},{"key":"ref47","doi-asserted-by":"publisher","DOI":"10.1007\/BF00535278"},{"key":"ref48","doi-asserted-by":"publisher","DOI":"10.1007\/b13794"}],"event":{"name":"2023 IEEE International Symposium on Information Theory (ISIT)","location":"Taipei, Taiwan","start":{"date-parts":[[2023,6,25]]},"end":{"date-parts":[[2023,6,30]]}},"container-title":["2023 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/10206429\/10206441\/10206881.pdf?arnumber=10206881","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:26:52Z","timestamp":1773347212000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/10206881\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2023,6,25]]},"references-count":48,"URL":"https:\/\/doi.org\/10.1109\/isit54713.2023.10206881","relation":{},"subject":[],"published":{"date-parts":[[2023,6,25]]}}}