8 citations · 12 across the 4 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…
math.PR2017
Notes on Growing a Tree in a Graph
Luc Devroye, Vida Dujmović, Alan Frieze +3
We study the height of a spanning tree of a graph obtained by starting with a single vertex of and repeatedly selecting, uniformly at random, an edge of with exactl…