Near-Optimal Performance Bounds for Orthogonal and Permutation Group
Synchronization via Spectral Methods
- URL: http://arxiv.org/abs/2008.05341v3
- Date: Tue, 22 Feb 2022 12:05:55 GMT
- Title: Near-Optimal Performance Bounds for Orthogonal and Permutation Group
Synchronization via Spectral Methods
- Authors: Shuyang Ling
- Abstract summary: Group synchronization asks to recover group elements from their pairwise measurements.
spectral methods have enjoyed great popularity due to their efficiency and convenience.
For permutation group synchronization under random corruption, we show that the widely-used two-step procedure can recover all the group elements exactly.
- Score: 0.7614628596146599
- License: http://arxiv.org/licenses/nonexclusive-distrib/1.0/
- Abstract: Group synchronization asks to recover group elements from their pairwise
measurements. It has found numerous applications across various scientific
disciplines. In this work, we focus on orthogonal and permutation group
synchronization which are widely used in computer vision such as object
matching and structure from motion. Among many available approaches, the
spectral methods have enjoyed great popularity due to their efficiency and
convenience. We will study the performance guarantees of the spectral methods
in solving these two synchronization problems by investigating how well the
computed eigenvectors approximate each group element individually. We establish
our theory by applying the recent popular~\emph{leave-one-out} technique and
derive a~\emph{block-wise} performance bound for the recovery of each group
element via eigenvectors. In particular, for orthogonal group synchronization,
we obtain a near-optimal performance bound for the group recovery in presence
of additive Gaussian noise. For permutation group synchronization under random
corruption, we show that the widely-used two-step procedure (spectral method
plus rounding) can recover all the group elements exactly if the SNR
(signal-to-noise ratio) is close to the information theoretical limit. Our
numerical experiments confirm our theory and indicate a sharp phase transition
for the exact group recovery.
Related papers
- Sample Complexity for Quadratic Bandits: Hessian Dependent Bounds and
Optimal Algorithms [64.10576998630981]
We show the first tight characterization of the optimal Hessian-dependent sample complexity.
A Hessian-independent algorithm universally achieves the optimal sample complexities for all Hessian instances.
The optimal sample complexities achieved by our algorithm remain valid for heavy-tailed noise distributions.
arXiv Detail & Related papers (2023-06-21T17:03:22Z) - Instance-Optimal Cluster Recovery in the Labeled Stochastic Block Model [79.46465138631592]
We devise an efficient algorithm that recovers clusters using the observed labels.
We present Instance-Adaptive Clustering (IAC), the first algorithm whose performance matches these lower bounds both in expectation and with high probability.
arXiv Detail & Related papers (2023-06-18T08:46:06Z) - Unrolled algorithms for group synchronization [7.969977930633441]
Group synchronization problem involves estimating a collection of group elements from noisy measurements of their pairwise ratios.
Standard methods to estimate the group elements are based on iteratively applying linear and non-linear operators.
Motivated by the structural similarity to deep neural networks, we adopt the concept of algorithm unrolling.
arXiv Detail & Related papers (2022-07-19T17:25:56Z) - Perfect Spectral Clustering with Discrete Covariates [68.8204255655161]
We propose a spectral algorithm that achieves perfect clustering with high probability on a class of large, sparse networks.
Our method is the first to offer a guarantee of consistent latent structure recovery using spectral clustering.
arXiv Detail & Related papers (2022-05-17T01:41:06Z) - Optimal Clustering with Bandit Feedback [57.672609011609886]
This paper considers the problem of online clustering with bandit feedback.
It includes a novel stopping rule for sequential testing that circumvents the need to solve any NP-hard weighted clustering problem as its subroutines.
We show through extensive simulations on synthetic and real-world datasets that BOC's performance matches the lower boundally, and significantly outperforms a non-adaptive baseline algorithm.
arXiv Detail & Related papers (2022-02-09T06:05:05Z) - A Spectral Method for Joint Community Detection and Orthogonal Group
Synchronization [20.413250472034143]
We propose a simple algorithm that consists of a spectral decomposition step followed by a blockwise column pivoted QR factorization (CPQR)
The proposed algorithm is efficient and scales linearly with the number of data points.
We also leverage the recently developed leave-one-out' technique to establish a near-optimal guarantee for exact recovery of the cluster memberships.
arXiv Detail & Related papers (2021-12-25T07:38:14Z) - Orthogonal Group Synchronization with Incomplete Measurements: Error
Bounds and Linear Convergence of the Generalized Power Method [22.901235010786287]
Group synchronization refers to estimating a collection of group elements from the noisy pairwise measurements.
In this paper, we focus on the group synchronization problem with general additive noise models under incomplete measurements.
arXiv Detail & Related papers (2021-12-13T10:57:09Z) - Sparse Quadratic Optimisation over the Stiefel Manifold with Application
to Permutation Synchronisation [71.27989298860481]
We address the non- optimisation problem of finding a matrix on the Stiefel manifold that maximises a quadratic objective function.
We propose a simple yet effective sparsity-promoting algorithm for finding the dominant eigenspace matrix.
arXiv Detail & Related papers (2021-09-30T19:17:35Z) - Joint Community Detection and Rotational Synchronization via
Semidefinite Programming [17.845257705485533]
In the presence of heterogeneous data, where randomly rotated objects fall into multiple underlying categories, it is challenging to simultaneously classify them into clusters and synchronize them based on pairwise relations.
We propose a series of semidefinite relaxations, and prove their exact recovery when extending the celebrated block model to this new setting.
Numerical experiments demonstrate the efficacy of our proposed algorithms and confirm our theoretical result which indicates a sharp phase transition for exact recovery.
arXiv Detail & Related papers (2021-05-13T01:40:20Z) - A Practical Method for Constructing Equivariant Multilayer Perceptrons
for Arbitrary Matrix Groups [115.58550697886987]
We provide a completely general algorithm for solving for the equivariant layers of matrix groups.
In addition to recovering solutions from other works as special cases, we construct multilayer perceptrons equivariant to multiple groups that have never been tackled before.
Our approach outperforms non-equivariant baselines, with applications to particle physics and dynamical systems.
arXiv Detail & Related papers (2021-04-19T17:21:54Z) - A Unified Approach to Synchronization Problems over Subgroups of the
Orthogonal Group [29.714239628405515]
We consider the class of synchronization problems which the group is a closed subgroup.
We propose a unified approach for solving this class of problems.
We show that our approach outperforms existing approaches.
arXiv Detail & Related papers (2020-09-16T07:25:50Z)
This list is automatically generated from the titles and abstracts of the papers in this site.
This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.