|
|
|
|
LEADER |
01611 am a22001573u 4500 |
001 |
143783.2 |
042 |
|
|
|a dc
|
100 |
1 |
0 |
|a Weber, Melanie
|e author
|
700 |
1 |
0 |
|a Sra, Suvrit
|e author
|
245 |
0 |
0 |
|a Riemannian Optimization via Frank-Wolfe Methods
|
260 |
|
|
|b Springer Science and Business Media LLC,
|c 2022-07-18T15:51:41Z.
|
856 |
|
|
|z Get fulltext
|u https://hdl.handle.net/1721.1/143783.2
|
520 |
|
|
|a Abstract We study projection-free methods for constrained Riemannian optimization. In particular, we propose a Riemannian Frank-Wolfe (RFW) method that handles constraints directly, in contrast to prior methods that rely on (potentially costly) projections. We analyze non-asymptotic convergence rates of RFW to an optimum for geodesically convex problems, and to a critical point for nonconvex objectives. We also present a practical setting under which RFW can attain a linear convergence rate. As a concrete example, we specialize RFW to the manifold of positive definite matrices and apply it to two tasks: (i) computing the matrix geometric mean (Riemannian centroid); and (ii) computing the Bures-Wasserstein barycenter. Both tasks involve geodesically convex interval constraints, for which we show that the Riemannian "linear" oracle required by RFW admits a closed form solution; this result may be of independent interest. We complement our theoretical results with an empirical comparison of RFW against state-of-the-art Riemannian optimization methods, and observe that RFW performs competitively on the task of computing Riemannian centroids.
|
546 |
|
|
|a en
|
655 |
7 |
|
|a Article
|
773 |
|
|
|t Mathematical Programming
|