ReSync: Riemannian Subgradient-based Robust Rotation Synchronization

Published: 21 Sept 2023, Last Modified: 17 Jan 2024NeurIPS 2023 posterEveryoneRevisionsBibTeX
Keywords: Manifold optimization, Riemannian subgradient method, rotation synchronization
TL;DR: We introduce ReSync algorithm for solving robust rotation synchronization and provide strong theoretical guarantees.
Abstract: This work presents ReSync, a Riemannian subgradient-based algorithm for solving the robust rotation synchronization problem, which arises in various engineering applications. ReSync solves a least-unsquared minimization formulation over the rotation group, which is nonsmooth and nonconvex, and aims at recovering the underlying rotations directly. We provide strong theoretical guarantees for ReSync under the random corruption setting. Specifically, we first show that the initialization procedure of ReSync yields a proper initial point that lies in a local region around the ground-truth rotations. We next establish the weak sharpness property of the aforementioned formulation and then utilize this property to derive the local linear convergence of ReSync to the ground-truth rotations. By combining these guarantees, we conclude that ReSync converges linearly to the ground-truth rotations under appropriate conditions. Experiment results demonstrate the effectiveness of ReSync.
Submission Number: 3974
Loading