Weak Augmentation Guided Relational Self-Supervised Learning

• Published in: IEEE transactions on pattern analysis and machine intelligence Vol. PP; pp. 1 - 15
• Main Authors: Zheng, Mingkai, You, Shan, Wang, Fei, Qian, Chen, Zhang, Changshui, Wang, Xiaogang, Xu, Chang
• Format: Journal Article
• Language: English
• Published: United States IEEE 29.05.2024
• Subjects: Clustering algorithms; Contrastive Learning; Memory management; Representation learning; Self-Supervised Learning; Supervised learning; Task analysis; Training; Unsupervised Learning; Visualization
• ISSN: 0162-8828; 1939-3539; 2160-9292
• DOI: 10.1109/TPAMI.2024.3406907

Self-supervised Learning (SSL) including the mainstream contrastive learning has achieved great success in learning visual representations without data annotations. However, most methods mainly focus on the instance level information (ie, the different augmented images of the same instance should have the same feature or cluster into the same class), but there is a lack of attention on the relationships between different instances. In this paper, we introduce a novel SSL paradigm, which we term as relational self-supervised learning (ReSSL) framework that learns representations by modeling the relationship between different instances. Specifically, our proposed method employs sharpened distribution of pairwise similarities among different instances as relation metric, which is thus utilized to match the feature embeddings of different augmentations. To boost the performance, we argue that weak augmentations matter to represent a more reliable relation, and leverage momentum strategy for practical efficiency. The designed asymmetric predictor head and an InfoNCE warm-up strategy enhance the robustness to hyper-parameters and benefit the resulting performance. Experimental results show that our proposed ReSSL substantially outperforms the state-of-the-art methods across different network architectures, including various lightweight networks (eg, EfficientNet and MobileNet).