mlsanityData to 14 Oct 2026

HTG-GCL: Leveraging Hierarchical Topological Granularity from Cellular Complexes for Graph Contrastive Learning

arXiv 2512.02073 ↗First posted 30 Nov 2025cs.LG cs.AIcited by 0

Not on the map. Why?

Abstract (arXiv)

Graph contrastive learning (GCL) aims to learn discriminative semantic invariance by contrasting different views of the same graph that share critical topological patterns. However, existing GCL approaches with structural augmentations often struggle to identify task-relevant topological structures, let alone adapt to the varying coarse-to-fine topological granularities required across different downstream tasks. To remedy this issue, we introduce Hierarchical Topological Granularity Graph Contrastive Learning (HTG-GCL), a novel framework that leverages transformations of the same graph to generate multi-scale ring-based cellular complexes, embodying the concept of topological granularity, thereby generating diverse topological views. Recognizing that a certain granularity may contain misleading semantics, we propose a multi-granularity decoupled contrast and apply a granularity-specific weighting mechanism based on uncertainty estimation. Comprehensive experiments on various benchmarks demonstrate the effectiveness of HTG-GCL, highlighting its superior performance in capturing meaningful graph representations through hierarchical topological information.

Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 20 of its 26 references that are in the map. First posted on arXiv 30 Nov 2025.

Builds on

20 of 26 references.

References · 20

  1. 2020A Simple Framework for Contrastive Learning of Visual Representationscited by 12,049
  2. 2018How Powerful are Graph Neural Networks?cited by 4,393
  3. 2016node2vec: Scalable Feature Learning for Networkscited by 1,918
  4. 2020Graph Contrastive Learning with Augmentationscited by 1,208
  5. 2020TUDataset: A collection of benchmark datasets for learning with graphscited by 728
  6. 2020Contrastive Multi-View Representation Learning on Graphscited by 652
  7. 2021Graph Contrastive Learning Automatedcited by 287
  8. 2017graph2vec: Learning Distributed Representations of Graphscited by 230
  9. 2021Weisfeiler and Lehman Go Topological: Message Passing Simplicial Networkscited by 221
  10. 2021Weisfeiler and Lehman Go Cellular: CW Networkscited by 218
  11. 2021Adversarial Graph Augmentation to Improve Graph Contrastive Learningcited by 200
  12. 2022SimGRACE: A Simple Framework for Graph Contrastive Learning without Data Augmentationcited by 171
8 more
  1. 2021Trusted Multi-View Classificationcited by 94
  2. 2020Cell Complex Neural Networkscited by 67
  3. 2024Towards Graph Contrastive Learning: A Survey and Beyondcited by 26
  4. 2022Bootstrapping Informative Graph Augmentation via A Meta Learning Approachcited by 6
  5. 2014Amortized tildeO(|V|)-Delay Algorithm for Listing Chordless Cycles in Undirected Graphscited by 5
  6. 2022Modeling Multiple Views via Implicitly Preserving Global Consistency and Local Complementaritycited by 5
  7. 2024Graph Learning with Distributional Edge Layoutscited by 2
  8. 2025CellCLAT: Preserving Topology and Trimming Redundancy in Self-Supervised Cellular Contrastive Learningcited by 1

Built on by

Not cited yet.