Search Results for author:
Found 1 papers, 0 papers with code
Universal Lower Bounds and Optimal Rates: Achieving Minimax Clustering Error in Sub-Exponential Mixture Models
In such mixtures, we establish that Bregman hard clustering, a variant of Lloyd's algorithm employing a Bregman divergence, is rate optimal.
Cannot find the paper you are looking for? You can
Submit a new open access paper.
