Negative Metric Learning for Graphs
Graph contrastive learning (GCL) often suffers from false negatives, which degrades the performance on downstream tasks. The existing methods addressing the false negative issue usually rely on human prior knowledge, still leading GCL to suboptimal results. In this paper, we propose a novel Negative Metric Learning (NML) enhanced GCL (NML-GCL). NML-GCL employs a learnable Negative Metric Network (NMN) to build a negative metric space, in which false negatives can be distinguished better from true negatives based on their distance to anchor node. To overcome the lack of explicit supervision signals for NML, we propose a joint training scheme with bi-level optimization objective, which implicitly utilizes the self-supervision signals to iteratively optimize the encoder and the negative metric network. The solid theoretical analysis and the extensive experiments conducted on widely used benchmarks verify the superiority of the proposed method.
Code (0)
등록된 구현이 없습니다.
Tasks
Contrastive LearningMetric LearningMethods 이 논문이 사용한 방법론
Similar Papers 제목 키워드 기반
Smoothed Graph Contrastive Learning via Seamless Proximity Integration
Graph contrastive learning (GCL) aligns node representations by classifying node pairs into positives and negatives using a selection process that typically relies on establishing correspondences within two augmented gra…
Contrastive LearningSigned graphs in data sciences via communicability geometry
Signed graphs are an emergent way of representing data in a variety of contexts where antagonistic interactions exist. These include data from biological, ecological, and social systems. Here we propose the concept of co…
Dimensionality ReductionStudy of Manifold Geometry using Multiscale Non-Negative Kernel Graphs
Modern machine learning systems are increasingly trained on large amounts of data embedded in high-dimensional spaces. Often this is done without analyzing the structure of the dataset. In this work, we propose a framewo…
graph constructionregressionA Unified Framework for Rank-based Evaluation Metrics for Link Prediction in Knowledge Graphs
The link prediction task on knowledge graphs without explicit negative triples in the training data motivates the usage of rank-based metrics. Here, we review existing rank-based metrics and propose desiderata for improv…
BenchmarkingGraph EmbeddingKnowledge Graph EmbeddingKnowledge Graphs+1On Robustness of Consensus over Pseudo-Undirected Path Graphs
Consensus over networked agents is typically studied using undirected or directed communication graphs. Undirected graphs enforce symmetry in information exchange, leading to convergence to the average of initial states,…