Exponential Error Rates of SDP for Block Models: Beyond Grothendieck’s Inequality
From MaRDI portal
Publication:4611457
DOI10.1109/TIT.2018.2839677zbMath1432.90102arXiv1705.08391OpenAlexW2962699510WikidataQ115534498 ScholiaQ115534498MaRDI QIDQ4611457
Publication date: 18 January 2019
Published in: IEEE Transactions on Information Theory (Search for Journal in Brave)
Full work available at URL: https://arxiv.org/abs/1705.08391
Estimation in multivariate analysis (62H12) Classification and discrimination; cluster analysis (statistical aspects) (62H30) Semidefinite programming (90C22)
Related Items (9)
Iterative algorithm for discrete structure recovery ⋮ Unnamed Item ⋮ Rate optimal Chernoff bound and application to community detection in the stochastic block models ⋮ Theoretical and computational guarantees of mean field variational inference for community detection ⋮ Unnamed Item ⋮ Convex relaxation methods for community detection ⋮ Minimax rates in network analysis: graphon estimation, community detection and hypothesis testing ⋮ Partial recovery bounds for clustering with the relaxed \(K\)-means ⋮ Hidden Integrality and Semirandom Robustness of SDP Relaxation for Sub-Gaussian Mixture Model
This page was built for publication: Exponential Error Rates of SDP for Block Models: Beyond Grothendieck’s Inequality