Accelerated Natural Gradient Method for Parametric Manifold Optimization
Not on the map. Why?
Abstract (arXiv)
Parametric manifold optimization problems frequently arise in various machine learning tasks, where state functions are defined on infinite-dimensional manifolds. We propose a unified accelerated natural gradient descent (ANGD) framework to address these problems. By incorporating a Hessian-driven damping term into the manifold update, we derive an accelerated Riemannian gradient (ARG) flow that mitigates oscillations. An equivalent first-order system is further presented for the ARG flow, enabling a unified discretization scheme that leads to the ANGD method. In our discrete update, our framework considers various advanced techniques, including least squares approximation of the update direction, projected momentum to accelerate convergence, and efficient approximation methods through the Kronecker product. It accommodates various metrics, including Hs, Fisher-Rao, and Wasserstein-2 metrics, providing a computationally efficient solution for large-scale parameter spaces. We establish a convergence rate for the ARG flow under geodesic convexity assumptions. Numerical experiments demonstrate that ANGD outperforms standard NGD, underscoring its effectiveness across diverse deep learning tasks.
Key facts. Cited by 3 papers in the map (data through 14 Oct 2026). First posted on arXiv 8 Apr 2025.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2025: 2; 2026: 1.
3 papers.
- 2025A Sketch-and-Project Analysis of Subsampled Natural Gradient Algorithmscited by 2
- 2026Natural gradient descent with momentumcited by 2
- 2025Accelerating Optimization via Differentiable Stopping Timecited by 1
- 2026Natural gradient descent with momentum16 Apr 2026
- 2025A Sketch-and-Project Analysis of Subsampled Natural Gradient Algorithms28 Aug 2025
- 2025Accelerating Optimization via Differentiable Stopping Time28 May 2025