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. 2112.00706
  4. Cited By
Clustering Mixtures with Almost Optimal Separation in Polynomial Time

Clustering Mixtures with Almost Optimal Separation in Polynomial Time

1 December 2021
Jingkai Li
Allen Liu
ArXiv (abs)PDFHTML

Papers citing "Clustering Mixtures with Almost Optimal Separation in Polynomial Time"

5 / 5 papers shown
Title
Efficient Multivariate Robust Mean Estimation Under Mean-Shift Contamination
Efficient Multivariate Robust Mean Estimation Under Mean-Shift Contamination
Ilias Diakonikolas
Giannis Iakovidis
D. Kane
Thanasis Pittas
196
0
0
20 Feb 2025
Mixtures of Gaussians are Privately Learnable with a Polynomial Number
  of Samples
Mixtures of Gaussians are Privately Learnable with a Polynomial Number of Samples
Mohammad Afzali
H. Ashtiani
Christopher Liaw
103
6
0
07 Sep 2023
Private estimation algorithms for stochastic block models and mixture
  models
Private estimation algorithms for stochastic block models and mixture models
Hongjie Chen
Vincent Cohen-Addad
Tommaso dÓrsi
Alessandro Epasto
Jacob Imola
David Steurer
Stefan Tiegel
FedML
103
21
0
11 Jan 2023
Sample Complexity Bounds for Learning High-dimensional Simplices in
  Noisy Regimes
Sample Complexity Bounds for Learning High-dimensional Simplices in Noisy Regimes
Amir Saberi
Amir Najafi
S. Motahari
B. Khalaj
86
5
0
09 Sep 2022
Beyond Parallel Pancakes: Quasi-Polynomial Time Guarantees for
  Non-Spherical Gaussian Mixtures
Beyond Parallel Pancakes: Quasi-Polynomial Time Guarantees for Non-Spherical Gaussian Mixtures
Rares-Darius Buhai
David Steurer
CoGe
78
4
0
10 Dec 2021
1