The conjectured optimal efficient mean square error for symmetric low-rank estimation
Statement
Let have prior distribution , and consider the symmetric rank-one matrix estimation model with signal-to-noise parameter . For , define
and set
Here denotes the scalar minimum mean square error. The efficient-estimation conjecture. For the model, the best mean square error achievable by an efficient algorithm is
This conjecture proposes that the state-evolution limit determines the optimal performance of efficient algorithms, addressing both whether the dummy-estimator error can be beaten efficiently and whether the information-theoretic minimum error can be attained; the source does not give a resolution.
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.