atlas

Research map / Optimization / Nonconvex and smooth optimization

Accelerated Gradient Methods for Geodesically Convex Optimization: Tractable Algorithms and Convergence Analysis

ICML 2022 · Optimization › Nonconvex and smooth optimization · approach: Acceleration and Nesterov dynamics · 0 citations (OpenAlex)

Read the paperCheck your idea against 108,967 papers

AI-extracted summary. Written by AI from the paper's title only (no summary yet). Numbers and claims can be wrong or missing context, so check the paper before you cite or build on it.

Measured effects reported in the paper

What was changedWhereMeasuredEffect
Use Riemannian NAG-style momentum (RNAG-C) instead of Riemannian gradient descentRayleigh quotient maximization on sphere · Rayleigh quotient maximization (d=1000)objective gap convergenceHelped
Use RNAG-SC instead of Riemannian gradient descent on strongly convex Karcher meanKarcher mean of SPD matrices · Karcher mean SPD (d=100, n=50)objective gap convergenceHelped
Use RNAG-C on well-conditioned g-strongly convex Karcher mean problemKarcher mean of SPD matrices · Karcher mean SPD (d=100, n=50)objective gap convergenceNo clear effect
Set xi = zeta + 3(zeta - delta) in RNAG-C (friction/metric-distortion correction)RNAG-C · theory: g-convexiteration complexity O(xi sqrt(L/eps))No clear effect

Closest papers by meaning

Writing a paper in this area? scime draft is a free LaTeX editor with AI included, real-time co-authors and a check of your references and venue rules before you submit. It also imports OpenAI Prism projects.

Open scime draft

Get the next scime Dispatch and a monthly field update

Free. We send a confirmation link first; every email has a one-click unsubscribe. Privacy