Inversion-Free Natural Gradient Descent on Riemannian Manifolds
Dario Draca, Takuo Matsubara, Minh-Ngoc Tran

TL;DR
This paper introduces an inversion-free stochastic natural gradient method on Riemannian manifolds, enabling efficient optimization of probability distributions with manifold-structured parameters.
Contribution
It develops an intrinsic, inversion-free natural gradient algorithm that maintains an online approximation of the inverse Fisher information matrix on Riemannian manifolds.
Findings
Proves convergence rates of the proposed method with respect to the squared distance to the minimizer.
Establishes convergence rates for the approximate Fisher information matrix with transport-based errors.
Demonstrates the method's effectiveness on variational Bayes and normalizing flows.
Abstract
The natural gradient method is widely used in statistical optimization, but its standard formulation assumes a Euclidean parameter space. This paper proposes an inversion-free stochastic natural gradient method for probability distributions whose parameters lie on a Riemannian manifold. The manifold setting offers several advantages: one can implicitly enforce parameter constraints such as positive definiteness and orthogonality, ensure parameters are identifiable, or guarantee regularity properties of the objective like geodesic convexity. Building on an intrinsic formulation of the Fisher information matrix (FIM) on a manifold, our method maintains an online approximation of the inverse FIM, which is efficiently updated at quadratic cost using score vectors sampled at successive iterates. In the Riemannian setting, these score vectors belong to different tangent spaces and must be…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
