A Unified Perspective for Learning Graph Representations Across Multi-Level Abstractions
Mohamed Mahmoud Amar, Nairouz Mrabah, Mohamed Bouguessa, Abdoulaye Banir\'e Diallo

TL;DR
This paper introduces a unified contrastive learning framework for graphs that integrates multiple abstraction levels and employs a novel adaptive weighting mechanism, improving performance across various graph tasks.
Contribution
It proposes a comprehensive contrastive framework targeting multiple graph abstraction levels with a parameter-free self-weighting mechanism for better optimization.
Findings
Outperforms state-of-the-art methods on real-world datasets
Enhances optimization flexibility without hyperparameter tuning
Improves results in classification, clustering, and link prediction tasks
Abstract
Graph Self-Supervised Learning (GSSL) has emerged as a powerful paradigm for generating high-quality representations for graph-structured data. While multi-scale graph contrastive learning has received increasing attention, many existing methods still predominantly focus on a single graph abstraction level. To address this limitation, we propose a unified contrastive framework that can target node-level, proximity-level, cluster-level, and graph-level information and integrate them through a linear combination of similarity scores on positive pairs and dissimilarity scores (i.e., similarity scores on negative pairs). Furthermore, current approaches typically assign uniform penalty strengths to all examples, which reduces optimization flexibility and leads to ambiguous convergence status. To overcome this, we introduce a novel parameter-free fine-grained self-weighting mechanism that…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
