mlsanityData to 7 Oct 2026

P2OT: Progressive Partial Optimal Transport for Deep Imbalanced Clustering

arXiv 2401.09266 ↗First posted 17 Jan 2024cs.CVcited by 13

Not on the map. Why?

Abstract (arXiv)

Deep clustering, which learns representation and semantic clustering without labels information, poses a great challenge for deep learning-based approaches. Despite significant progress in recent years, most existing methods focus on uniformly distributed datasets, significantly limiting the practical applicability of their methods. In this paper, we first introduce a more practical problem setting named deep imbalanced clustering, where the underlying classes exhibit an imbalance distribution. To tackle this problem, we propose a novel pseudo-labeling-based learning framework. Our framework formulates pseudo-label generation as a progressive partial optimal transport problem, which progressively transports each sample to imbalanced clusters under prior distribution constraints, thus generating imbalance-aware pseudo-labels and learning from high-confident samples. In addition, we transform the initial formulation into an unbalanced optimal transport problem with augmented constraints, which can be solved efficiently by a fast matrix scaling algorithm. Experiments on various datasets, including a human-curated long-tailed CIFAR100, challenging ImageNet-R, and large-scale subsets of fine-grained iNaturalist2018 datasets, demonstrate the superiority of our method.

Key facts. Cited by 13 papers in the map (data through 7 Oct 2026). Builds on 38 of its 55 references that are in the map. First posted on arXiv 17 Jan 2024.

Builds on

38 of 55 references.

References · 38

  1. 2020An Image is Worth 16x16 Words: Transformers for Image Recognition at Scalecited by 29,915
  2. 2021Masked Autoencoders Are Scalable Vision Learnerscited by 7,339
  3. 2021Emerging Properties in Self-Supervised Vision Transformerscited by 6,893
  4. 2020Unsupervised Learning of Visual Features by Contrasting Cluster Assignmentscited by 2,845
  5. 2013Sinkhorn Distances: Lightspeed Computation of Optimal Transportation Distancescited by 2,277
  6. 2017Improved Training of Wasserstein GANscited by 2,223
  7. 2020FixMatch: Simplifying Semi-Supervised Learning with Consistency and Confidencecited by 2,080
  8. 2020The Many Faces of Robustness: A Critical Analysis of Out-of-Distribution Generalizationcited by 1,842
  9. 2016Temporal Ensembling for Semi-Supervised Learningcited by 1,054
  10. 2018Deep Clustering for Unsupervised Learning of Visual Featurescited by 1,020
  11. 2019Learning Imbalanced Datasets with Label-Distribution-Aware Margin Losscited by 987
  12. 2018Computational Optimal Transportcited by 765
26 more
  1. 2021FlexMatch: Boosting Semi-Supervised Learning with Curriculum Pseudo Labelingcited by 537
  2. 2019Self-labelling via simultaneous clustering and representation learningcited by 525
  3. 2019Pseudo-Labeling and Confirmation Bias in Deep Semi-Supervised Learningcited by 507
  4. 2015Optimal Transport for Domain Adaptationcited by 457
  5. 2018Invariant Information Clustering for Unsupervised Image Classification and Segmentationcited by 454
  6. 2020SCAN: Learning to Classify Images without Labelscited by 351
  7. 2020Contrastive Clusteringcited by 264
  8. 2021Distribution Alignment: A Unified Framework for Long-tail Visual Recognitioncited by 198
  9. 2015Learning with a Wasserstein Losscited by 194
  10. 2021CReST: A Class-Rebalancing Self-Training Framework for Imbalanced Semi-Supervised Learningcited by 174
  11. 2015Optimal Entropy-Transport problems and a new Hellinger-Kantorovich distance between positive measurescited by 138
  12. 2021Self-supervised Learning is More Robust to Dataset Imbalancecited by 122
  13. 2021SPICE: Semantic Pseudo-labeling for Image Clusteringcited by 104
  14. 2022A Comprehensive Survey on Deep Clustering: Taxonomy, Challenges, and Future Directionscited by 73
  15. 2021Clustering-friendly Representation Learning via Instance Discrimination and Feature Decorrelationcited by 65
  16. 2021Learning Representation for Clustering via Prototype Scattering and Positive Samplingcited by 58
  17. 2022Unified Optimal Transport Framework for Universal Domain Adaptationcited by 57
  18. 2022DeepDPM: Deep Clustering With an Unknown Number of Clusterscited by 52
  19. 2021Self-Damaging Contrastive Learningcited by 48
  20. 2021You Never Cluster Alonecited by 38
  21. 2023Reverse Engineering Self-Supervised Learningcited by 33
  22. 2021Sinkhorn Label Allocation: Semi-Supervised Classification via Annealed Self-Trainingcited by 32
  23. 2022Contrastive Learning with Boosted Memorizationcited by 26
  24. 2023Novel Class Discovery for Long-tailed Recognitioncited by 19
  25. 2023DivClust: Controlling Diversity in Deep Clusteringcited by 18
  26. 2023CSOT: Curriculum and Structure-Aware Optimal Transport for Learning with Noisy Labelscited by 17

Built on by

Cited by year (2026 to 7 Oct)

Citing papers per year: 2024: 3; 2025: 5; 2026: 5.

13 papers.

Sort: