New techniques establish sharp lower bounds ruling out low-degree polynomial estimation at the BBP and Kesten-Stigum thresholds for planted submatrix, dense subgraph, spiked Wigner, and stochastic block models.
Algorithmic contiguity from low-degree conjecture and applications in correlated random graphs
1 Pith paper cite this work. Polarity classification is still indexing.
1
Pith paper citing it
fields
math.ST 1years
2025 1verdicts
UNVERDICTED 1representative citing papers
citing papers explorer
-
Sharp Phase Transitions in Estimation with Low-Degree Polynomials
New techniques establish sharp lower bounds ruling out low-degree polynomial estimation at the BBP and Kesten-Stigum thresholds for planted submatrix, dense subgraph, spiked Wigner, and stochastic block models.