Near-optimal Sample Complexity Bounds for Robust Learning of Gaussians Mixtures via Compression Schemes, Shai Ben David (University of Waterloo)

CS Building (216), Room 201 .

Apr. 29th 2019, Sun. 11:00 , Shai Ben David (webpage). University of Waterloo. Location: CS Building (216), Room 201 . Near-optimal Sample Complexity Bounds for Robust Learning of Gaussians Mixtures via Compression Schemes Abstract: We prove that Θ(kd2 /ε^2 ) samples are necessary and sufficient for learning a mixture of k Gaussians in R^d , ... Read more