{"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":"/method/natural-gradient-descent","slug":"natural-gradient-descent","name":"Natural Gradient Descent","full_name":"Natural Gradient Descent","full_name_withheld":false,"description_markdown":"**Natural Gradient Descent** is an approximate second-order optimisation method. It has an interpretation as optimizing over a Riemannian manifold using an intrinsic distance metric, which implies the updates are invariant to transformations such as whitening. By using the positive semi-definite (PSD) Gauss-Newton matrix to approximate the (possibly negative definite) Hessian, NGD can often work better than exact second-order methods.\r\n\r\nGiven the gradient of $z$, $g = \\frac{\\delta{f}\\left(z\\right)}{\\delta{z}}$, NGD computes the update as:\r\n\r\n$$\\Delta{z} = \\alpha{F}^{−1}g$$\r\n\r\nwhere the Fisher information matrix $F$ is defined as:\r\n\r\n$$ F = \\mathbb{E}\\_{p\\left(t\\mid{z}\\right)}\\left[\\nabla\\ln{p}\\left(t\\mid{z}\\right)\\nabla\\ln{p}\\left(t\\mid{z}\\right)^{T}\\right] $$\r\n\r\nThe log-likelihood function $\\ln{p}\\left(t\\mid{z}\\right)$ typically corresponds to commonly used error functions such as the cross entropy loss.\r\n\r\nSource: [LOGAN](https://paperswithcode.com/method/logan)\r\n\r\nImage: [Fast Convergence of Natural Gradient Descent for Overparameterized Neural Networks\r\n](https://arxiv.org/abs/1905.10961)","description_state":"present","introduced_year":1998,"introduced_by":{"title":null,"paper":null,"first_author":null,"n_authors":0,"url_abs":null,"archive_paper_url":null},"source":{"url":null,"title":null,"url_on_a_paper_host":false},"code_snippet_url":null,"code_snippet_url_on_a_code_host":false,"categories":[{"area":"General","area_id":"general","collection":"Optimization","url":"/methods/category/optimization","pwc_aliases":[]}],"n_papers_tagged":68,"archive_num_papers":null,"papers_newest_first":[{"paper":null,"slug":"improving-energy-natural-gradient-descent","title":"Improving Energy Natural Gradient Descent through Woodbury, Momentum, and Randomization","date":"2025-05-17","arxiv_id":"2505.12149","n_code_links":0,"syntology":null},{"paper":null,"slug":"convergence-properties-of-natural-gradient","title":"Convergence Properties of Natural Gradient Descent for Minimizing KL Divergence","date":"2025-04-27","arxiv_id":"2504.19259","n_code_links":0,"syntology":null},{"paper":"/paper/a-mean-teacher-algorithm-for-unlearning-of","slug":"a-mean-teacher-algorithm-for-unlearning-of","title":"A mean teacher algorithm for unlearning of language models","date":"2025-04-18","arxiv_id":"2504.13388","n_code_links":1,"syntology":null},{"paper":null,"slug":"natural-gradient-descent-for-control","title":"Natural Gradient Descent for Control","date":"2025-03-08","arxiv_id":"2503.06070","n_code_links":0,"syntology":null},{"paper":null,"slug":"guiding-time-varying-generative-models-with","title":"Guiding Time-Varying Generative Models with Natural Gradients on Exponential Family Manifold","date":"2025-02-11","arxiv_id":"2502.07650","n_code_links":0,"syntology":null},{"paper":"/paper/high-accuracy-sampling-from-constrained","slug":"high-accuracy-sampling-from-constrained","title":"High-accuracy sampling from constrained spaces with the Metropolis-adjusted Preconditioned Langevin Algorithm","date":"2024-12-24","arxiv_id":"2412.18701","n_code_links":1,"syntology":{"ran":3,"of":3,"n_ran_checked":3,"n_instrument":0,"unverified":0,"pointer_only":0,"phrase":"3 ran (of which 0 constructed an object rather than computing a result; 3 with no instrument failure: 0 honoured, 0 violated, 3 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["vishwakftw/conspacesampler"],"state":"official (archive's flag): 3 ran","n_ran":3,"n_constructed":0,"n_ran_no_instrument_failure":3,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":"/paper/reconstructing-deep-neural-networks","slug":"reconstructing-deep-neural-networks","title":"Reconstructing Deep Neural Networks: Unleashing the Optimization Potential of Natural Gradient Descent","date":"2024-12-10","arxiv_id":"2412.07441","n_code_links":1,"syntology":null},{"paper":null,"slug":"natural-gradient-and-parameter-estimation-for","title":"Natural gradient and parameter estimation for quantum Boltzmann machines","date":"2024-10-31","arxiv_id":"2410.24058","n_code_links":0,"syntology":null},{"paper":"/paper/a-prescriptive-theory-for-brain-like","slug":"a-prescriptive-theory-for-brain-like","title":"Brain-like variational inference","date":"2024-10-25","arxiv_id":"2410.19315","n_code_links":0,"syntology":{"ran":1,"of":6,"n_ran_checked":1,"n_instrument":0,"unverified":5,"pointer_only":0,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 1 honoured, 0 violated, 0 with no contract checked; 0 where Syntology's instrument failed) · 5 unverified","official":null}},{"paper":null,"slug":"score-based-variational-inference-for-inverse","title":"Score-Based Variational Inference for Inverse Problems","date":"2024-10-08","arxiv_id":"2410.05646","n_code_links":0,"syntology":null},{"paper":null,"slug":"is-all-learning-natural-gradient-descent","title":"Is All Learning (Natural) Gradient Descent?","date":"2024-09-24","arxiv_id":"2409.16422","n_code_links":0,"syntology":null},{"paper":"/paper/ngd-converges-to-less-degenerate-solutions","slug":"ngd-converges-to-less-degenerate-solutions","title":"NGD converges to less degenerate solutions than SGD","date":"2024-09-07","arxiv_id":"2409.04913","n_code_links":1,"syntology":null},{"paper":null,"slug":"decentralised-gradient-based-variational","title":"Decentralised Variational Inference Frameworks for Multi-object Tracking on Sensor Networks: Additional Notes","date":"2024-08-24","arxiv_id":"2408.13689","n_code_links":0,"syntology":null},{"paper":null,"slug":"2408-00573","title":"Convergence Analysis of Natural Gradient Descent for Over-parameterized Physics-Informed Neural Networks","date":"2024-08-01","arxiv_id":"2408.00573","n_code_links":0,"syntology":null},{"paper":"/paper/quantum-natural-stochastic-pairwise","slug":"quantum-natural-stochastic-pairwise","title":"Quantum Natural Stochastic Pairwise Coordinate Descent","date":"2024-07-18","arxiv_id":"2407.13858","n_code_links":1,"syntology":null},{"paper":"/paper/correlations-are-ruining-your-gradient","slug":"correlations-are-ruining-your-gradient","title":"Correlations Are Ruining Your Gradient Descent","date":"2024-07-15","arxiv_id":"2407.10780","n_code_links":1,"syntology":null},{"paper":null,"slug":"faster-machine-unlearning-via-natural","title":"Faster Machine Unlearning via Natural Gradient Descent","date":"2024-07-11","arxiv_id":"2407.08169","n_code_links":0,"syntology":null},{"paper":null,"slug":"an-improved-empirical-fisher-approximation","title":"An Improved Empirical Fisher Approximation for Natural Gradient Descent","date":"2024-06-10","arxiv_id":"2406.06420","n_code_links":0,"syntology":null},{"paper":"/paper/bayesian-online-natural-gradient-bong","slug":"bayesian-online-natural-gradient-bong","title":"Bayesian Online Natural Gradient (BONG)","date":"2024-05-30","arxiv_id":"2405.19681","n_code_links":1,"syntology":{"ran":9,"of":9,"n_ran_checked":6,"n_instrument":3,"unverified":0,"pointer_only":0,"phrase":"9 ran (of which 0 constructed an object rather than computing a result; 6 with no instrument failure: 0 honoured, 0 violated, 6 with no contract checked; 3 where Syntology's instrument failed) · 0 unverified","official":{"repos":["petergchang/bong"],"state":"official (archive's flag): 9 ran","n_ran":9,"n_constructed":0,"n_ran_no_instrument_failure":6,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"thermodynamic-natural-gradient-descent","title":"Thermodynamic Natural Gradient Descent","date":"2024-05-22","arxiv_id":"2405.13817","n_code_links":0,"syntology":null},{"paper":"/paper/fadam-adam-is-a-natural-gradient-optimizer","slug":"fadam-adam-is-a-natural-gradient-optimizer","title":"FAdam: Adam is a natural gradient optimizer using diagonal empirical Fisher information","date":"2024-05-21","arxiv_id":"2405.12807","n_code_links":1,"syntology":null},{"paper":null,"slug":"sequential-in-time-training-of-nonlinear","title":"Sequential-in-time training of nonlinear parametrizations for solving time-dependent partial differential equations","date":"2024-04-01","arxiv_id":"2404.01145","n_code_links":0,"syntology":null},{"paper":null,"slug":"inverse-free-fast-natural-gradient-descent","title":"Inverse-Free Fast Natural Gradient Descent Method for Deep Learning","date":"2024-03-06","arxiv_id":"2403.03473","n_code_links":0,"syntology":null},{"paper":null,"slug":"sofim-stochastic-optimization-using","title":"SOFIM: Stochastic Optimization Using Regularized Fisher Information Matrix","date":"2024-03-05","arxiv_id":"2403.02833","n_code_links":0,"syntology":null},{"paper":"/paper/a-kaczmarz-inspired-approach-to-accelerate","slug":"a-kaczmarz-inspired-approach-to-accelerate","title":"A Kaczmarz-inspired approach to accelerate the optimization of neural network wavefunctions","date":"2024-01-18","arxiv_id":"2401.10190","n_code_links":1,"syntology":null},{"paper":"/paper/structured-inverse-free-natural-gradient","slug":"structured-inverse-free-natural-gradient","title":"Structured Inverse-Free Natural Gradient: Memory-Efficient & Numerically-Stable KFAC","date":"2023-12-09","arxiv_id":"2312.05705","n_code_links":2,"syntology":{"ran":1,"of":1,"n_ran_checked":1,"n_instrument":0,"unverified":0,"pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 1 with no instrument failure: 0 honoured, 0 violated, 1 with no contract checked; 0 where Syntology's instrument failed) · 0 unverified","official":{"repos":["f-dangel/singd"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":1,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"efficient-numerical-algorithm-for-large-scale","title":"Efficient Numerical Algorithm for Large-Scale Damped Natural Gradient Descent","date":"2023-10-26","arxiv_id":"2310.17556","n_code_links":0,"syntology":null},{"paper":null,"slug":"modify-training-directions-in-function-space","title":"Modify Training Directions in Function Space to Reduce Generalization Error","date":"2023-07-25","arxiv_id":"2307.13290","n_code_links":0,"syntology":null},{"paper":"/paper/analysis-and-comparison-of-two-level-kfac","slug":"analysis-and-comparison-of-two-level-kfac","title":"Analysis and Comparison of Two-Level KFAC Methods for Training Deep Neural Networks","date":"2023-03-31","arxiv_id":"2303.18083","n_code_links":1,"syntology":null},{"paper":null,"slug":"decentralized-riemannian-natural-gradient","title":"Decentralized Riemannian natural gradient methods with Kronecker-product approximations","date":"2023-03-16","arxiv_id":"2303.09611","n_code_links":0,"syntology":null},{"paper":null,"slug":"optimizing-quantum-federated-learning-based","title":"Optimizing Quantum Federated Learning Based on Federated Quantum Natural Gradient Descent","date":"2023-02-27","arxiv_id":"2303.08116","n_code_links":0,"syntology":null},{"paper":"/paper/achieving-high-accuracy-with-pinns-via-energy","slug":"achieving-high-accuracy-with-pinns-via-energy","title":"Achieving High Accuracy with PINNs via Energy Natural Gradients","date":"2023-02-25","arxiv_id":"2302.13163","n_code_links":1,"syntology":null},{"paper":"/paper/fast-and-painless-image-reconstruction-in","slug":"fast-and-painless-image-reconstruction-in","title":"Image Reconstruction via Deep Image Prior Subspaces","date":"2023-02-20","arxiv_id":"2302.10279","n_code_links":1,"syntology":null},{"paper":null,"slug":"auditing-algorithmic-fairness-in-machine","title":"Auditing Algorithmic Fairness in Machine Learning for Health with Severity-Based LOGAN","date":"2022-11-16","arxiv_id":"2211.08742","n_code_links":0,"syntology":null},{"paper":null,"slug":"component-wise-natural-gradient-descent-an","title":"Component-Wise Natural Gradient Descent -- An Efficient Neural Network Optimization","date":"2022-10-11","arxiv_id":"2210.05268","n_code_links":0,"syntology":null},{"paper":null,"slug":"conjugate-natural-selection","title":"Conjugate Natural Selection","date":"2022-08-29","arxiv_id":"2208.13898","n_code_links":0,"syntology":null},{"paper":null,"slug":"federated-quantum-natural-gradient-descent","title":"Federated Quantum Natural Gradient Descent for Quantum Federated Learning","date":"2022-08-15","arxiv_id":"2209.00564","n_code_links":0,"syntology":null},{"paper":null,"slug":"qsan-a-near-term-achievable-quantum-self","title":"QSAN: A Near-term Achievable Quantum Self-Attention Network","date":"2022-07-14","arxiv_id":"2207.07563","n_code_links":0,"syntology":null},{"paper":null,"slug":"the-galactic-3d-large-scale-dust-distribution","title":"The Galactic 3D large-scale dust distribution via Gaussian process regression on spherical coordinates","date":"2022-04-25","arxiv_id":"2204.11715","n_code_links":0,"syntology":null},{"paper":null,"slug":"amortized-proximal-optimization","title":"Amortized Proximal Optimization","date":"2022-02-28","arxiv_id":"2203.00089","n_code_links":0,"syntology":null},{"paper":null,"slug":"efficient-natural-gradient-descent-methods","title":"Efficient Natural Gradient Descent Methods for Large-Scale PDE-Based Optimization Problems","date":"2022-02-13","arxiv_id":"2202.06236","n_code_links":0,"syntology":null},{"paper":"/paper/efficient-approximations-of-the-fisher-matrix","slug":"efficient-approximations-of-the-fisher-matrix","title":"Efficient Approximations of the Fisher Matrix in Neural Networks using Kronecker Product Singular Value Decomposition","date":"2022-01-25","arxiv_id":"2201.10285","n_code_links":1,"syntology":null},{"paper":null,"slug":"depth-without-the-magic-inductive-bias-of-1","title":"Depth Without the Magic: Inductive Bias of Natural Gradient Descent","date":"2021-11-22","arxiv_id":"2111.11542","n_code_links":0,"syntology":null},{"paper":null,"slug":"predprop-bidirectional-stochastic","title":"PredProp: Bidirectional Stochastic Optimization with Precision Weighted Predictive Coding","date":"2021-11-16","arxiv_id":"2111.08792","n_code_links":0,"syntology":null},{"paper":null,"slug":"predictive-coding-precision-and-natural","title":"Predictive coding, precision and natural gradients","date":"2021-11-12","arxiv_id":"2111.06942","n_code_links":0,"syntology":null},{"paper":null,"slug":"variational-inference-at-glacier-scale","title":"Variational Inference at Glacier Scale","date":"2021-08-16","arxiv_id":"2108.07263","n_code_links":0,"syntology":null},{"paper":null,"slug":"sinogram-denoise-based-on-generative","title":"Sinogram Denoise Based on Generative Adversarial Networks","date":"2021-08-09","arxiv_id":"2108.03903","n_code_links":0,"syntology":null},{"paper":null,"slug":"rayleigh-gauss-newton-optimization-with","title":"Rayleigh-Gauss-Newton optimization with enhanced sampling for variational Monte Carlo","date":"2021-06-19","arxiv_id":"2106.10558","n_code_links":0,"syntology":null},{"paper":null,"slug":"direct-reconstruction-of-linear-parametric","title":"Direct Reconstruction of Linear Parametric Images from Dynamic PET Using Nonlocal Deep Image Prior","date":"2021-06-18","arxiv_id":"2106.10359","n_code_links":0,"syntology":null},{"paper":"/paper/tengrad-time-efficient-natural-gradient","slug":"tengrad-time-efficient-natural-gradient","title":"TENGraD: Time-Efficient Natural Gradient Descent with Exact Fisher-Block Inversion","date":"2021-06-07","arxiv_id":"2106.03947","n_code_links":1,"syntology":null},{"paper":null,"slug":"thor-trace-based-hardware-adaptive-layer","title":"THOR, Trace-based Hardware-adaptive layer-ORiented Natural Gradient Descent Computation","date":"2021-05-18","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":null,"slug":"quantum-machine-learning-for-power-system","title":"Noise-Resilient Quantum Machine Learning for Stability Assessment of Power Systems","date":"2021-04-10","arxiv_id":"2104.04855","n_code_links":0,"syntology":null},{"paper":null,"slug":"moment-based-variational-inference-for","title":"Moment-Based Variational Inference for Stochastic Differential Equations","date":"2021-03-01","arxiv_id":"2103.00988","n_code_links":0,"syntology":null},{"paper":null,"slug":"optimizing-quantized-neural-networks-with","title":"Optimizing Quantized Neural Networks with Natural Gradient","date":"2021-01-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":"/paper/two-level-k-fac-preconditioning-for-deep","slug":"two-level-k-fac-preconditioning-for-deep","title":"Two-Level K-FAC Preconditioning for Deep Learning","date":"2020-11-01","arxiv_id":"2011.00573","n_code_links":1,"syntology":null},{"paper":"/paper/logan-local-group-bias-detection-by","slug":"logan-local-group-bias-detection-by","title":"LOGAN: Local Group Bias Detection by Clustering","date":"2020-10-06","arxiv_id":"2010.02867","n_code_links":1,"syntology":null},{"paper":null,"slug":"allpass-feedback-delay-networks","title":"Allpass Feedback Delay Networks","date":"2020-07-14","arxiv_id":"2007.07337","n_code_links":0,"syntology":null},{"paper":null,"slug":"when-does-preconditioning-help-or-hurt","title":"When Does Preconditioning Help or Hurt Generalization?","date":"2020-06-18","arxiv_id":"2006.10732","n_code_links":0,"syntology":null},{"paper":null,"slug":"mirrorless-mirror-descent-a-more-natural","title":"Mirrorless Mirror Descent: A Natural Derivation of Mirror Descent","date":"2020-04-02","arxiv_id":"2004.01025","n_code_links":0,"syntology":null},{"paper":"/paper/towards-query-efficient-black-box-adversary","slug":"towards-query-efficient-black-box-adversary","title":"Towards Query-Efficient Black-Box Adversary with Zeroth-Order Natural Gradient Descent","date":"2020-02-18","arxiv_id":"2002.07891","n_code_links":1,"syntology":{"ran":0,"of":1,"n_ran_checked":0,"n_instrument":0,"unverified":1,"pointer_only":1,"phrase":"0 ran · 1 unverified","official":{"repos":["LinLabNEU/ZO_NGD_blackbox"],"state":"official: harvested, nothing ran","n_ran":0,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":1,"ran_from_kinds":[]}}},{"paper":"/paper/scalable-and-practical-natural-gradient-for","slug":"scalable-and-practical-natural-gradient-for","title":"Scalable and Practical Natural Gradient for Large-Scale Deep Learning","date":"2020-02-13","arxiv_id":"2002.06015","n_code_links":1,"syntology":{"ran":1,"of":1,"n_ran_checked":0,"n_instrument":1,"unverified":0,"pointer_only":1,"phrase":"1 ran (of which 0 constructed an object rather than computing a result; 0 with no instrument failure: 0 honoured, 0 violated, 0 with no contract checked; 1 where Syntology's instrument failed) · 0 unverified","official":{"repos":["tyohei/chainerkfac"],"state":"official (archive's flag): 1 ran","n_ran":1,"n_constructed":0,"n_ran_no_instrument_failure":0,"n_unverified":0,"ran_from_kinds":["official"]}}},{"paper":null,"slug":"multivariate-gaussian-variational-inference","title":"Multivariate Gaussian Variational Inference by Natural Gradient Descent","date":"2020-01-27","arxiv_id":"2001.10025","n_code_links":0,"syntology":null},{"paper":null,"slug":"dual-stochastic-natural-gradient-descent","title":"Dual Stochastic Natural Gradient Descent and convergence of interior half-space gradient approximations","date":"2020-01-19","arxiv_id":"2001.06744","n_code_links":0,"syntology":null},{"paper":null,"slug":"higher-order-algorithms-for-nonlinearly","title":"Implicit Regularization and Momentum Algorithms in Nonlinearly Parameterized Adaptive Control and Prediction","date":"2019-12-31","arxiv_id":"1912.13154","n_code_links":0,"syntology":null},{"paper":"/paper/logan-latent-optimisation-for-generative-1","slug":"logan-latent-optimisation-for-generative-1","title":"LOGAN: Latent Optimisation for Generative Adversarial Networks","date":"2019-12-02","arxiv_id":"1912.00953","n_code_links":1,"syntology":{"ran":5,"of":8,"n_ran_checked":2,"n_instrument":3,"unverified":3,"pointer_only":2,"phrase":"5 ran (of which 0 constructed an object rather than computing a result; 2 with no instrument failure: 0 honoured, 1 violated, 1 with no contract checked; 3 where Syntology's instrument failed) · 3 unverified","official":null}},{"paper":null,"slug":"fast-convergence-of-natural-gradient-descent-1","title":"Fast Convergence of Natural Gradient Descent for Over-Parameterized Neural Networks","date":"2019-12-01","arxiv_id":null,"n_code_links":0,"syntology":null},{"paper":"/paper/quantum-natural-gradient","slug":"quantum-natural-gradient","title":"Quantum Natural Gradient","date":"2019-09-04","arxiv_id":"1909.02108","n_code_links":2,"syntology":null},{"paper":null,"slug":"hopfield-neural-network-flow-a-geometric","title":"Hopfield Neural Network Flow: A Geometric Viewpoint","date":"2019-08-04","arxiv_id":"1908.01270","n_code_links":0,"syntology":null}],"papers_shown":68,"papers_order":"date (newest first), then slug","paper_counts":{"archive_papers_tagged":68,"with_a_code_link":21,"where_syntology_ran_a_sample":6,"not_listed_spam_title":0,"listed":68,"listed_where_code_ran":6,"where_syntology_ran_a_sample_split":{"with_a_run_with_no_instrument_failure":5,"every_run_a_failure_of_syntologys_instrument":1,"listed_with_a_run_with_no_instrument_failure":5,"listed_every_run_a_failure_of_syntologys_instrument":1,"filter":{"states":["a run with no instrument failure","any run, instrument failures included"],"default":"a run with no instrument failure","note":"on the 'only where code ran' pages the default hides, in the browser, the rows where every run was a failure of Syntology's instrument; the second state shows them again. Rows are hidden, never re-ordered; these twins list every row"}},"definition":"distinct papers the archive tags; 'where Syntology ran a sample' counts papers with at least one harvested sample that ran, which is not a correctness claim"},"papers_where_code_ran":6,"papers_where_code_ran_first_page":"/method/natural-gradient-descent/papers/ran/1","papers_where_code_ran_caption":"We ran code from the paper's repository; we did not isolate this method inside it.","pages":[{"order":"ran","page":1,"of":1,"url":"/method/natural-gradient-descent/papers/ran/1","json":"/method/natural-gradient-descent/papers/ran/1.json","rows":6}],"tasks":[{"task":"/task/variational-inference","name":"Variational Inference","papers":8},{"task":"/task/image-classification","name":"Image Classification","papers":7},{"task":"/task/image-classification","name":"image-classification","papers":7},{"task":"/task/second-order-methods","name":"Second-order methods","papers":5},{"task":"/task/computational-efficiency","name":"Computational Efficiency","papers":4},{"task":"/task/deep-learning","name":"Deep Learning","papers":3},{"task":"/task/quantum-machine-learning","name":"Quantum Machine Learning","papers":3},{"task":"/task/stochastic-optimization","name":"Stochastic Optimization","papers":3},{"task":"/task/variational-monte-carlo","name":"Variational Monte Carlo","papers":3},{"task":"/task/machine-learning","name":"BIG-bench Machine Learning","papers":2},{"task":"/task/bayesian-inference","name":"Bayesian Inference","papers":2},{"task":"/task/bias-detection","name":"Bias Detection","papers":2},{"task":"/task/clustering","name":"Clustering","papers":2},{"task":"/task/federated-learning","name":"Federated Learning","papers":2},{"task":"/task/image-reconstruction","name":"Image Reconstruction","papers":2},{"task":"/task/language-modeling","name":"Language Modeling","papers":2},{"task":"/task/language-modelling","name":"Language Modelling","papers":2},{"task":"/task/regression-1","name":"regression","papers":2},{"task":"/task/3d-reconstruction","name":"3D Reconstruction","papers":1},{"task":"/task/adversarial-attack","name":"Adversarial Attack","papers":1}],"tasks_shown":20,"n_tasks":51,"usage_by_year":[{"year":"2019","papers":5},{"year":"2020","papers":9},{"year":"2021","papers":12},{"year":"2022","papers":9},{"year":"2023","papers":8},{"year":"2024","papers":20},{"year":"2025","papers":5}],"row_source":"embedded","archive":{"source":"pwc-archive (Hugging Face), CC BY-SA 4.0","snapshot":"2025-07-28","archive_url":"https://paperswithcode.com/method/natural-gradient-descent"},"syntology_read_at":"2026-10-05T00:36:11+00:00","syntology":{"source":"Syntology's have check for this name (the free coverage lookup), read from Syntology's graph","have_url":"https://syntology.ai/api/graph/have?x=Natural%20Gradient%20Descent","read_at":"2026-10-05T00:59:31+00:00","query":"Natural Gradient Descent","kind":"method","have":"unknown_name","tier":null,"verified_implementation":null,"level":null,"level_meaning":"the served verification level, per answer; never summed across methods","resolved_to":null,"resolution":null,"resolved_name_differs":false,"absence_asserted":false,"absence_unchecked":null,"no_code_is_about_this_method":false,"subject":null,"archive_paper_arxiv_id":null,"repositories":null,"retrieve_with":null,"name_competition":{"verdict":"none","may_be_wrong_sense":false,"bearers_found":0,"served":null,"leading_other_bearer":null,"n_other_bearers_listed":0,"note":"Nothing in this corpus is named 'Natural Gradient Descent' -- no method node, no paper announcing it in its title, no expanded form declaring it as an acronym."},"name_competition_text":null,"near_matches":["natural Riemannian gradient descent","Natural Hypergradient Descent (NHGD)","GAUSS-NEWTON NATURAL GRADIENT DESCENT","natural gradient descent with momentum","Tractable Structured Natural-Gradient Descent","Zeroth-Order Natural Gradient Descent (ZO-NGD)","Energy Manifold Natural Gradient Descent (EMNGD)","Natural Gradient Descent for Online Continual Learning"],"code_nearby":[],"code_nearby_caption":null,"origin_paper":null,"line":"name not resolved (unknown_name). The lookup matched no method, paper or venue by this name; that asserts nothing about whether code exists.","level_legend":null},"syntology_have_state":"loaded","record_sha256":"f6f2fc70038952af74f92b2fa72b65f52c5ce06255b302284d3c541722e7063d","record_changed_at":"2026-10-05","record_changed_at_basis":"changed"}