{"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/a-deep-learning-approach-to-unsupervised","title":"A Deep Learning Approach to Unsupervised Ensemble Learning","arxiv_id":"1602.02285","date":"2016-02-06","proceeding":null,"authors":["Uri Shaham","Xiuyuan Cheng","Omer Dror","Ariel Jaffe","Boaz Nadler","Joseph Chang","Yuval Kluger"],"abstract":"We show how deep learning methods can be applied in the context of\ncrowdsourcing and unsupervised ensemble learning. First, we prove that the\npopular model of Dawid and Skene, which assumes that all classifiers are\nconditionally independent, is {\\em equivalent} to a Restricted Boltzmann\nMachine (RBM) with a single hidden node. Hence, under this model, the posterior\nprobabilities of the true labels can be instead estimated via a trained RBM.\nNext, to address the more general case, where classifiers may strongly violate\nthe conditional independence assumption, we propose to apply RBM-based Deep\nNeural Net (DNN). Experimental results on various simulated and real-world\ndatasets demonstrate that our proposed DNN approach outperforms other\nstate-of-the-art methods, in particular when the data violates the conditional\nindependence assumption.","url_abs":"http://arxiv.org/abs/1602.02285v1","url_pdf":"http://arxiv.org/pdf/1602.02285v1.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":"a-deep-learning-approach-to-unsupervised","repo_url":"https://github.com/ushaham/RBMpaper","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"deep-learning","task_name":"Deep Learning"},{"task_slug":"ensemble-learning","task_name":"Ensemble Learning"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1602.02285","atlas_url":"https://app.syntology.ai/?focus=1602.02285","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":"1602.02285"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1602.02285\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1602.02285"},"call":"get_concepts_for_paper(arxiv_id=\"1602.02285\")"}],"by_repo":[{"repo":"ushaham/RBMpaper","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":"111688cff257ffdf39c23fa32dc721b7268003ece87959bf107e8e7045be7045","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}