{"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/guaranteed-inference-in-topic-models","title":"Guaranteed inference in topic models","arxiv_id":"1512.03308","date":"2015-12-10","proceeding":null,"authors":["Khoat Than","Tung Doan"],"abstract":"One of the core problems in statistical models is the estimation of a\nposterior distribution. For topic models, the problem of posterior inference\nfor individual texts is particularly important, especially when dealing with\ndata streams, but is often intractable in the worst case. As a consequence,\nexisting methods for posterior inference are approximate and do not have any\nguarantee on neither quality nor convergence rate. In this paper, we introduce\na provably fast algorithm, namely Online Maximum a Posteriori Estimation (OPE),\nfor posterior inference in topic models. OPE has more attractive properties\nthan existing inference approaches, including theoretical guarantees on quality\nand fast rate of convergence to a local maximal/stationary point of the\ninference problem. The discussions about OPE are very general and hence can be\neasily employed in a wide range of contexts. Finally, we employ OPE to design\nthree methods for learning Latent Dirichlet Allocation from text streams or\nlarge corpora. Extensive experiments demonstrate some superior behaviors of OPE\nand of our new learning methods.","url_abs":"http://arxiv.org/abs/1512.03308v2","url_pdf":"http://arxiv.org/pdf/1512.03308v2.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":"guaranteed-inference-in-topic-models","repo_url":"https://github.com/Khoat/OPE","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":0,"framework":"none","reach":null}],"tasks":[{"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":"Khoat/OPE","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":"c304e9440aa6905a7c3be19f542816163b960d02e3852afd63c873382323da38","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}