Hidden Integrality and Semirandom Robustness of SDP Relaxation for Sub-Gaussian Mixture Model
From MaRDI portal
Cites work
- A constant-factor approximation algorithm for the \(k\)-median problem (extended abstract)
- A local search approximation algorithm for \(k\)-means clustering
- A new greedy approach for facility location problems
- A spectral algorithm for learning mixture models
- Approximating k-median via pseudo-approximation
- Approximating K‐means‐type Clustering via Semidefinite Programming
- Approximation algorithms for semi-random partitioning problems
- Automata, Languages and Programming
- Clustering subgaussian mixtures by semidefinite programming
- Community detection and stochastic block models: recent developments
- Community detection in sparse networks via Grothendieck's inequality
- Convex optimization for the planted \(k\)-disjoint-clique problem
- Efficiently learning mixtures of two Gaussians
- Exact Recovery in the Stochastic Block Model
- Exponential Error Rates of SDP for Block Models: Beyond Grothendieck’s Inequality
- Heuristics for semirandom graph problems
- How robust are reconstruction thresholds for community detection?
- scientific article; zbMATH DE number 2222601 (Why is no real title available?)
- Improved Graph Clustering
- Improved spectral-norm bounds for clustering
- Learning Theory
- Least squares quantization in PCM
- METHOD OF MOMENTS AND METHOD OF MAXIMUM LIKELIHOOD
- Mixture models, robustness, and sum of squares proofs
- NP-hardness of Euclidean sum-of-squares clustering
- On semidefinite relaxations for the block model
- Partial recovery bounds for clustering with the relaxed K-means
- Probability and Computing
- Probably certifiably correct k-means clustering
- Recovery guarantees for exemplar-based clustering
- Relax, no need to round: integrality of clustering formulations
- Semidefinite programs on sparse random graphs and their application to community detection
- Semirandom models as benchmarks for coloring algorithms
- Statistical guarantees for the EM algorithm: from population to sample-based analysis
- The Planar k-Means Problem is NP-Hard
- When do birds of a feather flock together? \(k\)-means, proximity, and conic programming
Cited in
(2)
This page was built for publication: Hidden Integrality and Semirandom Robustness of SDP Relaxation for Sub-Gaussian Mixture Model
Report a bug (only for logged in users!)Click here to report a bug for this page (MaRDI item Q5868965)
