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. 2402.15432
  4. Cited By
Universal Lower Bounds and Optimal Rates: Achieving Minimax Clustering
  Error in Sub-Exponential Mixture Models

Universal Lower Bounds and Optimal Rates: Achieving Minimax Clustering Error in Sub-Exponential Mixture Models

23 February 2024
Maximilien Dreveton
Alperen Gozeten
Matthias Grossglauser
Patrick Thiran
ArXivPDFHTML

Papers citing "Universal Lower Bounds and Optimal Rates: Achieving Minimax Clustering Error in Sub-Exponential Mixture Models"

5 / 5 papers shown
Title
Exact Recovery and Bregman Hard Clustering of Node-Attributed Stochastic
  Block Model
Exact Recovery and Bregman Hard Clustering of Node-Attributed Stochastic Block Model
Maximilien Dreveton
F. S. Fernandes
D. R. Figueiredo
55
7
0
30 Oct 2023
A robust model-based clustering based on the geometric median and the
  Median Covariation Matrix
A robust model-based clustering based on the geometric median and the Median Covariation Matrix
Antoine Godichon-Baggioni
Stephane S. Robin
53
3
0
15 Nov 2022
Optimal Clustering in Anisotropic Gaussian Mixture Models
Optimal Clustering in Anisotropic Gaussian Mixture Models
Xin Chen
A. Zhang
46
9
0
14 Jan 2021
Asymptotic Bayes risk for Gaussian mixture in a semi-supervised setting
Asymptotic Bayes risk for Gaussian mixture in a semi-supervised setting
Marc Lelarge
Léo Miolane
44
28
0
08 Jul 2019
Statistical and Computational Guarantees of Lloyd's Algorithm and its
  Variants
Statistical and Computational Guarantees of Lloyd's Algorithm and its Variants
Yu Lu
Harrison H. Zhou
227
109
0
07 Dec 2016
1