arXiv · 2611.06722
Technical Report: Partially Asynchronous Distributed Optimization on Riemannian Manifolds
Abstract
There is a large body of work on distributed optimization for problems in Euclidean space. However, many existing algorithms and analyses do not directly transfer to problems defined on manifolds. Therefore, in this paper we propose a distributed asynchronous optimization algorithm for problems on Riemannian manifolds. The algorithm we develop is a parallelized form of Riemannian block coordinate descent in which all agents can compute and communicate asynchronously. We assume only "partial asynchrony", namely that all delays in computations and communications obey some finite bound, and we omit the common assumptions of convexity of the objective and compactness of the manifold. Under mild conditions, we prove that agents' iterates drive the Riemannian gradient of the objective to zero, and we derive a rate of convergence for the norm of the gradient. In simulations, we compare to a synchronous baseline algorithm under varying communication delays and numbers of agents. In example problems, we empirically show that our algorithm converges up to 8.5 times faster and attains up to 24 times lower suboptimality over a finite horizon.
Explore related subjects
Keep this discovery
Explore connections, maps & timelines
Adam Pooley, William Warke, Matthew T. Hale. 2026-11-08. Technical Report: Partially Asynchronous Distributed Optimization on Riemannian Manifolds. https://searcharxiv.com/abs/2611.06722
Citations retain the original authors and DOI and include this site’s record URL. If this discovery service contributed to your research, you can also cite Searcharxiv by Indiciae: BibTeX · RIS.