{"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/dense-distributions-from-sparse-samples","title":"Dense Distributions from Sparse Samples: Improved Gibbs Sampling Parameter Estimators for LDA","arxiv_id":"1505.02065","date":"2015-05-08","proceeding":null,"authors":["Yannis Papanikolaou","James R. Foulds","Timothy N. Rubin","Grigorios Tsoumakas"],"abstract":"We introduce a novel approach for estimating Latent Dirichlet Allocation\n(LDA) parameters from collapsed Gibbs samples (CGS), by leveraging the full\nconditional distributions over the latent variable assignments to efficiently\naverage over multiple samples, for little more computational cost than drawing\na single additional collapsed Gibbs sample. Our approach can be understood as\nadapting the soft clustering methodology of Collapsed Variational Bayes (CVB0)\nto CGS parameter estimation, in order to get the best of both techniques. Our\nestimators can straightforwardly be applied to the output of any existing\nimplementation of CGS, including modern accelerated variants. We perform\nextensive empirical comparisons of our estimators with those of standard\ncollapsed inference algorithms on real-world data for both unsupervised LDA and\nPrior-LDA, a supervised variant of LDA for multi-label classification. Our\nresults show a consistent advantage of our approach over traditional CGS under\nall experimental conditions, and over CVB0 inference in the majority of\nconditions. More broadly, our results highlight the importance of averaging\nover multiple samples in LDA parameter estimation, and the use of efficient\ncomputational techniques to do so.","url_abs":"http://arxiv.org/abs/1505.02065v6","url_pdf":"http://arxiv.org/pdf/1505.02065v6.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":"dense-distributions-from-sparse-samples","repo_url":"https://github.com/ypapanik/cgs_p","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"task_slug":"clustering","task_name":"Clustering"},{"task_slug":"multi-label-classification-2","task_name":"MUlTI-LABEL-ClASSIFICATION"},{"task_slug":"multi-label-classification","task_name":"Multi-Label Classification"},{"task_slug":"parameter-estimation","task_name":"parameter estimation"}],"methods":[{"method_slug":"lda","method_name":"LDA"}],"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":"ypapanik/cgs_p","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":"ba4758803b534ce8a53c6dce9ceaa63dbef61bbddafe5b4d89f901e0523c9f9b","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}