~/talk

Exact Minimax Estimation for Phase Synchronization

name:Chao Gao
links:none on file
slides:none on file

Proves the minimax risk equals sigma^2/(n p), derives a matching lower bound and shows MLE, generalized power method (GPM) with eigenvector initialization, and SDP (with eigenvector post‑processing) all attain that rate and the claimed leading constant 102 under the consistency regime sigma^2 = o(n p); analysis uses an iterative map F, Burer–Monteiro factorization and fixed‑point arguments to link algorithms to the MLE, and requires p = Ω((log n)/n) for graph connectivity.

AI-written summary · about

  1. 0:00Introduction
  2. 1:31Phase synchronization problem
  3. 3:24Existing literature and algorithms
  4. 7:27General framework and results
  5. 12:12Structured linear model framework
  6. 16:41Iterative algorithm analysis
  7. 21:25Application to Gaussian mixtures
  8. 26:24Analysis of phase synchronization
  9. 28:55SDP and lower bounds
  10. 34:48Comparison with Z2 synchronization
  11. 40:53Generalization and Q&A
~/search
type to search 6,249 conferences, 138,987 speakers and 185,172 talks
~/help
cmdctrl k
search every conference, speaker and series
/
focus the filter search
h
home
c
conferences
s
speakers
e
series
t
light / dark — the status bar button does the same
?
this help
esc
close this, then clear every filter — or just the search, while you are typing in it

Ignored while you are typing. Pages without a filter rail have no search to focus.