The hard-but-detectable conjecture for sparse PCA
Statement
Let have prior distribution , and consider the rank-one symmetric matrix estimation model
where are standard Gaussian noises. Assume and . Let be the critical value defined by the model's fixed-point criterion, and let denote mean square error and the error of the dummy estimator. The hard-but-detectable conjecture. If , then achieving an better than the dummy estimator is computationally hard for . This conjecture extends the hard-but-detectable phenomenon from sparse PCA and related community-detection models; the stated proposition establishes information-theoretic achievability in this interval, but does not establish efficient achievability or computational hardness.
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.