55 citations · 89 across the 16 of their papers we have counts for
Showing 2017Show all
2 papers · 1 filter
cs.LG2017★ 4 cited
Near-optimal Sample Complexity Bounds for Robust Learning of Gaussians Mixtures via Compression Schemes
Hassan Ashtiani, Shai Ben-David, Nick Harvey +3
We prove that samples are necessary and sufficient for learning a mixture of Gaussians in , up to error in total va…
cs.LG2017
Sample-Efficient Learning of Mixtures
Hassan Ashtiani, Shai Ben-David, Abbas Mehrabian
We consider PAC learning of probability distributions (a.k.a. density estimation), where we are given an i.i.d. sample generated from an unknown target distribution, and want to ou…