A Variational Formulation of Accelerated Optimization on Riemannian Manifolds
Valentin Duruisseaux, Melvin Leok

TL;DR
This paper extends variational accelerated optimization methods to Riemannian manifolds, achieving arbitrary convergence rates and proposing a framework for efficient, geometry-preserving algorithms.
Contribution
It generalizes variational accelerated optimization to Riemannian manifolds using time-dependent Bregman Lagrangian and Hamiltonian systems, enabling arbitrary convergence rates.
Findings
Achieved accelerated convergence rates on Riemannian manifolds.
Established a time-invariance property for Riemannian Bregman systems.
Proposed a framework for geometry-preserving optimization algorithms.
Abstract
It was shown recently by Su et al. (2016) that Nesterov's accelerated gradient method for minimizing a smooth convex function can be thought of as the time discretization of a second-order ODE, and that converges to its optimal value at a rate of along any trajectory of this ODE. A variational formulation was introduced in Wibisono et al. (2016) which allowed for accelerated convergence at a rate of , for arbitrary , in normed vector spaces. This framework was exploited in Duruisseaux et al. (2021) to design efficient explicit algorithms for symplectic accelerated optimization. In Alimisis et al. (2020), a second-order ODE was proposed as the continuous-time limit of a Riemannian accelerated algorithm, and it was shown that the objective function converges to its optimal value at a rate of …
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
TopicsMathematical Biology Tumor Growth · Advanced Optimization Algorithms Research · Stochastic Gradient Optimization Techniques
