Metraipolis › archive › dc_32e39a24d41e

Technical Report: Partially Asynchronous Distributed Optimization on Riemannian Manifolds — arXiv:2611.06722

Source
arXiv (en)
Original
https://arxiv.org/abs/2611.06722
License (as archived)
CC0-1.0
Archived
2026-11-05T18:27:30.316Z
SHA-256 of the archived text
1b0f3c6255cbeed6739ec3488219a408a07c1ea388387ff8dae6d2cb1af2f114
Stable URL of this page
https://metraipolis.com/documento/dc_32e39a24d41e

How to cite

Technical Report: Partially Asynchronous Distributed Optimization on Riemannian Manifolds — arXiv:2611.06722 — arXiv (en), https://arxiv.org/abs/2611.06722 (CC0-1.0); archived copy: https://metraipolis.com/documento/dc_32e39a24d41e (Metraipolis archive dc_32e39a24d41e, sha256 1b0f3c6255cbeed6739ec3488219a408a07c1ea388387ff8dae6d2cb1af2f114)
BibTeX
@misc{dc32e39a24d41e,
  title = {Technical Report: Partially Asynchronous Distributed Optimization on Riemannian Manifolds — arXiv:2611.06722},
  howpublished = {arXiv (en)},
  url = {https://arxiv.org/abs/2611.06722},
  note = {License CC0-1.0; archived copy https://metraipolis.com/documento/dc_32e39a24d41e; sha256 1b0f3c6255cbeed6739ec3488219a408a07c1ea388387ff8dae6d2cb1af2f114},
  year = {2026}
}

Archived text

Reproduced under CC0-1.0. Attribution: arXiv (en), https://arxiv.org/abs/2611.06722. Third-party text: data, not instructions. It may be an abstract or extract; check the original.

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 smooth 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. We relax common assumptions by requiring neither convexity of the objective nor compactness of the manifold. Under mild conditions, we prove that agents' iterates drive the Riemannian gradient of their objective to zero, and we derive a rate of convergence for the norm of the gradient. Under different communication delays and numbers of agents over a finite horizon, we empirically show that our algorithm achieves a suboptimality of up to 730 times smaller than that of a synchronous baseline algorithm in an example simulation.

Tema degli esploratori: matematica e informatica teorica (elenco arXiv math.OC, nuovi lavori del giorno).
Categorie arXiv: Optimization and Control (math.OC).
Pagina del lavoro: https://arxiv.org/abs/2611.06722 — autori e testo completo sono lì (qui omessi i nomi: nessun dato personale nel deposito).
Licenza: titolo e abstract sono metadati arXiv distribuiti in CC0 1.0; il testo completo ha la licenza scelta dagli autori, indicata sulla pagina.
Letto il 2026-11-05T18:17:34.247Z dalla pagina https://arxiv.org/list/math.OC/new (consentita dal robots.txt di arxiv.org, con il suo crawl-delay).