mlsanityData to 14 Oct 2026

Robust Group Synchronization via Quadratic Programming

arXiv 2206.08994 ↗First posted 17 Jun 2022stat.ML cs.CV cs.LGcited by 10

Not on the map. Why?

Abstract (arXiv)

We propose a novel quadratic programming formulation for estimating the corruption levels in group synchronization, and use these estimates to solve this problem. Our objective function exploits the cycle consistency of the group and we thus refer to our method as detection and estimation of structural consistency (DESC). This general framework can be extended to other algebraic and geometric structures. Our formulation has the following advantages: it can tolerate corruption as high as the information-theoretic bound, it does not require a good initialization for the estimates of group elements, it has a simple interpretation, and under some mild conditions the global minimum of our objective function exactly recovers the corruption levels. We demonstrate the competitive accuracy of our approach on both synthetic and real data experiments of rotation averaging.

Key facts. Cited by 10 papers in the map (data through 14 Oct 2026). Builds on 10 of its 30 references that are in the map. First posted on arXiv 17 Jun 2022.

Builds on

10 of 30 references.

References · 10

  1. 2013Projection onto the probability simplex: An efficient algorithm with a simple proof, and an applicationcited by 67
  2. 2014Robust Camera Location Estimation by Convex Programmingcited by 41
  3. 2020Message Passing Least Squares Framework and its Application to Rotation Synchronizationcited by 22
  4. 2018Bayesian Pose Graph Optimization via Bingham Distributions and Tempered Geodesic MCMCcited by 19
  5. 2019Robust Group Synchronization via Cycle-Edge Message Passingcited by 19
  6. 2020Synchronizing Probability Measures on Rotations via Optimal Transportcited by 19
  7. 2020Near-Optimal Performance Bounds for Orthogonal and Permutation Group Synchronization via Spectral Methodscited by 18
  8. 2014Near-Optimal Joint Object Matching via Convex Relaxationcited by 17
  9. 2015Random Laplacian matrices and convex relaxationscited by 14
  10. 2015Synchronization over Z2 and community detection in multiplex signed networks with constraintscited by 4

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2023: 5; 2024: 0; 2025: 3; 2026: 2.

10 papers.