Old Web
English
Sign In
Acemap
>
Paper
>
Near-optimal Sample Complexity Bounds for Robust Learning of Gaussian Mixtures via Compression Schemes
Near-optimal Sample Complexity Bounds for Robust Learning of Gaussian Mixtures via Compression Schemes
2020
Hassan Ashtiani
Shai Ben-David
Nicholas J. A. Harvey
Christopher Liaw
Abbas Mehrabian
Yaniv Plan
Keywords:
Sample complexity
robust learning
Algorithm
Gaussian
Compression (physics)
Computer science
Correction
Source
Cite
Save
Machine Reading By IdeaReader
15
References
1
Citations
NaN
KQI
[]