Papers
Communities
Events
Blog
Pricing
Search
Open menu
Home
Papers
1710.05209
Cited By
v1
v2
v3
v4
v5 (latest)
Near-optimal Sample Complexity Bounds for Robust Learning of Gaussians Mixtures via Compression Schemes
14 October 2017
H. Ashtiani
Shai Ben-David
Nicholas J. A. Harvey
Christopher Liaw
Abbas Mehrabian
Y. Plan
Re-assign community
ArXiv (abs)
PDF
HTML
Papers citing
"Near-optimal Sample Complexity Bounds for Robust Learning of Gaussians Mixtures via Compression Schemes"
3 / 3 papers shown
Title
Near Optimal Stratified Sampling
Tiancheng Yu
Xiyu Zhai
S. Sra
27
3
0
26 Jun 2019
The Minimax Learning Rates of Normal and Ising Undirected Graphical Models
Luc Devroye
Abbas Mehrabian
Tommy Reddad
63
30
0
18 Jun 2018
Some techniques in density estimation
H. Ashtiani
Abbas Mehrabian
78
7
0
11 Jan 2018
1