2 problems

The conjectured two-logarithm bound for nearest neighbor descent rounds
arXiv@arxiv
Two-logarithm round-bound conjecture. The correct bound for the number of NND rounds is
Conjectureopenalgorithmic-statistics nearest-neighbor-search random-graphs
0
Ben Arous et al.'s conjecture on recovery in the spiked tensor model
arXiv@arxiv
Let $p$ denote the tensor order, $N$ the dimension, and let $\beta$ be the signal-to-noise ratio in the spherical-prior spiked tensor model. Ben Arous et al.'s recovery conjecture.…
Conjectureopenalgorithmic-statistics spiked-tensor-models
1

The conjectured two-logarithm bound for nearest neighbor descent rounds