{"status":"ok","message-type":"work","message-version":"1.0.0","message":{"indexed":{"date-parts":[[2026,3,13]],"date-time":"2026-03-13T05:02:09Z","timestamp":1773378129998,"version":"3.50.1"},"reference-count":22,"publisher":"IEEE","license":[{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-029"},{"start":{"date-parts":[[2022,6,26]],"date-time":"2022-06-26T00:00:00Z","timestamp":1656201600000},"content-version":"stm-asf","delay-in-days":0,"URL":"https:\/\/doi.org\/10.15223\/policy-037"}],"funder":[{"DOI":"10.13039\/501100003725","name":"National Research Foundation of Korea","doi-asserted-by":"publisher","id":[{"id":"10.13039\/501100003725","id-type":"DOI","asserted-by":"publisher"}]}],"content-domain":{"domain":[],"crossmark-restriction":false},"short-container-title":[],"published-print":{"date-parts":[[2022,6,26]]},"DOI":"10.1109\/isit50566.2022.9834403","type":"proceedings-article","created":{"date-parts":[[2022,8,3]],"date-time":"2022-08-03T15:34:22Z","timestamp":1659540862000},"page":"1483-1488","source":"Crossref","is-referenced-by-count":1,"title":["A Generalized Worker-Task Specialization Model for Crowdsourcing: Optimal Limits and Algorithm"],"prefix":"10.1109","author":[{"given":"Doyeon","family":"Kim","sequence":"first","affiliation":[{"name":"KAIST,School of Electrical Engineering"}]},{"given":"Jeonghwan","family":"Lee","sequence":"additional","affiliation":[{"name":"KAIST,Department of Mathematical Sciences"}]},{"given":"Hye Won","family":"Chung","sequence":"additional","affiliation":[{"name":"KAIST,School of Electrical Engineering"}]}],"member":"263","reference":[{"key":"ref10","doi-asserted-by":"publisher","DOI":"10.1287\/opre.2013.1235"},{"key":"ref11","first-page":"4844","article-title":"Achieving budget-optimality with adaptive schemes in crowdsourcing","volume":"29","author":"khetan","year":"2016","journal-title":"Advances in neural information processing systems"},{"key":"ref12","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2021.3077461"},{"key":"ref13","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT45174.2021.9518267"},{"key":"ref14","article-title":"A worker-task specialization model for crowdsourcing: Efficient inference and fundamental limits","author":"kim","year":"2021"},{"key":"ref15","doi-asserted-by":"publisher","DOI":"10.1109\/JSAIT.2020.3037170"},{"key":"ref16","article-title":"Error rate bounds and iterative weighted majority voting for crowdsourcing","author":"li","year":"2014"},{"key":"ref17","first-page":"692","article-title":"Variational inference for crowdsourcing","author":"liu","year":"2012","journal-title":"Advances in neural information processing systems"},{"key":"ref18","first-page":"3335","article-title":"Gradient descent for sparse rank-one matrix completion for crowd-sourced aggregation of sparsely interacting workers","author":"ma","year":"2018","journal-title":"Proceedings of the 35th International Conference on Machine Learning"},{"key":"ref19","first-page":"535","article-title":"Optimality of belief propagation for crowdsourced classification","author":"ok","year":"2016","journal-title":"International Conference on Machine Learning"},{"key":"ref4","doi-asserted-by":"publisher","DOI":"10.1109\/ISIT.2018.8437703"},{"key":"ref3","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2014.2346205"},{"key":"ref6","first-page":"20","article-title":"Maximum likelihood estimation of observer error-rates using the em algorithm","volume":"28","author":"dawid","year":"1979","journal-title":"Journal of the Royal Statistical Society Series C (Applied Statistics)"},{"key":"ref5","doi-asserted-by":"publisher","DOI":"10.1145\/2488388.2488414"},{"key":"ref8","article-title":"Minimax optimal convergence rates for estimating ground truth from crowdsourced labels","author":"gao","year":"2013"},{"key":"ref7","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2018.2839677"},{"key":"ref2","doi-asserted-by":"publisher","DOI":"10.1214\/14-AOS1290"},{"key":"ref1","doi-asserted-by":"crossref","first-page":"149","DOI":"10.1214\/17-AOS1545","article-title":"On semidefinite relaxations for the block model","volume":"46","author":"amini","year":"2018","journal-title":"The Annals of Statistics"},{"key":"ref9","doi-asserted-by":"publisher","DOI":"10.1145\/1993574.1993599"},{"key":"ref20","first-page":"1741","article-title":"Reducing crowdsourcing to graphon estimation, statistically","author":"shah","year":"2018","journal-title":"International Conference on Artificial Intelligence and Statistics"},{"key":"ref22","first-page":"1260","article-title":"Spectral methods meet EM: A provably optimal algorithm for crowdsourcing","author":"zhang","year":"2014","journal-title":"Advances in neural information processing systems"},{"key":"ref21","doi-asserted-by":"publisher","DOI":"10.1109\/TIT.2020.3045613"}],"event":{"name":"2022 IEEE International Symposium on Information Theory (ISIT)","location":"Espoo, Finland","start":{"date-parts":[[2022,6,26]]},"end":{"date-parts":[[2022,7,1]]}},"container-title":["2022 IEEE International Symposium on Information Theory (ISIT)"],"original-title":[],"link":[{"URL":"http:\/\/xplorestaging.ieee.org\/ielx7\/9834325\/9834269\/09834403.pdf?arnumber=9834403","content-type":"unspecified","content-version":"vor","intended-application":"similarity-checking"}],"deposited":{"date-parts":[[2026,3,12]],"date-time":"2026-03-12T20:36:26Z","timestamp":1773347786000},"score":1,"resource":{"primary":{"URL":"https:\/\/ieeexplore.ieee.org\/document\/9834403\/"}},"subtitle":[],"short-title":[],"issued":{"date-parts":[[2022,6,26]]},"references-count":22,"URL":"https:\/\/doi.org\/10.1109\/isit50566.2022.9834403","relation":{},"subject":[],"published":{"date-parts":[[2022,6,26]]}}}