{"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/stochastic-gradient-descent-as-approximate","title":"Stochastic Gradient Descent as Approximate Bayesian Inference","arxiv_id":"1704.04289","date":"2017-04-13","proceeding":null,"authors":["Stephan Mandt","Matthew D. Hoffman","David M. Blei"],"abstract":"Stochastic Gradient Descent with a constant learning rate (constant SGD)\nsimulates a Markov chain with a stationary distribution. With this perspective,\nwe derive several new results. (1) We show that constant SGD can be used as an\napproximate Bayesian posterior inference algorithm. Specifically, we show how\nto adjust the tuning parameters of constant SGD to best match the stationary\ndistribution to a posterior, minimizing the Kullback-Leibler divergence between\nthese two distributions. (2) We demonstrate that constant SGD gives rise to a\nnew variational EM algorithm that optimizes hyperparameters in complex\nprobabilistic models. (3) We also propose SGD with momentum for sampling and\nshow how to adjust the damping coefficient accordingly. (4) We analyze MCMC\nalgorithms. For Langevin Dynamics and Stochastic Gradient Fisher Scoring, we\nquantify the approximation errors due to finite learning rates. Finally (5), we\nuse the stochastic process perspective to give a short proof of why Polyak\naveraging is optimal. Based on this idea, we propose a scalable approximate\nMCMC algorithm, the Averaged Stochastic Gradient Sampler.","url_abs":"http://arxiv.org/abs/1704.04289v2","url_pdf":"http://arxiv.org/pdf/1704.04289v2.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":"stochastic-gradient-descent-as-approximate","repo_url":"https://github.com/taohu88/BayesianML","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"unanswered"}}],"tasks":[{"task_slug":"bayesian-inference","task_name":"Bayesian Inference"}],"methods":[{"method_slug":"sgd","method_name":"SGD"},{"method_slug":"sgd-with-momentum","method_name":"SGD with Momentum"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1704.04289","atlas_url":"https://app.syntology.ai/?focus=1704.04289","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":"1704.04289"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1704.04289\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1704.04289"},"call":"get_concepts_for_paper(arxiv_id=\"1704.04289\")"}],"by_repo":[{"repo":"taohu88/BayesianML","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":"c4677d2a545489e4fd384fad3c792071b9f267bc4bb8d3098651e7fa847621f5","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}