{"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/sgmcmc-an-r-package-for-stochastic-gradient","title":"sgmcmc: An R Package for Stochastic Gradient Markov Chain Monte Carlo","arxiv_id":"1710.00578","date":"2017-10-02","proceeding":null,"authors":["Jack Baker","Paul Fearnhead","Emily B. Fox","Christopher Nemeth"],"abstract":"This paper introduces the R package sgmcmc; which can be used for Bayesian\ninference on problems with large datasets using stochastic gradient Markov\nchain Monte Carlo (SGMCMC). Traditional Markov chain Monte Carlo (MCMC)\nmethods, such as Metropolis-Hastings, are known to run prohibitively slowly as\nthe dataset size increases. SGMCMC solves this issue by only using a subset of\ndata at each iteration. SGMCMC requires calculating gradients of the log\nlikelihood and log priors, which can be time consuming and error prone to\nperform by hand. The sgmcmc package calculates these gradients itself using\nautomatic differentiation, making the implementation of these methods much\neasier. To do this, the package uses the software library TensorFlow, which has\na variety of statistical distributions and mathematical operations as standard,\nmeaning a wide class of models can be built using this framework. SGMCMC has\nbecome widely adopted in the machine learning literature, but less so in the\nstatistics community. We believe this may be partly due to lack of software;\nthis package aims to bridge this gap.","url_abs":"http://arxiv.org/abs/1710.00578v3","url_pdf":"http://arxiv.org/pdf/1710.00578v3.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":"sgmcmc-an-r-package-for-stochastic-gradient","repo_url":"https://github.com/chris-nemeth/sgmcmc-review-paper","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"ok","spdx":"GPL-3.0"}}],"tasks":[{"task_slug":"bayesian-inference","task_name":"Bayesian Inference"}],"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":"chris-nemeth/sgmcmc-review-paper","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":"a71bfeba4afa5f35663115404c9c288fa9343ce77d40353739b5775d073822ec","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}