Open problem: Tightness of maximum likelihood semidefinite relaxations

Abstract

We have observed an interesting, yet unexplained, phenomenon: Semidefinite programming (SDP) based relaxations of maximum likelihood estimators (MLE) tend to be tight in recovery problems with noisy data, even when MLE cannot exactly recover the ground truth. Several results establish tightness of SDP based relaxations in the regime where exact recovery from MLE is possible. However, to the best of our knowledge, their tightness is not understood beyond this regime. As an illustrative example, we focus on the generalized Procrustes problem.

References in corpus (1)

• Approximating the Little Grothendieck Problem over the Orthogonal and Unitary Groups

Cited by in corpus (5)

• Tightness of the maximum likelihood semidefinite relaxation for angular synchronization
• Relax, no need to round: integrality of clustering formulations
• Average-Case Integrality Gap for Non-Negative Principal Component Analysis
• Tightness of a new and enhanced semidefinite relaxation for MIMO detection
• Stable Camera Motion Estimation Using Convex Programming