Exact Minimax Estimation for Phase Synchronization

by   Chao Gao, et al.

We study the phase synchronization problem with measurements Y=z^*z^*H+σ W∈ℂ^n× 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 Y_jk is observed with probability p. We prove that the minimax lower bound of estimating z^* under the squared ℓ_2 loss is (1-o(1))σ^2/2p. We also show that both generalized power method and maximum likelihood estimator achieve the error bound (1+o(1))σ^2/2p. Thus, σ^2/2p 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.



page 1

page 2

page 3

page 4


SDP Achieves Exact Minimax Optimality in Phase Synchronization

We study the phase synchronization problem with noisy measurements Y=z^*...

Optimal Orthogonal Group Synchronization and Rotation Group Synchronization

We study the statistical estimation problem of orthogonal group synchron...

Minimax Estimation of Partially-Observed Vector AutoRegressions

To understand the behavior of large dynamical systems like transportatio...

Minimax bounds for estimating multivariate Gaussian location mixtures

We prove minimax bounds for estimating Gaussian location mixtures on ℝ^d...

Minimax Optimal Clustering of Bipartite Graphs with a Generalized Power Method

Clustering bipartite graphs is a fundamental task in network analysis. I...

Use of Uncertain Additional Information in Newsvendor Models

The newsvendor problem is a popular inventory management problem in supp...

Deterministic Finite-Memory Bias Estimation

In this paper we consider the problem of estimating a Bernoulli paramete...
This week in AI

Get the week's most popular data science and artificial intelligence research sent straight to your inbox every Saturday.