{"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/large-scale-stochastic-sampling-from-the","title":"Large-Scale Stochastic Sampling from the Probability Simplex","arxiv_id":"1806.07137","date":"2018-06-19","proceeding":"NeurIPS 2018 12","authors":["Jack Baker","Paul Fearnhead","Emily B. Fox","Christopher Nemeth"],"abstract":"Stochastic gradient Markov chain Monte Carlo (SGMCMC) has become a popular\nmethod for scalable Bayesian inference. These methods are based on sampling a\ndiscrete-time approximation to a continuous time process, such as the Langevin\ndiffusion. When applied to distributions defined on a constrained space the\ntime-discretization error can dominate when we are near the boundary of the\nspace. We demonstrate that because of this, current SGMCMC methods for the\nsimplex struggle with sparse simplex spaces; when many of the components are\nclose to zero. Unfortunately, many popular large-scale Bayesian models, such as\nnetwork or topic models, require inference on sparse simplex spaces. To avoid\nthe biases caused by this discretization error, we propose the stochastic\nCox-Ingersoll-Ross process (SCIR), which removes all discretization error and\nwe prove that samples from the SCIR process are asymptotically unbiased. We\ndiscuss how this idea can be extended to target other constrained spaces. Use\nof the SCIR process within a SGMCMC algorithm is shown to give substantially\nbetter performance for a topic model and a Dirichlet process mixture model than\nexisting SGMCMC approaches.","url_abs":"http://arxiv.org/abs/1806.07137v2","url_pdf":"http://arxiv.org/pdf/1806.07137v2.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":"large-scale-stochastic-sampling-from-the","repo_url":"https://github.com/jbaker92/scir","is_official":1,"mentioned_in_paper":1,"mentioned_in_github":1,"framework":"none","reach":null}],"tasks":[{"task_slug":"bayesian-inference","task_name":"Bayesian Inference"},{"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":"jbaker92/scir","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":"80ce7d7206e25d553a9a2f4ad6186fda15ef455cd1dff90d35d55ed406f3eafb","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}