To refer to this page use:
|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.|
|Electronic Publication Date:||2014|
|Citation:||Bandeira, A.S., Khoo, Y. & Singer, A.. (2014). Open Problem: Tightness of maximum likelihood semidefinite relaxations. Proceedings of The 27th Conference on Learning Theory, in PMLR 35:1265-1267|
|Type of Material:||Conference Article|
|Journal/Proceeding Title:||Proceedings of The 27th Conference on Learning Theory|
Items in OAR@Princeton are protected by copyright, with all rights reserved, unless otherwise indicated.