DeepAI AI Chat
Log In Sign Up

Robust Group Synchronization via Cycle-Edge Message Passing

by   Gilad Lerman, et al.

We propose a general framework for group synchronization with adversarial corruption and sufficiently small noise. Specifically, we apply a novel message passing procedure that uses cycle consistency information in order to estimate the corruption levels of group ratios and consequently infer the corrupted group ratios and solve the synchronization problem. We first explain why the group cycle consistency information is essential for effectively solving group synchronization problems. We then establish exact recovery and linear convergence guarantees for the proposed message passing procedure under a deterministic setting with adversarial corruption. These guarantees hold as long as the ratio of corrupted cycles per edge is bounded by a reasonable constant. We also establish the stability of the proposed procedure to sub-Gaussian noise. We further show that under a uniform corruption model, the recovery results are sharp in terms of an information-theoretic bound.


page 1

page 2

page 3

page 4


Message Passing Least Squares Framework and its Application to Rotation Synchronization

We propose an efficient algorithm for solving group synchronization unde...

Submatrix localization via message passing

The principal submatrix localization problem deals with recovering a K× ...

Robust Group Synchronization via Quadratic Programming

We propose a novel quadratic programming formulation for estimating the ...

Fast, Accurate and Memory-Efficient Partial Permutation Synchronization

Previous partial permutation synchronization (PPS) algorithms, which are...

Message-passing algorithms for synchronization problems over compact groups

Various alignment problems arising in cryo-electron microscopy, communit...

A New Fault-Tolerant Synchronization Scheme with Anonymous Pulses

Robust pulse synchronization is fundamental in constructing reliable syn...