{"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/modeling-dynamic-topics-in-chain-free-fashion","title":"Modeling Dynamic Topics in Chain-Free Fashion by Evolution-Tracking Contrastive Learning and Unassociated Word Exclusion","arxiv_id":"2405.17957","date":"2024-05-28","proceeding":null,"authors":["Xiaobao Wu","Xinshuai Dong","Liangming Pan","Thong Nguyen","Anh Tuan Luu"],"abstract":"Dynamic topic models track the evolution of topics in sequential documents, which have derived various applications like trend analysis and opinion mining. However, existing models suffer from repetitive topic and unassociated topic issues, failing to reveal the evolution and hindering further applications. To address these issues, we break the tradition of simply chaining topics in existing work and propose a novel neural \\modelfullname. We introduce a new evolution-tracking contrastive learning method that builds the similarity relations among dynamic topics. This not only tracks topic evolution but also maintains topic diversity, mitigating the repetitive topic issue. To avoid unassociated topics, we further present an unassociated word exclusion method that consistently excludes unassociated words from discovered topics. Extensive experiments demonstrate our model significantly outperforms state-of-the-art baselines, tracking topic evolution with high-quality topics, showing better performance on downstream tasks, and remaining robust to the hyperparameter for evolution intensities. Our code is available at https://github.com/bobxwu/CFDTM .","url_abs":"https://arxiv.org/abs/2405.17957v1","url_pdf":"https://arxiv.org/pdf/2405.17957v1.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":"modeling-dynamic-topics-in-chain-free-fashion","repo_url":"https://github.com/bobxwu/cfdtm","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":{"status":"ok"}},{"paper_slug":"modeling-dynamic-topics-in-chain-free-fashion","repo_url":"https://github.com/bobxwu/topmost","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[{"task_slug":"contrastive-learning","task_name":"Contrastive Learning"},{"task_slug":"diversity","task_name":"Diversity"},{"task_slug":"opinion-mining","task_name":"Opinion Mining"},{"task_slug":"topic-models","task_name":"Topic Models"}],"methods":[{"method_slug":"contrastive-learning","method_name":"Contrastive Learning"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/2405.17957","atlas_url":"https://app.syntology.ai/?focus=2405.17957","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":"2405.17957"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"2405.17957\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"2405.17957"},"call":"get_concepts_for_paper(arxiv_id=\"2405.17957\")"}],"by_repo":[{"repo":"bobxwu/cfdtm","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"bobxwu/topmost","kind":"official","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":5,"harvested_for":["2211.12878","2304.03544","2306.04217","2401.14113","2608.16269"],"harvested_for_calls":[{"arxiv_id":"2211.12878","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2211.12878"},"call":"get_harvested_code_for_paper(arxiv_id=\"2211.12878\")"},{"arxiv_id":"2304.03544","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2304.03544"},"call":"get_harvested_code_for_paper(arxiv_id=\"2304.03544\")"},{"arxiv_id":"2306.04217","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2306.04217"},"call":"get_harvested_code_for_paper(arxiv_id=\"2306.04217\")"},{"arxiv_id":"2401.14113","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2401.14113"},"call":"get_harvested_code_for_paper(arxiv_id=\"2401.14113\")"},{"arxiv_id":"2608.16269","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2608.16269"},"call":"get_harvested_code_for_paper(arxiv_id=\"2608.16269\")"}]}],"by_repo_harvested_for_is":"harvested_for: the arXiv ids (as Syntology's graph holds them) of every paper whose samples Syntology's graph links to this repository, in arXiv-id order, complete; the page names the first 3 and says how many more. A link only: it does not say the papers are the same work, that one copied the other, or that the code implements this paper's method; harvested_for_calls gives the get_harvested_code_for_paper call for each arXiv-shaped id among them","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":"2718351f057a11d75297b6a6904e07ffee1d20a17efda643b56740dc8281e2a1","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}