An extension of the angular synchronization problem to the heterogeneous setting
From MaRDI portal
Publication:2148952
Abstract: Given an undirected measurement graph , the classical angular synchronization problem consists of recovering unknown angles from a collection of noisy pairwise measurements of the form , for each . This problem arises in a variety of applications, including computer vision, time synchronization of distributed networks, and ranking from preference relationships. In this paper, we consider a generalization to the setting where there exist unknown groups of angles , for . For each , we are given noisy pairwise measurements of the form for an unknown . This can be thought of as a natural extension of the angular synchronization problem to the heterogeneous setting of multiple groups of angles, where the measurement graph has an unknown edge-disjoint decomposition , where the 's denote the subgraphs of edges corresponding to each group. We propose a probabilistic generative model for this problem, along with a spectral algorithm for which we provide a detailed theoretical analysis in terms of robustness against both sampling sparsity and noise. The theoretical findings are complemented by a comprehensive set of numerical experiments, showcasing the efficacy of our algorithm under various parameter regimes. Finally, we consider an application of bi-synchronization to the graph realization problem, and provide along the way an iterative graph disentangling procedure that uncovers the subgraphs , which is of independent interest, as it is shown to improve the final recovery accuracy across all the experiments considered.
Recommendations
- Angular synchronization by eigenvectors and semidefinite programming
- On recovery guarantees for angular synchronization
- A unified approach to synchronization problems over subgroups of the orthogonal group
- Exact and stable recovery of rotations for robust synchronization
- Joint community detection and rotational synchronization via semidefinite programming
Cites work
- scientific article; zbMATH DE number 17636 (Why is no real title available?)
- scientific article; zbMATH DE number 7370536 (Why is no real title available?)
- scientific article; zbMATH DE number 7626779 (Why is no real title available?)
- A new way of using semidefinite programming with applications to linear equations mod \(p\)
- A useful variant of the Davis-Kahan theorem for statisticians
- Angular synchronization by eigenvectors and semidefinite programming
- Characterizing generic global rigidity
- Deformed Laplacians and spectral ranking in directed networks
- Distributed Graph Layout for Sensor Networks
- Eigenvector synchronization, graph rigidity and the molecule problem
- Emergence of Scaling in Random Networks
- Generic global rigidity
- Local minima and convergence in low-rank semidefinite programming
- Message-passing algorithms for synchronization problems over compact groups
- Multidimensional scaling.
- Near-optimal bounds for phase synchronization
- Non-unique games over compact groups and orientation estimation in cryo-EM
- Nonconvex phase synchronization
- Notes on computational-to-statistical gaps: predictions using statistical physics
- Optimality and sub-optimality of PCA. I: Spiked random matrix models
- Problems of distance geometry and convex properties of quadratic maps
- Pseudo-likelihood methods for community detection in large sparse networks
- Relative Perturbation Theory: II. Eigenspace and Singular Subspace Variations
- Second order accurate distributed eigenvector computation for extremely large matrices
- Sharp nonasymptotic bounds on the norm of random matrices with independent entries
- The Molecule Problem: Exploiting Structure in Global Optimization
- The Rotation of Eigenvectors by a Perturbation. III
- Tightness of the maximum likelihood semidefinite relaxation for angular synchronization
- Vector diffusion maps and the connection Laplacian
- Viewing angle classification of cryo-electron microscopy images using eigenvectors
- Viewing direction estimation in cryo-EM using synchronization
Cited in
(5)- Joint community detection and rotational synchronization via semidefinite programming
- On recovery guarantees for angular synchronization
- Exact and stable recovery of rotations for robust synchronization
- scientific article; zbMATH DE number 7626745 (Why is no real title available?)
- Optimal orthogonal group synchronization and rotation group synchronization
This page was built for publication: An extension of the angular synchronization problem to the heterogeneous setting
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q2148952)