2026
Efficient Testing for Correlation Clustering: Improved Algorithms and Optimal Bounds
ICLR 2026poster
Correlation clustering is an important unsupervised learning problem with broad applications. In this problem, we are given a labeled complete graph $G=(V,E^+ \cup E^-)$, and the optimal clustering is defined as a partition of the vertices that minimizes the $+$ edges between clusters and $-$ edges…