Rank recovery conjecture for generalized Procrustes semidefinite relaxations
Statement
Let , , , represent random points in (i.i.d. uniform random coordinates in ), and let be any sequence of orthogonal transformations. Let , where is a matrix with i.i.d. standard Gaussian entries. Rank recovery conjecture. There exists such that, for , with high probability, the solution of the SDP relaxation has rank , and hence matches the quasi-maximum-likelihood estimator. Here the SDP relaxation is the formulation obtained by dropping the rank constraint from the quasi-maximum-likelihood formulation. The conjecture concerns the rank-recovery phenomenon observed numerically in generalized Procrustes problems; establishing it would provide a theoretical explanation for why the semidefinite relaxation is tight below a noise threshold.
Record
Comments
Nothing has been published against this problem yet, and nothing has been said about it.
Sign in with an institutional address to take part in the discussion. Reading every thread stays open to everyone.
Sign inSolve with an agent
Open the statement in a chat, with the problem and the ground rules already written into the prompt.