Clustering subgaussian mixtures by semidefinite programming

Rank-reducibility of a symmetric matrix and sampling theory of minimum trace factor analysis

Alexander Shapiro · 1982

Earlier work this paper cites.

Problems of distance geometry and convex properties of quadratic maps

Alexander I. Barvinok · 1995

Earlier work this paper cites.

On the rank of extreme matrices in semidefinite programs and the multiplicity of optimal eigenvalues

Gábor Pataki · 1998

Earlier work this paper cites.

Learning mixtures of gaussians

S. Dasgupta · 1999

Earlier work this paper cites.

A spectral algorithm for learning mixture models

S. Vempala and G. Wang · 2004

Earlier work this paper cites.

Learning mixtures of arbitrary gaussians

S. Arora and R. Kannan · 2005

Earlier work this paper cites.

Fast computation of low-rank approximations

D. Achlioptas and F. McSherry · 2007

Earlier work this paper cites.

A probabilistic analysis of em for mixtures of separated, spherical gaussians

S. Dasgupta and L. Schulman · 2007

Earlier work this paper cites.

Approximating k-means-type clustering via semidefinite programming

J. Peng and Y. Wei · 2007

Cited alongside, same era.

Clustering with spectral norm and the k-means algorithm

A. Kumar and R. Kannan · 2010

Cited alongside, same era.

Mnist handwritten digit database

Yann LeCun and Corinna Cortes · 2010

Cited alongside, same era.

Settling the polynomial learnability of mixtures of gaussians

A. Moitra and G. Valiant · 2010

Cited alongside, same era.

Improved spectral-norm bounds for clustering

P. Awasthi and O. Sheffet · 2012

Cited alongside, same era.

Introduction to the non-asymptotic analysis of random matrices

R. Vershynin · 2012

Cited alongside, same era.

Community detection in sparse networks via grothendieck’s inequality, 2014

O. Guédon and R. Vershynin · 2014

Later among the works it cites.

TensorFlow: Large-scale machine learning on heterogeneous systems, 2015

Martín Abadi, Ashish Agarwal, Paul Barham, Eugene Brevdo, Zhifeng Chen, Craig Citro, Greg S. Corrado, Andy Davis, Jeffrey Dean, Matthieu Devin, Sanjay Ghemawat, Ian Goodfellow, Andrew Harp, Geoffrey Irving, Michael Isard, Yangqing Jia, Rafal Jozefowicz, Lukasz Kaiser, Manjunath Kudlur, Josh Levenberg, Dan Mané, Rajat Monga, Sherry Moore, Derek Murray, Chris Olah, Mike Schuster, Jonathon Shlens, Benoit Steiner, Ilya Sutskever, Kunal Talwar, Paul Tucker, Vincent Vanhoucke, Vijay Vasudevan, Fernanda Viégas, Oriol Vinyals, Pete Warden, Martin Wattenberg, Martin Wicke, Yuan Yu, and Xiaoqiang Zheng · 2015

Later among the works it cites.

Relax, no need to round: Integrality of clustering formulations

P. Awasthi, A. Bandeira, M. Charikar, R. Krishnaswamy, S. Villar, and R. Ward · 2015

Later among the works it cites.

Probably certifiably correct k-means clustering, 2015

T. Iguchi, D. G. Mixon, J. Peterson, and S. Villar · 2015

Later among the works it cites.

Recovery guarantees for exemplar-based clustering

A. Nellore and R. Ward · 2015