CLOT: CONTRASTIVE LEARNING-DRIVEN AND OPTIMAL TRANSPORT-BASED TRAINING FOR SIMULTANEOUS CLUSTERING

被引:3
|
作者
Aburidi, Mohammed [1 ]
Marcia, Roummel [1 ]
机构
[1] Univ Calif Merced, Dept Appl Math, Merced, CA 95343 USA
关键词
Contrastive learning; optimal transport; representation learning; clustering; self-supervised learning;
D O I
10.1109/ICIP49359.2023.10222290
中图分类号
TP18 [人工智能理论];
学科分类号
081104 ; 0812 ; 0835 ; 1405 ;
摘要
Clustering via representation learning is one of the most promising approaches for self-supervised learning of deep neural networks. It aims at obtaining artificial supervisory signals from unlabeled data. In this paper, we propose an online clustering method called CLOT (Contrastive Learning-Driven and Optimal Transport-Based Clustering) that is based on robust and multiple losses training settings. More specifically, CLOT learns representations by contrasting both the features at the latent space and the cluster assignments. In the first stage, CLOT performs the instance- and cluster-level contrastive learning which is respectively conducted by maximizing the similarities of the projections of positive pairs (views of the same image) while minimizing those of negative ones (views of the rest of images). In the second stage, it extends standard cross-entropy minimization to an optimal transport problem and solves it using a fast variant of the Sinkhorn-Knopp algorithm to produce the cluster assignments. Further, it enforces consistency between the produced assignments obtained from views of the same image. Compared to the state of the arts, the proposed CLOT outperforms eight competitive clustering methods on three challenging benchmarks, namely, CIFAR-100, STL-10, and ImageNet-10 for ResNet-34.
引用
收藏
页码:1515 / 1519
页数:5
相关论文
共 50 条
  • [1] Toward Interpretable Semantic Textual Similarity via Optimal Transport-based Contrastive Sentence Learning
    Lee, Seonghyeon
    Lee, Dongha
    Jang, Seongbo
    Yu, Hwanjo
    PROCEEDINGS OF THE 60TH ANNUAL MEETING OF THE ASSOCIATION FOR COMPUTATIONAL LINGUISTICS (ACL 2022), VOL 1: (LONG PAPERS), 2022, : 5969 - 5979
  • [2] Enhancing Multi-modal Contrastive Learning via Optimal Transport-Based Consistent Modality Alignment
    Zhu, Sidan
    Luo, Dixin
    PATTERN RECOGNITION AND COMPUTER VISION, PRCV 2024, PT XI, 2025, 15041 : 157 - 171
  • [3] An Unbalanced Optimal Transport-Based Approach for Robust Dictionary Learning
    Wang, Shengjia
    Wang, Zhiguo
    Zhao, Xi-Le
    Shen, Xiaojing
    IEEE TRANSACTIONS ON NEURAL NETWORKS AND LEARNING SYSTEMS, 2025,
  • [4] Wasserstein Dictionary Learning: Optimal Transport-Based Unsupervised Nonlinear Dictionary Learning
    Schmitz, Morgan A.
    Heitz, Matthieu
    Bonneel, Nicolas
    Ngole, Fred
    Coeurjolly, David
    Cuturi, Marco
    Peyre, Gabriel
    Starck, Jean-Luc
    SIAM JOURNAL ON IMAGING SCIENCES, 2018, 11 (01): : 643 - 678
  • [5] Efficient and Effective Optimal Transport-Based Biclustering
    Fettal, Chakib
    Labiod, Lazhar
    Nadif, Mohamed
    ADVANCES IN NEURAL INFORMATION PROCESSING SYSTEMS 35, NEURIPS 2022, 2022,
  • [6] An optimal transport-based characterization of convex order
    Wiesel, Johannes
    Zhang, Erica
    DEPENDENCE MODELING, 2023, 11 (01):
  • [7] Learning Common Semantics via Optimal Transport for Contrastive Multi-View Clustering
    Zhang, Qian
    Zhang, Lin
    Song, Ran
    Cong, Runmin
    Liu, Yonghuai
    Zhang, Wei
    IEEE TRANSACTIONS ON IMAGE PROCESSING, 2024, 33 : 4501 - 4515
  • [8] Optimal Transport-Based One-Shot Federated Learning for Artificial Intelligence of Things
    Chiang, Yi-Han
    Terai, Koudai
    Chiang, Tsung-Wei
    Lin, Hai
    Ji, Yusheng
    Lui, John C. S.
    IEEE INTERNET OF THINGS JOURNAL, 2024, 11 (02) : 2166 - 2180
  • [9] Optimal Transport-Based Polar Interpolation of Directional Fields
    Solomon, Justin
    Vaxman, Amir
    ACM TRANSACTIONS ON GRAPHICS, 2019, 38 (04):
  • [10] Convergence Properties of Optimal Transport-Based Temporal Networks
    Baptista, Diego
    De Bacco, Caterina
    COMPLEX NETWORKS & THEIR APPLICATIONS X, VOL 1, 2022, 1015 : 578 - 592