Login / Signup
Near-optimal Sample Complexity Bounds for Robust Learning of Gaussian Mixtures via Compression Schemes.
Hassan Ashtiani
Shai Ben-David
Nicholas J. A. Harvey
Christopher Liaw
Abbas Mehrabian
Yaniv Plan
Published in:
J. ACM (2020)
Keyphrases
</>
learning algorithm
compression scheme
gaussian mixture
active learning
supervised learning
concept learning
machine learning
reinforcement learning
prior knowledge
image data
data points
em algorithm
learning problems