{"about":{"non_affiliation":"Code with Papers and Syntology are not affiliated with, endorsed by, or sponsored by Papers with Code, Meta, or the pwc-archive mirror.","site":"https://codewithpapers.app","licence":"CC BY-SA 4.0","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","attribution":"https://codewithpapers.app/attribution","modified":"archive material modified by Syntology; see the attribution page","syntology":{"site":"https://syntology.ai","developers":"https://syntology.ai/developers","mcp":{"server":"https://syntology.ai/mcp","transport":"streamable-http","server_card":"https://syntology.ai/.well-known/mcp/server-card.json","auth":{"type":"trial token, no account","trial_token":"https://syntology.ai/api/oauth/trial/token","method":"POST","docs":"https://syntology.ai/developers"}},"have":"https://syntology.ai/api/graph/have?x=<method, arXiv id or title> (free, answers coverage only)","paper_base":"https://syntology.ai/paper/","atlas_base":"https://app.syntology.ai/?focus="},"machine_readable":[{"url":"https://codewithpapers.app/llms.txt","what":"the machine catalog: every machine-readable file, counted"},{"url":"https://codewithpapers.app/index/manifest.json","what":"paper-to-code index by arXiv id, with Syntology's counts"},{"url":"https://codewithpapers.app/search/manifest.json","what":"site search index (titles, authors) and its files"},{"url":"https://codewithpapers.app/download","what":"bulk files: Syntology's layer, described there"},{"url":"https://codewithpapers.app/build_manifest.json","what":"the build record: inputs, counts, exclusions, probes"}]},"url":"/paper/analysis-of-minimax-error-rate-for","title":"Analysis of Minimax Error Rate for Crowdsourcing and Its Application to Worker Clustering Model","arxiv_id":"1802.04551","date":"2018-02-13","proceeding":"ICML 2018 7","authors":["Hideaki Imamura","Issei Sato","Masashi Sugiyama"],"abstract":"While crowdsourcing has become an important means to label data, there is\ngreat interest in estimating the ground truth from unreliable labels produced\nby crowdworkers. The Dawid and Skene (DS) model is one of the most well-known\nmodels in the study of crowdsourcing. Despite its practical popularity,\ntheoretical error analysis for the DS model has been conducted only under\nrestrictive assumptions on class priors, confusion matrices, or the number of\nlabels each worker provides. In this paper, we derive a minimax error rate\nunder more practical setting for a broader class of crowdsourcing models\nincluding the DS model as a special case. We further propose the worker\nclustering model, which is more practical than the DS model under real\ncrowdsourcing settings. The wide applicability of our theoretical analysis\nallows us to immediately investigate the behavior of this proposed model, which\ncan not be analyzed by existing studies. Experimental results showed that there\nis a strong similarity between the lower bound of the minimax error rate\nderived by our theoretical analysis and the empirical error of the estimated\nvalue.","url_abs":"http://arxiv.org/abs/1802.04551v2","url_pdf":"http://arxiv.org/pdf/1802.04551v2.pdf","source":{"archive":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","licence_url":"https://creativecommons.org/licenses/by-sa/4.0/legalcode","row_kind":"abstracts"},"code_links":[{"paper_slug":"analysis-of-minimax-error-rate-for","repo_url":"https://github.com/HideakiImamura/MinimaxErrorRate","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"clustering","task_name":"Clustering"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1802.04551","atlas_url":"https://app.syntology.ai/?focus=1802.04551","mcp":null,"developers":"https://syntology.ai/developers","held":true,"reason":"arxiv_id_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"agent_calls":[{"tool":"get_citation_path","arguments":{"paper_1":"1802.04551"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1802.04551\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1802.04551"},"call":"get_concepts_for_paper(arxiv_id=\"1802.04551\")"}],"by_repo":[{"repo":"HideakiImamura/MinimaxErrorRate","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0}],"by_repo_is":"one row per repository in the archive's code links, Syntology's graph links or the samples; samples 0 means no sample is linked to this paper, a statement about Syntology's coverage, not about the repository: with harvested_for_other_papers present, Syntology harvested the repository for that many other papers, and without it, Syntology harvested nothing from it; placed_by_identical_code counts samples whose link records no repository, placed here because identical code was harvested from this repository for another paper; ran counts executions on a synthesized input and instrument counts failures of Syntology's instrument, not of the code"},"code_links_note":null,"arxiv_metadata":null,"syntology_extracted_results":null,"record_sha256":"ea0c8bab79fed5a55ab6861defd25b1c04bee71d676f29b3765d623fee02d7ce","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}