Exact Minimax Estimation for Phase Synchronization
Not on the map. Why?
Abstract (arXiv)
We study the phase synchronization problem with measurements Y=z^*z*H+σ W∈mathbbCn× n, where z^* is an n-dimensional complex unit-modulus vector and W is a complex-valued Gaussian random matrix. It is assumed that each entry Yjk is observed with probability p. We prove that the minimax lower bound of estimating z^* under the squared ℓ2 loss is (1-o(1))fracσ22p. We also show that both generalized power method and maximum likelihood estimator achieve the error bound (1+o(1))fracσ22p. Thus, fracσ22p is the exact asymptotic minimax error of the problem. Our upper bound analysis involves a precise characterization of the statistical property of the power iteration. The lower bound is derived through an application of van Trees' inequality.
Key facts. Cited by 5 papers in the map (data through 7 Oct 2026). First posted on arXiv 9 Oct 2020.
Builds on
No reference list yet.
Built on by
Citing papers per year: 2021: 4; 2022: 0; 2023: 1.
5 papers.
- 2021Localization in 1D non-parametric latent space models from pairwise affinitiescited by 7
- 2021Optimal Orthogonal Group Synchronization and Rotation Group Synchronizationcited by 4
- 2021Orthogonal Group Synchronization with Incomplete Measurements: Error Bounds and Linear Convergence of the Generalized Power Methodcited by 4
- 2021SDP Achieves Exact Minimax Optimality in Phase Synchronizationcited by 3
- 2023Sharp analysis of EM for learning mixtures of pairwise differencescited by 1
- 2023Sharp analysis of EM for learning mixtures of pairwise differences20 Feb 2023
- 2021Orthogonal Group Synchronization with Incomplete Measurements: Error Bounds and Linear Convergence of the Generalized Power Method13 Dec 2021
- 2021Optimal Orthogonal Group Synchronization and Rotation Group Synchronization28 Sep 2021
- 2021Localization in 1D non-parametric latent space models from pairwise affinities6 Aug 2021
- 2021SDP Achieves Exact Minimax Optimality in Phase Synchronization7 Jan 2021