Faster and Sample Near-Optimal Algorithms for Proper Learning Mixtures of Gaussians thumbnail
Pause
Mute
Subtitles
Playback speed
0.25
0.5
0.75
1
1.25
1.5
1.75
2
Full screen

Faster and Sample Near-Optimal Algorithms for Proper Learning Mixtures of Gaussians

Published on Jul 15, 20143832 Views

We provide an algorithm for properly learning mixtures of two single-dimensional Gaussians without any separability assumptions. Given O~(1/ε2) samples from an unknown mixture, our algorithm outputs a

Related categories