Efficient Bayesian estimation from few samples: community detection and related problems
From MaRDI portal
Cited in
(18)- A computational transition for detecting correlated stochastic block models by low-degree polynomials
- Random separating hyperplane theorem and learning polytopes
- Low-degree hardness of detection for correlated Erdős-Rényi graphs
- Precise error rates for computationally efficient testing
- Low coordinate degree algorithms. I: Universality of computational thresholds for hypothesis testing
- Equivalence of approximate message passing and low-degree polynomials in rank-one matrix estimation
- Optimal spectral recovery of a planted vector in a subspace
- SQ lower bounds for random sparse planted vector problem
- Detection of dense subhypergraphs by low-degree polynomials
- Random algebraic graphs and their convergence to Erdős-Rényi
- Tensor-on-tensor regression: Riemannian optimization, over-parameterization, statistical-computational gap and their interplay
- Testing network correlation efficiently via counting trees
- Counterexamples to the low-degree conjecture
- Computational lower bounds for multi-frequency group synchronization
- The full landscape of robust mean testing: sharp separations between oblivious and adaptive contamination
- Is it easier to count communities than find them?
- Optimal recovery of correlated Erdős-Rényi graphs
- Algorithmic contiguity from low-degree conjecture and applications in correlated random graphs
This page was built for publication: Efficient Bayesian estimation from few samples: community detection and related problems
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q6946346)
