{"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/scaling-up-dynamic-topic-models","title":"Scaling up Dynamic Topic Models","arxiv_id":"1602.06049","date":"2016-02-19","proceeding":null,"authors":["Arnab Bhadury","Jianfei Chen","Jun Zhu","Shixia Liu"],"abstract":"Dynamic topic models (DTMs) are very effective in discovering topics and\ncapturing their evolution trends in time series data. To do posterior inference\nof DTMs, existing methods are all batch algorithms that scan the full dataset\nbefore each update of the model and make inexact variational approximations\nwith mean-field assumptions. Due to a lack of a more scalable inference\nalgorithm, despite the usefulness, DTMs have not captured large topic dynamics.\n  This paper fills this research void, and presents a fast and parallelizable\ninference algorithm using Gibbs Sampling with Stochastic Gradient Langevin\nDynamics that does not make any unwarranted assumptions. We also present a\nMetropolis-Hastings based $O(1)$ sampler for topic assignments for each word\ntoken. In a distributed environment, our algorithm requires very little\ncommunication between workers during sampling (almost embarrassingly parallel)\nand scales up to large-scale applications. We are able to learn the largest\nDynamic Topic Model to our knowledge, and learned the dynamics of 1,000 topics\nfrom 2.6 million documents in less than half an hour, and our empirical results\nshow that our algorithm is not only orders of magnitude faster than the\nbaselines but also achieves lower perplexity.","url_abs":"http://arxiv.org/abs/1602.06049v1","url_pdf":"http://arxiv.org/pdf/1602.06049v1.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":"scaling-up-dynamic-topic-models","repo_url":"https://github.com/alexismailov2/FastDTM","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"time-series-1","task_name":"Time Series"},{"task_slug":"time-series","task_name":"Time Series Analysis"},{"task_slug":"topic-models","task_name":"Topic Models"}],"methods":[],"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":"alexismailov2/FastDTM","kind":"listed","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":"10865b4b7fd717577ac5635d27474f46e066ed34c159d025e8765d26769586f0","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}