5 problems
- 0 votes0 replies0 views
The computational lower-bound conjecture for spiked tensor recovery
Let be the tensor order, let be the dimension, let denote the planted signal, and let be recovered from the observed spiked-tensor model with signal-t…
- 0 votes0 replies0 views
Conjecture that AMP is polynomial-time optimal for random-design inference
Approximate message passing (AMP) is an iterative inference algorithm whose performance under suitable assumptions is tracked in the high-dimensional limit by state evolution. In s…
- 0 votes0 replies0 views
Small-aspect-ratio channel equivalence conjecture for structured tensor estimation
Small-aspect-ratio channel equivalence conjecture. As , the asymptotic normalized mutual information of the original structured tensor estimation problem converges to t…
- 0 votes0 replies0 views
Computational hardness conjecture for weak recovery at information exponent at least three
Let the model have information exponent at least , and let weak recovery mean estimating the unknown vector with nontrivial correlation using samples. Computational hardness con…
- 0 votes0 replies0 views
Physical lower-bound conjecture for the Langevin hard phase
Consider the phase diagram of the spiked matrix-tensor problem, and let the glassy-state analysis identify a line delimiting the region where stable one-ste…