scientific article; zbMATH DE number 6982931

zbMath1467.68059MaRDI QIDQ4558500

Sanjoy Dasgupta, Christopher Tosh

Publication date: 22 November 2018

Full work available at URL: http://jmlr.csail.mit.edu/papers/v18/16-657.html

Title: zbMATH Open Web Interface contents unavailable due to conflicting licenses.

zbMATH Keywords

NP-completenessmaximum likelihoodmixtures of Gaussians

Mathematics Subject Classification ID

Point estimation (62F10) Computational difficulty of problems (lower bounds, completeness, difficulty of approximation, etc.) (68Q17)

Related Items (1)

Optimal estimation and computational limit of low-rank Gaussian mixtures

Cites Work

• Unnamed Item
• Unnamed Item
• NP-hardness of Euclidean sum-of-squares clustering
• Tight Bounds for Learning a Mixture of Two Gaussians
• Learning mixtures of spherical gaussians
• The Planar k-Means Problem is NP-Hard
• Random Projection Trees for Vector Quantization
• Learning mixtures of arbitrary gaussians

This page was built for publication: