Riemannian Consensus for Manifolds With Bounded Curvature

@article{Tron2013RiemannianCF,
  title={Riemannian Consensus for Manifolds With Bounded Curvature},
  author={Roberto Tron and Bijan Afsari and Ren{\'e} Vidal},
  journal={IEEE Transactions on Automatic Control},
  year={2013},
  volume={58},
  pages={921-934}
}
Consensus algorithms are popular distributed algorithms for computing aggregate quantities, such as averages, in ad-hoc wireless networks. However, existing algorithms mostly address the case where the measurements lie in Euclidean space. In this work we propose Riemannian consensus, a natural extension of existing averaging consensus algorithms to the case of Riemannian manifolds. Unlike previous generalizations, our algorithm is intrinsic and, in principle, can be applied to any complete… 
Finite-time consensus on strongly convex balls of Riemannian manifolds with switching directed communication topologies
Abstract It is known that a consensus problem on any connected complete Riemannian manifold can be transformed into the one on its strongly convex balls via the compression–decompression along
Random Pairwise Gossip on CAT(k) Metric Spaces
TLDR
It turns out, convergence can be guaranteed as soon as the data lie in a small enough ball of a mere CAT(k) metric space, and linear rates of convergence are established.
Consensus on compact Riemannian manifolds
TLDR
A local consensus protocol is provided for connected compact Riemannian manifolds, where communication network can be directed and dynamically switching and a global consensus algorithm is proposed for such manifolds.
Riemannian stochastic variance reduced gradient on Grassmann manifold
TLDR
This paper proposes a novel Riemannian extension of the Euclidean stochastic variance reduced gradient algorithm (R-SVRG) to a compact manifold search space and shows the developments on the Grassmann manifold.
On the Local Linear Rate of Consensus on the Stiefel Manifold
TLDR
This work proposes Distributed Riemannian Consensus on Stiefel Manifold (DRCS) and proves that it enjoys a local linear convergence rate to global consensus, which is the first work showing the equality of the two rates.
Decentralized Riemannian Gradient Descent on the Stiefel Manifold
TLDR
DRGTA is the first decentralized algorithm with exact convergence for distributed optimization on Stiefel manifold and uses multi-step consensus to preserve the iteration in the local consensus region.
Stochastic Derivative-Free Optimization on Riemannian manifolds
We study optimization problems over Riemannian manifolds using Stochastic Derivative-Free Optimization (SDFO) algorithms. Riemannian adaptations of SDFO in the literature use search information
Distributed Optimization on Riemannian Manifolds for multi-agent networks
  • S. Shah
  • Mathematics, Computer Science
  • 2017
TLDR
This work considers the consensual distributed optimization problem in the Riemannian context and proposes an algorithm, which is a direct generalization of the Euclidean case, to solve the problem.
A Topological Obstruction to Almost Global Synchronization on Riemannian Manifolds
Multi-agent systems on nonlinear spaces sometimes fail to synchronize. This is usually attributed to the initial configuration of the agents being too spread out, the graph topology having certain
Synchronization of diffusively coupled systems on compact Riemannian manifolds in the presence of drift
TLDR
The main result is that the synchronization manifold is asymptotically stable even for drift vector fields which are only locally Lipschitz continuous, as long as the algebraic connectivity of the underlying graph is sufficiently large.
...
1
2
3
4
5
...

References

SHOWING 1-10 OF 31 REFERENCES
Average consensus on Riemannian manifolds with bounded curvature
TLDR
This paper proposes distributed algorithms for averaging measurements lying in a Riemannian manifold and obtains a distributed algorithm that converges to the Fréchet mean of the measurements.
Distributed optimization on manifolds for consensus algorithms and camera network localization
TLDR
This thesis proposes an extension of an existing class of distributed coordination algorithms, called consensus algorithms, to the case where the data lies on a Riemannian manifold with bounded curvature, and develops general theoretical tools for designing and analyzing distributed optimization on manifolds.
Consensus Optimization on Manifolds
TLDR
The present paper considers distributed consensus algorithms that involve $N$ agents evolving on a connected compact homogeneous manifold, introduced here as the induced arithmetic mean, that is easily computable in closed form and may be of independent interest for a number of manifolds.
Convex Functions and Optimization Methods on Riemannian Manifolds
Preface. 1. Metric properties of Riemannian manifolds. 2. First and second variations of the p-energy of a curve. 3. Convex functions on Riemannian manifolds. 4. Geometric examples of convex
The Geometry of Algorithms with Orthogonality Constraints
TLDR
The theory proposed here provides a taxonomy for numerical linear algebra algorithms that provide a top level mathematical view of previously unrelated algorithms and developers of new algorithms and perturbation theories will benefit from the theory.
Riemannian Lp center of mass: existence, uniqueness, and convexity
Let be a complete Riemannian manifold and a probability measure on . Assume . We derive a new bound (in terms of , the injectivity radius of and an upper bound on the sectional curvatures of ) on the
Convergence Speed in Distributed Consensus and Averaging
TLDR
It is shown that a simple adaptation of a consensus algorithm leads to an averaging algorithm, and lower bounds on the worst-case convergence time for various classes of linear, time-invariant, distributed consensus methods are proved.
Distributed pose averaging in camera networks via consensus on SE(3)
TLDR
This paper rigorously analyzes the convergence of the proposed distributed averaging consensus algorithms on the group of 3D rigid-body transformations, SE(3), and shows that naive generalizations of Euclidean consensus algorithms fail to converge to the correct solution.
Riemannian Geometry
THE recent physical interpretation of intrinsic differential geometry of spaces has stimulated the study of this subject. Riemann proposed the generalisation, to spaces of any order, of Gauss's
Distributed image-based 3-D localization of camera sensor networks
  • Roberto Tron, R. Vidal
  • Computer Science
    Proceedings of the 48h IEEE Conference on Decision and Control (CDC) held jointly with 2009 28th Chinese Control Conference
  • 2009
TLDR
This work addresses the problem of distributed estimation of the poses of N cameras in a camera sensor network using image measurements only by minimizing a cost function on SE(3)N in a distributed fashion using a generalization of the classical consensus algorithm for averaging Euclidean data.
...
1
2
3
4
...