6 problems
- 0 votes0 replies1 view
Algorithmic threshold conjecture for low-rank matrix estimation
Let be the observation matrix and let be the rank-one signal direction. Define … and set … Here is the ac…
- 0 votes0 replies0 views
The computational hardness conjecture for inhomogeneous low-rank estimation below the AMP threshold
In the block-structured spiked model, let denote the threshold governing the performance of spectral and approximate message passing algorithms, and let be the si…
- 0 votes0 replies0 views
The polynomial-time tensor completion sample-complexity conjecture
Polynomial-time tensor completion conjecture. No polynomial-time algorithm will be successful if the sample complexity is less than order .
- 0 votes0 replies1 view
Conjecture that the SSN estimator has a generally smaller actual error rate than the MN estimator
Let and denote the SSN and MN estimators, respectively, and let their error r…
- 0 votes0 replies0 views
The conjectured optimal efficient mean square error for symmetric low-rank estimation
Let have prior distribution , and consider the symmetric rank-one matrix estimation model with signal-to-noise parameter . For , define … and set … Here…
- 0 votes0 replies0 views
The hard-but-detectable conjecture for sparse PCA
Let have prior distribution , and consider the rank-one symmetric matrix estimation model … where are standard Gaussian noises. Assume an…