ResearchTrend.AI
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

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"

6 / 6 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
Community recovery in non-binary and temporal stochastic block models
Community recovery in non-binary and temporal stochastic block models
Konstantin Avrachenkov
Maximilien Dreveton
Lasse Leskelä
52
10
0
11 Aug 2020
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
248
109
0
07 Dec 2016