Enhancing Noise Resilience in Face Clustering via Sparse Differential Transformer
Not on the map. Why?
Abstract (arXiv)
The method used to measure relationships between face embeddings plays a crucial role in determining the performance of face clustering. Existing methods employ the Jaccard similarity coefficient instead of the cosine distance to enhance the measurement accuracy. However, these methods introduce too many irrelevant nodes, producing Jaccard coefficients with limited discriminative power and adversely affecting clustering performance. To address this issue, we propose a prediction-driven Top-K Jaccard similarity coefficient that enhances the purity of neighboring nodes, thereby improving the reliability of similarity measurements. Nevertheless, accurately predicting the optimal number of neighbors (Top-K) remains challenging, leading to suboptimal clustering results. To overcome this limitation, we develop a Transformer-based prediction model that examines the relationships between the central node and its neighboring nodes near the Top-K to further enhance the reliability of similarity estimation. However, vanilla Transformer, when applied to predict relationships between nodes, often introduces noise due to their overemphasis on irrelevant feature relationships. To address these challenges, we propose a Sparse Differential Transformer (SDT), instead of the vanilla Transformer, to eliminate noise and enhance the model's anti-noise capabilities. Extensive experiments on multiple datasets, such as MS-Celeb-1M, demonstrate that our approach achieves state-of-the-art (SOTA) performance, outperforming existing methods and providing a more robust solution for face clustering.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 18 of its 31 references that are in the map. First posted on arXiv 27 Dec 2025.
Builds on
18 of 31 references.
References · 18
- 2017Attention Is All You Needcited by 60,361
- 2016Semi-Supervised Classification with Graph Convolutional Networkscited by 11,361
- 2016MS-Celeb-1M: A Dataset and Benchmark for Large-Scale Face Recognitioncited by 624
- 2017Person Transfer GAN to Bridge Domain Gap for Person Re-Identificationcited by 480
- 2017Re-ranking Person Re-identification with k-reciprocal Encodingcited by 262
- 2021WebFace260M: A Benchmark Unveiling the Power of Million-Scale Deep Face Recognitioncited by 223
- 2019Linkage Based Face Clustering via Graph Convolution Networkcited by 55
- 2019Learning to Cluster Faces on an Affinity Graphcited by 50
- 2020Learning to Cluster Faces via Confidence and Connectivity Estimationcited by 42
- 2021Structure-Aware Face Clustering on a Large-Scale Graph with bf107 Nodescited by 21
- 2022Ada-NETS: Face Clustering via Adaptive Neighbour Discovery in the Structure Spacecited by 16
- 2017Face Clustering: Representation and Pairwise Constraintscited by 14
6 more
- 2022Learn to Cluster Faces via Pairwise Classificationcited by 7
- 2022On Mitigating Hard Clusters for Face Clusteringcited by 7
- 2021Learning to Cluster Faces via Transformercited by 5
- 2022FaceMap: Towards Unsupervised Face Clustering via Map Equationcited by 3
- 2022Robust Graph Structure Learning via Multiple Statistical Testscited by 3
- 2024Face Clustering via Early Stopping and Edge Recallcited by 1
Built on by
Not cited yet.