Deep fine-grained clustering with model reusing

Deep clustering, which extends deep models to the clustering task, has attracted many attentions due to the high clustering performance. However, conventional deep clustering method assume that sample in different class are slightly different. Real application is complicated where observations are achieved from highly similar samples. In this paper, we study this fine-grained clustering task, while traditional coarse-grained clustering has difficulty capturing subtle semantic differences, which often leads to unclear decision boundaries between clusters of similar features. Our goal is to learn feature representations that encourage fine-grained data to form clear cluster boundaries in the embedding space. In this paper, we investigate the fine-grained clustering task and propose a novel model reuse framework. This framework outperforms existing fine-grained clustering methods by enhancing clustering consistency and robustness. For consistency, it employs low-rank optimization, which enforces stable and high-confidence predictions across augmented views of the same sample. For robustness, it leverages sparsification guided by reused models; this facilitates better handling of intra-class variances and inter-class similarities without converging to trivial solutions. We unify our model in a low rank optimization model. Specially, our model is guided by high-confidence groups through a reused model to perform sparsification of augmented matrices of different perturbations of the same sample to achieve low rank, thereby producing consistent and high-confidence clustering results. And we theoretically prove that low rank of sample augmented matrices can be achieved under our sparsification conditions, thus providing a powerful fine-grained unsupervised alternative. Our method achieves state-of-the-art clustering performance on three fine-grained image datasets.