Personalized Clustering via Targeted Representation Learning
Xiwen Geng, Suyun Zhao, Yixin Yu, Borui Peng, Pan Du, Hong Chen, Cuiping Li, Mengdie Wang
TL;DR
The paper tackles personalized clustering by allowing user-driven clustering orientation through targeted representation learning and active querying of pairwise constraints. It introduces PCL, a framework that uses two data augmentations, cross-instance attention, and a constrained contrastive loss to learn representations aligned with a specified cluster direction, guided by an active query strategy that balances uncertainty and hard negatives. Theoretical results bound clustering risk and show that actively querying informative pairs reduces the generalization gap, while experiments on CIFAR-10/100 and ImageNet-10 demonstrate strong performance especially in personalized settings with minimal constraint budgets. This approach enables efficient, user-centered clustering adaptable to diverse applications and data orientations.
Abstract
Clustering traditionally aims to reveal a natural grouping structure within unlabeled data. However, this structure may not always align with users' preferences. In this paper, we propose a personalized clustering method that explicitly performs targeted representation learning by interacting with users via modicum task information (e.g., $\textit{must-link}$ or $\textit{cannot-link}$ pairs) to guide the clustering direction. We query users with the most informative pairs, i.e., those pairs most hard to cluster and those most easy to miscluster, to facilitate the representation learning in terms of the clustering preference. Moreover, by exploiting attention mechanism, the targeted representation is learned and augmented. By leveraging the targeted representation and constrained contrastive loss as well, personalized clustering is obtained. Theoretically, we verify that the risk of personalized clustering is tightly bounded, guaranteeing that active queries to users do mitigate the clustering risk. Experimentally, extensive results show that our method performs well across different clustering tasks and datasets, even when only a limited number of queries are available.
