{"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/noisy-natural-gradient-as-variational","title":"Noisy Natural Gradient as Variational Inference","arxiv_id":"1712.02390","date":"2017-12-06","proceeding":"ICML 2018 7","authors":["Guodong Zhang","Shengyang Sun","David Duvenaud","Roger Grosse"],"abstract":"Variational Bayesian neural nets combine the flexibility of deep learning\nwith Bayesian uncertainty estimation. Unfortunately, there is a tradeoff\nbetween cheap but simple variational families (e.g.~fully factorized) or\nexpensive and complicated inference procedures. We show that natural gradient\nascent with adaptive weight noise implicitly fits a variational posterior to\nmaximize the evidence lower bound (ELBO). This insight allows us to train\nfull-covariance, fully factorized, or matrix-variate Gaussian variational\nposteriors using noisy versions of natural gradient, Adam, and K-FAC,\nrespectively, making it possible to scale up to modern-size ConvNets. On\nstandard regression benchmarks, our noisy K-FAC algorithm makes better\npredictions and matches Hamiltonian Monte Carlo's predictive variances better\nthan existing methods. Its improved uncertainty estimates lead to more\nefficient exploration in active learning, and intrinsic motivation for\nreinforcement learning.","url_abs":"http://arxiv.org/abs/1712.02390v2","url_pdf":"http://arxiv.org/pdf/1712.02390v2.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":"noisy-natural-gradient-as-variational","repo_url":"https://github.com/gd-zhang/noisy-K-FAC","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":null},{"paper_slug":"noisy-natural-gradient-as-variational","repo_url":"https://github.com/minfanzhang/noisy-K-FAC_added_flipout","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"tf","reach":{"status":"unanswered"}}],"tasks":[{"task_slug":"active-learning","task_name":"Active Learning"},{"task_slug":"efficient-exploration","task_name":"Efficient Exploration"},{"task_slug":"reinforcement-learning","task_name":"Reinforcement Learning"},{"task_slug":"reinforcement-learning-1","task_name":"Reinforcement Learning (RL)"},{"task_slug":"variational-inference","task_name":"Variational Inference"}],"methods":[{"method_slug":"adam","method_name":"Adam"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1712.02390","atlas_url":"https://app.syntology.ai/?focus=1712.02390","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":"1712.02390"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1712.02390\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1712.02390"},"call":"get_concepts_for_paper(arxiv_id=\"1712.02390\")"}],"by_repo":[{"repo":"gd-zhang/noisy-K-FAC","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1503.05671"],"harvested_for_calls":[{"arxiv_id":"1503.05671","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1503.05671"},"call":"get_harvested_code_for_paper(arxiv_id=\"1503.05671\")"}]},{"repo":"minfanzhang/noisy-K-FAC_added_flipout","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0}],"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":"d49ba30d6d674629d7a2bf280bb87ce814190719275d50706defeffff0b3e765","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}