Message‐Passing Algorithms for Synchronization Problems over Compact Groups

DOI10.1002/cpa.21750zbMath1439.62143arXiv1610.04583OpenAlexW2536490006MaRDI QIDQ4962468

Afonso S. Bandeira, Amelia Perry, Ankur Moitra, Alexander S. Wein

Publication date: 2 November 2018

Published in: Communications on Pure and Applied Mathematics (Search for Journal in Brave)

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

Mathematics Subject Classification ID

Multivariate analysis (62H99) Factor analysis and principal components; correspondence analysis (62H25) Estimation in multivariate analysis (62H12) Signal theory (characterization, reconstruction, filtering, etc.) (94A12)

Related Items (21)

Approximate message passing algorithms for rotationally invariant matrices ⋮ Approximate message passing with spectral initialization for generalized linear models* ⋮ An extension of the angular synchronization problem to the heterogeneous setting ⋮ Near-optimal performance bounds for orthogonal and permutation group synchronization via spectral methods ⋮ Lower bounds for invariant statistical models with applications to principal component analysis ⋮ Improved Performance Guarantees for Orthogonal Group Synchronization via Generalized Power Method ⋮ Optimal rates of estimation for multi-reference alignment ⋮ A unified approach to synchronization problems over subgroups of the orthogonal group ⋮ The noise-sensitivity phase transition in spectral group synchronization over compact groups ⋮ A representation theory perspective on simultaneous alignment and classification ⋮ Estimation under group actions: recovering orbits from invariants ⋮ Power spectrum unbiasing for dilation-invariant multi-reference alignment ⋮ Rates of estimation for high-dimensional multireference alignment ⋮ Notes on computational-to-statistical gaps: predictions using statistical physics ⋮ Shotgun identification on groups ⋮ On the Landscape of Synchronization Networks: A Perspective from Nonconvex Optimization ⋮ Spectral clustering revisited: information hidden in the Fiedler vector ⋮ Group synchronization on grids ⋮ Multi-Reference Alignment in High Dimensions: Sample Complexity and Phase Transition ⋮ Robust group synchronization via cycle-edge message passing ⋮ Orthogonal Trace-Sum Maximization: Tightness of the Semidefinite Relaxation and Guarantee of Locally Optimal Solutions

This page was built for publication: Message‐Passing Algorithms for Synchronization Problems over Compact Groups