Robust group synchronization via cycle-edge message passing

DOI10.1007/S10208-021-09532-WMaRDI QIDQ2098232zbMATH OpenOpenAlexFDO

Authors Gilad Lerman, Yunpeng Shi

Publication date 17 November 2022

Published in Foundations of Computational Mathematics (Search for Journal in Brave)

Copyright license Creative Commons Attribution 4.0 International

Full work available at URL https://arxiv.org/abs/1912.11347

zbMATH Keywords

robust estimationgroup synchronizationexact recoverymessage passing

Mathematics Subject Classification ID

Nonparametric robustness (62G35) Analysis of algorithms and problem complexity (68Q25) Probability in computer science (algorithm analysis, random structures, phase transitions, etc.) (68Q87) Analysis of algorithms (68W40) Estimation and detection in stochastic control theory (93E10)

Cites work

• A Bennett concentration inequality and its application to suprema of empirical processes
• A novel M-estimator for robust PCA
• Angular synchronization by eigenvectors and semidefinite programming
• Community detection and stochastic block models: recent developments
• Exact and stable recovery of rotations for robust synchronization
• Exact camera location recovery by least unsquared deviations
• Improved approximation algorithms for maximum cut and satisfiability problems using semidefinite programming
• Information Recovery From Pairwise Measurements
• Message-passing algorithms for synchronization problems over compact groups
• Metrics for 3D rotations: comparison and analysis
• Oracle inequalities in empirical risk minimization and sparse recovery problems. École d'Été de Probabilités de Saint-Flour XXXVIII-2008.
• Random Laplacian matrices and convex relaxations
• Robust computation of linear models by convex relaxation
• Semidefinite programs on sparse random graphs and their application to community detection
• ShapeFit: exact location recovery from corrupted pairwise directions
• Solving jigsaw puzzles by the graph connection Laplacian
• Spectral synchronization of multiple views in \(\mathrm{SE}(3)\)
• Stable camera motion estimation using convex programming
• Synchronization overZ₂and community detection in signed multiplex networks with constraints
• The projected power method: an efficient algorithm for joint alignment from pairwise differences
• Three-dimensional structure determination from common lines in cryo-EM by eigenvectors and semidefinite programming
• Tightness of the maximum likelihood semidefinite relaxation for angular synchronization
• Vector diffusion maps and the connection Laplacian

Cited in

(5)

• Improved performance guarantees for orthogonal group synchronization via generalized power method
• Robust Group Synchronization via Cycle-Edge Message Passing
• Exact minimax optimality of spectral methods in phase synchronization and orthogonal group synchronization
• Solving orthogonal group synchronization via convex and low-rank optimization: tightness and landscape analysis
• A unified approach to synchronization problems over subgroups of the orthogonal group

This page was built for publication: Robust group synchronization via cycle-edge message passing

Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2098232)