ResearchTrend.AI
  • Papers
  • Communities
  • Events
  • Blog
  • Pricing
Papers
Communities
Social Events
Terms and Conditions
Pricing
Parameter LabParameter LabTwitterGitHubLinkedInBlueskyYoutube

© 2025 ResearchTrend.AI, All rights reserved.

  1. Home
  2. Papers
  3. 1710.05209
  4. Cited By
Near-optimal Sample Complexity Bounds for Robust Learning of Gaussians
  Mixtures via Compression Schemes
v1v2v3v4v5 (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
ArXiv (abs)PDFHTML

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
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
Some techniques in density estimation
H. Ashtiani
Abbas Mehrabian
78
7
0
11 Jan 2018
1