Near-optimal Sample Complexity Bounds for Robust Learning of Gaussian Mixtures via Compression Schemes

DOI10.1145/3417994zbMath1499.68298arXiv1710.05209OpenAlexW3091802565MaRDI QIDQ5056446

Hassan Ashtiani, Christopher Liaw, Nicholas J. A. Harvey, Shai Ben-David, Abbas Mehrabian, Yaniv Plan

Publication date: 8 December 2022

Published in: Journal of the ACM (Search for Journal in Brave)

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

zbMATH Keywords

density estimationcompression schemesdistribution learningmixtures of Gaussians

Mathematics Subject Classification ID

Classification and discrimination; cluster analysis (statistical aspects) (62H30) Learning and adaptive systems in artificial intelligence (68T05)

Related Items (1)

Reliable clustering of Bernoulli mixture models

This page was built for publication: Near-optimal Sample Complexity Bounds for Robust Learning of Gaussian Mixtures via Compression Schemes