{"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/automatic-differentiation-variational","title":"Automatic Differentiation Variational Inference","arxiv_id":"1603.00788","date":"2016-03-02","proceeding":null,"authors":["Alp Kucukelbir","Dustin Tran","Rajesh Ranganath","Andrew Gelman","David M. Blei"],"abstract":"Probabilistic modeling is iterative. A scientist posits a simple model, fits\nit to her data, refines it according to her analysis, and repeats. However,\nfitting complex models to large data is a bottleneck in this process. Deriving\nalgorithms for new models can be both mathematically and computationally\nchallenging, which makes it difficult to efficiently cycle through the steps.\nTo this end, we develop automatic differentiation variational inference (ADVI).\nUsing our method, the scientist only provides a probabilistic model and a\ndataset, nothing else. ADVI automatically derives an efficient variational\ninference algorithm, freeing the scientist to refine and explore many models.\nADVI supports a broad class of models-no conjugacy assumptions are required. We\nstudy ADVI across ten different models and apply it to a dataset with millions\nof observations. ADVI is integrated into Stan, a probabilistic programming\nsystem; it is available for immediate use.","url_abs":"http://arxiv.org/abs/1603.00788v1","url_pdf":"http://arxiv.org/pdf/1603.00788v1.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":"automatic-differentiation-variational","repo_url":"https://github.com/JulienNonin/auto-diff-variational-inference","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok"}},{"paper_slug":"automatic-differentiation-variational","repo_url":"https://github.com/TuringLang/Bijectors.jl","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"automatic-differentiation-variational","repo_url":"https://github.com/UnofficialJuliaMirrorSnapshots/Bijectors.jl-76274a88-744f-5084-9051-94815aaf08c4","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"MIT"}},{"paper_slug":"automatic-differentiation-variational","repo_url":"https://github.com/modichirag/gsm-vi","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"jax","reach":{"status":"ok","spdx":"MIT"}}],"tasks":[{"task_slug":"probabilistic-programming","task_name":"Probabilistic Programming"},{"task_slug":"variational-inference","task_name":"Variational Inference"}],"methods":[],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1603.00788","atlas_url":"https://app.syntology.ai/?focus=1603.00788","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":"1603.00788"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1603.00788\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1603.00788"},"call":"get_concepts_for_paper(arxiv_id=\"1603.00788\")"}],"by_repo":[{"repo":"JulienNonin/auto-diff-variational-inference","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"TuringLang/Bijectors.jl","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"UnofficialJuliaMirrorSnapshots/Bijectors.jl-76274a88-744f-5084-9051-94815aaf08c4","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"modichirag/gsm-vi","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":2,"harvested_for":["2307.07849","2402.14758"],"harvested_for_calls":[{"arxiv_id":"2307.07849","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2307.07849"},"call":"get_harvested_code_for_paper(arxiv_id=\"2307.07849\")"},{"arxiv_id":"2402.14758","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"2402.14758"},"call":"get_harvested_code_for_paper(arxiv_id=\"2402.14758\")"}]}],"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":"3c3d11f1015ec5aa0e38b07b63b1f5cf89bbaa86855a85d07dcd9a4e23aed95a","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}