{"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/sparse-partially-collapsed-mcmc-for-parallel","title":"Sparse Partially Collapsed MCMC for Parallel Inference in Topic Models","arxiv_id":"1506.03784","date":"2015-06-11","proceeding":null,"authors":["Måns Magnusson","Leif Jonsson","Mattias Villani","David Broman"],"abstract":"Topic models, and more specifically the class of Latent Dirichlet Allocation\n(LDA), are widely used for probabilistic modeling of text. MCMC sampling from\nthe posterior distribution is typically performed using a collapsed Gibbs\nsampler. We propose a parallel sparse partially collapsed Gibbs sampler and\ncompare its speed and efficiency to state-of-the-art samplers for topic models\non five well-known text corpora of differing sizes and properties. In\nparticular, we propose and compare two different strategies for sampling the\nparameter block with latent topic indicators. The experiments show that the\nincrease in statistical inefficiency from only partial collapsing is smaller\nthan commonly assumed, and can be more than compensated by the speedup from\nparallelization and sparsity on larger corpora. We also prove that the\npartially collapsed samplers scale well with the size of the corpus. The\nproposed algorithm is fast, efficient, exact, and can be used in more modeling\nsituations than the ordinary collapsed sampler.","url_abs":"http://arxiv.org/abs/1506.03784v3","url_pdf":"http://arxiv.org/pdf/1506.03784v3.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":"sparse-partially-collapsed-mcmc-for-parallel","repo_url":"https://github.com/lejon/PartiallyCollapsedLDA","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"tf","reach":null}],"tasks":[{"task_slug":"topic-models","task_name":"Topic Models"}],"methods":[{"method_slug":"speed","method_name":"SPEED"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":null,"atlas_url":null,"mcp":null,"developers":"https://syntology.ai/developers","held":null,"reason":"arxiv_id_not_in_atlas","checked_against":{"atlas_ids":549449,"atlas_ids_sha256":"afd72399dafd9906e9062927f70655952385a3d75488558e1f0484e950ab09b7","read_at":"2026-10-05T01:46:21Z"},"by_repo":[{"repo":"lejon/PartiallyCollapsedLDA","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":"a18f43cb49b47a4aa01b8b147cc2ddafb34ada0a56a82457d50b73871726c52d","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}