Pith. sign in

REVIEW 2 cited by

Accelerated Natural Gradient Method for Parametric Manifold Optimization

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2504.05753 v1 pith:VLPIS7LO submitted 2025-04-08 math.OC

classification math.OC
keywords acceleratedangdflowgradientmanifoldupdatevariousapproximation
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
abstract

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 $H^s$, 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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. A Sketch-and-Project Analysis of Subsampled Natural Gradient Algorithms

    cs.LG 2025-08 conditional novelty 6.0 of 10

    For linear least squares, SNGD and SPRING are proved equivalent to accelerated regularized Kaczmarz methods, yielding the first fast rates and first SPRING guarantee; the general quadratic analysis holds under strong ...

  2. Accelerating Optimization via Differentiable Stopping Time

    cs.LG 2025-05 conditional novelty 5.0 of 10

    A discrete stopping-time sensitivity defined from an ODE discretization approximates the continuous hitting-time gradient with O(h) error, enabling gradient-based optimization of iteration counts.

Pith tools