Clustering mixture models in almost-linear time via list-decodable mean estimation

DOI10.1145/3519935.3520014arXiv2106.08537OpenAlexW3172094718MaRDI QIDQ6083579

Kevin T. Tian, Jerry Li, Ilias Diakonikolas, Unnamed Author, Daniel M. Kane

Publication date: 8 December 2023

Published in: Proceedings of the 54th Annual ACM SIGACT Symposium on Theory of Computing (Search for Journal in Brave)

Full work available at URL: https://arxiv.org/abs/2106.08537

zbMATH Keywords

clusteringrobust statisticsmixture modelslist-decodable learning

Mathematics Subject Classification ID

Theory of computing (68Qxx)

This page was built for publication: Clustering mixture models in almost-linear time via list-decodable mean estimation