Overview

Natural gradient methods study how to use the geometry of a model’s probability distributions, commonly represented by the Fisher information matrix, to choose updates that are less dependent on parameterization. They matter when ordinary gradients are poorly scaled or constrained, including neural-network training, policy optimization in reinforcement learning, variational inference, and optimization on manifolds. Approaches range from exact Fisher-based updates to Kronecker-factored, low-rank, and matrix-free approximations, alongside Riemannian methods and convergence analyses for policy learning and other structured problems. A central tension is that curvature-aware updates can improve convergence, but estimating and applying them can be costly or noisy, and useful step sizes and reliable scaling remain challenging.

Latest papers

CardsList

29 papers4 papers in the last four weeks, against 2 the four weeks before. 0.0% of all new papers.

  1. How Inefficient Is Natural Gradient Descent? From Exact Optimality to Θ( \sqrt{ \log d } ) Divergence

    Oct 5, 2026Guni Sharon, Alan KuhnleInformation GeometryRiemannian Optimization

  2. Optimizer Geometry Sets the Pace: Spectral Learning Dynamics in Matrix Factorization

    Oct 3, 2026Mahalakshmi Sabanayagam, Simon LuceyGradient Descent DynamicsSpectral Bias

  3. The cost of useful natural gradient updates

    Sep 27, 2026Subhransu S. Bhattacharjee, Dylan Campbell, Rahul ShomeSample ComplexityNatural Gradient Methods

  4. Newton Matching for Generative Modeling: A Unified Framework for Fine-Tuning and Sampling

    Sep 4, 2026Zeyang Li, Yunan Wang, Paolo Giaretta +1Generative ModelingRL for Generative Models

  5. Integer Natural Evolution Strategies

    Aug 24, 2026Jacob de Nobel, Diederick Vermetten, Hao Wang +3Evolution StrategiesNatural Gradient Methods

  6. Unregularized Convergence of Single-Loop, Entropy-Regularized Natural Actor-Critic

    Aug 20, 2026Zhiqiang TanPolicy OptimizationActor-Critic Methods

  7. Efficient Hypergradient Descent for Inverse Reinforcement Learning

    Aug 11, 2026Nikita Sevriukov, Anna Barabanova, Uliana Gagarina +4Reinforcement LearningGradient Descent

  8. Fisher8: Stabilizing Neural Heteroscedastic Regression via Output-Layer Fisher Geometry

    Aug 11, 2026Sumedh Vemuganti, Nickvash KaniNatural Gradient MethodsHeteroscedastic Regression

  9. Information-Geometric Forward Policy Training in GFlowNets

    Aug 4, 2026Yordan Raykov, Rodrigo VeigaInformation GeometryNatural Gradient Methods

  10. Finite-Time Analysis of the Natural Policy Gradient in Finite-Horizon Markov Decision Processes

    Jul 25, 2026Asha Barua, Sajad KhodadadianPolicy GradientMarkov Decision Processes

  11. Energy Manifold Natural Gradient Descent: Riemannian Optimization for Neural PDE Solvers

    Jul 24, 2026Zhangyong Liang, Huanhuan GaoNeural PDE SolversRiemannian Optimization

  12. Differentially Private Natural Gradient Descent

    Jul 7, 2026Pan Li, Kai Chen, Shuai Chang +3Gradient DescentNatural Gradient Methods

  13. On the Optimizer Dependence of Neural Scaling Laws

    May 28, 2026Vansh Ramani, Shourya Vir JainNatural Gradient MethodsNeural Network Optimization

  14. Adaptive Stochastic Natural Gradient Method for Safe Optimization on Binary Space

    May 18, 2026Kento Uchida, Ryoki Hamano, Masahiro Nomura +1Black-Box OptimizationNatural Gradient Methods

  15. Natural Policy Gradient as Doubly Smoothed Policy Iteration: A Bellman-Operator Framework

    May 11, 2026Phalguni Nanda, Zaiwei ChenPolicy GradientReinforcement Learning

  16. Natural gradient descent with momentum

    Apr 16, 2026Anthony Nouy, Agustín SomacalDeep Learning OptimizationRiemannian Optimization

  17. Natural Gradient Gaussian Approximation Filter on Lie Groups for Robot State Estimation

    Apr 11, 2026Tianyi Zhang, Wenhan Cao, Chang Liu +2Robot State EstimationBayesian Filtering

  18. Natural Riemannian gradient for learning functional tensor networks

    Apr 10, 2026Nikolas Klug, Michael Ulbrich, André Uschmajew +1Tensor NetworksRiemannian Optimization

  19. Curvature-Aware Optimization for High-Accuracy Physics-Informed Neural Networks

    Apr 6, 2026Anas Jnini, Elham Kiyani, Khemraj Shukla +5Physics-Informed MLNeural PDE Solvers

  20. Inversion-Free Natural Gradient Descent on Riemannian Manifolds

    Apr 3, 2026Dario Draca, Takuo Matsubara, Minh-Ngoc TranNatural Gradient MethodsRiemannian Optimization

  21. Sven: Singular Value Descent as a Computationally Efficient Natural Gradient Method

    Apr 1, 2026Samuel Bright-Thonney, Thomas R. Harvey, Andre Lukas +1Deep Learning OptimizationNatural Gradient Methods

  22. Inverse-Free Sparse Variational Gaussian Processes

    Apr 1, 2026Stefano Cortinovis, Laurence Aitchison, Stefanos Eleftheriadis +1Sparse Gaussian ProcessesGaussian Processes

  23. Natural Gradient Descent for Online Continual Learning

    Mar 21, 2026Joe Khawand, David ColliauxKronecker-Factored ApproximationOnline Continual Learning

  24. Riemannian Optimization in Modular Systems

    Mar 4, 2026Christian Pehle, Jean-Jacques SlotineContraction TheoryRiemannian Optimization

  25. TENG-BC: Unified Time-Evolving Natural Gradient for Neural PDE Solvers with General Boundary Conditions

    Feb 28, 2026Hongjie Jiang, Di LuoNeural PDE SolversPDE Solving

  26. Fisher-Rao Gradient Flows of Linear Programs and State-Action Natural Policy Gradients

    Mar 28, 2024Johannes Müller, Semih Çaycı, Guido MontúfarPolicy GradientOptimization Convergence Analysis