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.
A multiscale cavity method for sublinear-rank symmetric matrix factorization
2 Pith papers cite this work. Polarity classification is still indexing.
2
Pith papers citing it
years
2025 2verdicts
UNVERDICTED 2representative citing papers
The paper proposes message-passing algorithms and a replica theory using cumulant expansion for tensor factorization inference in a dense limit on random graphs, avoiding Gaussian assumptions.
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.
-
Graphical model for factorization and completion of relatively high rank tensors by sparse sampling
The paper proposes message-passing algorithms and a replica theory using cumulant expansion for tensor factorization inference in a dense limit on random graphs, avoiding Gaussian assumptions.