Name
Abstract | ||
|---|---|---|
We develop a new Riemannian descent algorithm that relies on momentum to improve over existing first-order methods for geodesically convex optimization. In contrast, accelerated convergence rates proved in prior work have only been shown to hold for geodesically strongly-convex objective functions. We further extend our algorithm to geodesically weakly-quasi-convex objectives. Our proofs of convergence rely on a novel estimate sequence that illustrates the dependency of the convergence rate on the curvature of the manifold. We validate our theoretical results empirically on several optimization problems defined on the sphere and on the manifold of positive definite matrices. |
Year | Venue | Keywords |
|---|---|---|
2021 | 24TH INTERNATIONAL CONFERENCE ON ARTIFICIAL INTELLIGENCE AND STATISTICS (AISTATS) | Manifold,Convex optimization,Rate of convergence,Curvature,Optimization problem,Convergence (routing),Positive-definite matrix,Matrix (mathematics),Applied mathematics,Mathematics |
DocType | Volume | ISSN |
Conference | 130 | 2640-3498 |
Citations | PageRank | References |
0 | 0.34 | 0 |
Authors | ||
4 | ||
Name | Order | Citations | PageRank |
|---|---|---|---|
| Foivos Alimisis | 1 | 0 | 0.34 |
| Orvieto, Antonio | 2 | 0 | 3.04 |
| Gary Bécigneul | 3 | 25 | 2.77 |
| Aurelien Lucchi | 4 | 2419 | 89.45 |