Convex Clustering Redefined: Robust Learning with the Median of Means Estimator
凸聚类再定义：基于均值中位数估计的稳健学习
Clustering approaches that utilize convex loss functions have recently attracted growing interest in the formation of compact data clusters. Although classical methods like k-means and its wide family of variants are still widely used, all of them require the number of clusters k to be supplied as input, and many are notably sensitive to initialization. Convex clustering provides a more stable alternative by formulating the clustering task as a convex optimization problem,…