{"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/new-insights-and-perspectives-on-the-natural","title":"New insights and perspectives on the natural gradient method","arxiv_id":"1412.1193","date":"2014-12-03","proceeding":null,"authors":["James Martens"],"abstract":"Natural gradient descent is an optimization method traditionally motivated\nfrom the perspective of information geometry, and works well for many\napplications as an alternative to stochastic gradient descent. In this paper we\ncritically analyze this method and its properties, and show how it can be\nviewed as a type of approximate 2nd-order optimization method, where the Fisher\ninformation matrix can be viewed as an approximation of the Hessian. This\nperspective turns out to have significant implications for how to design a\npractical and robust version of the method. Additionally, we make the following\ncontributions to the understanding of natural gradient and 2nd-order methods: a\nthorough analysis of the convergence speed of stochastic natural gradient\ndescent (and more general stochastic 2nd-order methods) as applied to convex\nquadratics, a critical examination of the oft-used \"empirical\" approximation of\nthe Fisher matrix, and an analysis of the (approximate) parameterization\ninvariance property possessed by natural gradient methods, which we show still\nholds for certain choices of the curvature matrix other than the Fisher, but\nnotably not the Hessian.","url_abs":"http://arxiv.org/abs/1412.1193v9","url_pdf":"http://arxiv.org/pdf/1412.1193v9.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":"new-insights-and-perspectives-on-the-natural","repo_url":"https://github.com/lantonov/Optimisation","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"none","reach":{"status":"ok","spdx":"GPL-3.0"}},{"paper_slug":"new-insights-and-perspectives-on-the-natural","repo_url":"https://github.com/lixilinx/psgd_torch","is_official":0,"mentioned_in_paper":0,"mentioned_in_github":1,"framework":"pytorch","reach":null}],"tasks":[],"methods":[{"method_slug":"speed","method_name":"SPEED"}],"datasets_introduced":[],"methods_introduced":[],"results":[],"syntology":{"syntology_url":"https://syntology.ai/paper/1412.1193","atlas_url":"https://app.syntology.ai/?focus=1412.1193","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":"1412.1193"},"arguments_in":{"paper_2":"another paper's arXiv id or title"},"call":"get_citation_path(paper_1=\"1412.1193\", paper_2=\"…\")"},{"tool":"get_concepts_for_paper","arguments":{"arxiv_id":"1412.1193"},"call":"get_concepts_for_paper(arxiv_id=\"1412.1193\")"}],"by_repo":[{"repo":"lantonov/Optimisation","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0},{"repo":"lixilinx/psgd_torch","kind":"listed","samples":0,"ran":0,"instrument":0,"unverified":0,"harvested_for_other_papers":1,"harvested_for":["1512.04202"],"harvested_for_calls":[{"arxiv_id":"1512.04202","tool":"get_harvested_code_for_paper","arguments":{"arxiv_id":"1512.04202"},"call":"get_harvested_code_for_paper(arxiv_id=\"1512.04202\")"}]}],"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":"eab01c031c510e7182dfadcdcc52b39749e3fc4bc8335571aa6eaa7b8b4e7517","record_changed_at":"2026-09-28","record_changed_at_basis":"first_hashed"}