Upper Bounding Barlow Twins: A Novel Filter for Multi-Relational Clustering
Multi-relational clustering is a challenging task due to the fact that diverse semantic information conveyed in multi-layer graphs is difficult to extract and fuse. Recent methods integrate topology structure and node attribute information through graph filtering. However, they often use a low-pass filter without fully considering the correlation among multiple graphs. To overcome this drawback, we propose to learn a graph filter motivated by the theoretical analysis of Barlow Twins. We find that input with a negative semi-definite inner product provides a lower bound for Barlow Twins loss, which prevents it from reaching a better solution. We thus learn a filter that yields an upper bound for Barlow Twins. Afterward, we design a simple clustering architecture and demonstrate its state-of-the-art performance on four benchmark datasets.
Code (1)
Tasks
AttributeClusteringMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
BarlowRL: Barlow Twins for Data-Efficient Reinforcement Learning
This paper introduces BarlowRL, a data-efficient reinforcement learning agent that combines the Barlow Twins self-supervised learning framework with DER (Data-Efficient Rainbow) algorithm. BarlowRL outperforms both DER a…
reinforcement-learningReinforcement LearningSelf-Supervised LearningDinoTwins: Combining DINO and Barlow Twins for Robust, Label-Efficient Vision Transformers
Training AI models to understand images without costly labeled data remains a challenge. We combine two techniques--DINO (teacher-student learning) and Barlow Twins (redundancy reduction)--to create a model that learns b…
Self-Supervised LearningSemantic SegmentationAudio Barlow Twins: Self-Supervised Audio Representation Learning
The Barlow Twins self-supervised learning objective requires neither negative samples or asymmetric learning updates, achieving results on a par with the current state-of-the-art within Computer Vision. As such, we prese…
Environmental Sound ClassificationEvent DetectionRepresentation LearningSelf-Supervised LearningA Note on Connecting Barlow Twins with Negative-Sample-Free Contrastive Learning
In this report, we relate the algorithmic design of Barlow Twins' method to the Hilbert-Schmidt Independence Criterion (HSIC), thus establishing it as a contrastive learning approach that is free of negative samples. Thr…
Contrastive LearningSelf-Supervised LearningGuarding Barlow Twins Against Overfitting with Mixed Samples
Self-supervised Learning (SSL) aims to learn transferable feature representations for downstream applications without relying on labeled data. The Barlow Twins algorithm, renowned for its widespread adoption and straight…
Contrastive LearningSelf-Supervised Learning