CellCLAT: Preserving Topology and Trimming Redundancy in Self-Supervised Cellular Contrastive Learning
Not on the map. Why?
Abstract (arXiv)
Self-supervised topological deep learning (TDL) represents a nascent but underexplored area with significant potential for modeling higher-order interactions in simplicial complexes and cellular complexes to derive representations of unlabeled graphs. Compared to simplicial complexes, cellular complexes exhibit greater expressive power. However, the advancement in self-supervised learning for cellular TDL is largely hindered by two core challenges: textitextrinsic structural constraints inherent to cellular complexes, and intrinsic semantic redundancy in cellular representations. The first challenge highlights that traditional graph augmentation techniques may compromise the integrity of higher-order cellular interactions, while the second underscores that topological redundancy in cellular complexes potentially diminish task-relevant information. To address these issues, we introduce Cellular Complex Contrastive Learning with Adaptive Trimming (CellCLAT), a twofold framework designed to adhere to the combinatorial constraints of cellular complexes while mitigating informational redundancy. Specifically, we propose a parameter perturbation-based augmentation method that injects controlled noise into cellular interactions without altering the underlying cellular structures, thereby preserving cellular topology during contrastive learning. Additionally, a cellular trimming scheduler is employed to mask gradient contributions from task-irrelevant cells through a bi-level meta-learning approach, effectively removing redundant topological elements while maintaining critical higher-order semantics. We provide theoretical justification and empirical validation to demonstrate that CellCLAT achieves substantial improvements over existing self-supervised graph learning methods, marking a significant attempt in this domain.
Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 31 of its 55 references that are in the map. First posted on arXiv 27 May 2025.
Builds on
31 of 55 references.
References · 31
- 2017Neural Message Passing for Quantum Chemistrycited by 3,487
- 2016Categorical Reparameterization with Gumbel-Softmaxcited by 2,739
- 2016node2vec: Scalable Feature Learning for Networkscited by 1,918
- 2018Unsupervised Feature Learning via Non-Parametric Instance-level Discriminationcited by 1,845
- 2018DARTS: Differentiable Architecture Searchcited by 1,798
- 2020Understanding Contrastive Representation Learning through Alignment and Uniformity on the Hyperspherecited by 1,405
- 2020Graph Contrastive Learning with Augmentationscited by 1,208
- 2016The Concrete Distribution: A Continuous Relaxation of Discrete Random Variablescited by 1,148
- 2020TUDataset: A collection of benchmark datasets for learning with graphscited by 728
- 2019Graph Neural Networks for Social Recommendationcited by 714
- 2019InfoGraph: Unsupervised and Semi-supervised Graph-Level Representation Learning via Mutual Information Maximizationcited by 441
- 2021Graph Contrastive Learning Automatedcited by 287
19 more
- 2017graph2vec: Learning Distributed Representations of Graphscited by 230
- 2021Weisfeiler and Lehman Go Topological: Message Passing Simplicial Networkscited by 221
- 2021Weisfeiler and Lehman Go Cellular: CW Networkscited by 218
- 2021Adversarial Graph Augmentation to Improve Graph Contrastive Learningcited by 200
- 2022SimGRACE: A Simple Framework for Graph Contrastive Learning without Data Augmentationcited by 171
- 2020Simplicial Neural Networkscited by 110
- 2022Topological Deep Learning: Going Beyond Graph Datacited by 97
- 2019Self-Supervised Generalisation with Meta Auxiliary Learningcited by 88
- 2021Topological Graph Neural Networkscited by 87
- 2021Principled Simplicial Neural Networks for Trajectory Predictioncited by 77
- 2020Cell Complex Neural Networkscited by 67
- 2021Topological Relational Learning on Graphscited by 27
- 2023On the Expressivity of Persistent Homology in Graph Learningcited by 19
- 2024TopoTune : A Framework for Generalized Combinatorial Complex Neural Networkscited by 18
- 2023Rethinking Dimensional Rationale in Graph Contrastive Learning from Causal Perspectivecited by 13
- 2024Topological Blindspots: Understanding and Extending Topological Deep Learning Through the Lens of Expressivitycited by 9
- 2023Hierarchical Topology Isomorphism Expertise Embedded Graph Contrastive Learningcited by 6
- 2014Amortized tildeO(|V|)-Delay Algorithm for Listing Chordless Cycles in Undirected Graphscited by 5
- 2024CliquePH: Higher-Order Information for Graph Neural Networks through Persistent Homology on Clique Graphscited by 3
Built on by
Citing papers per year: 2025: 1.
1 paper.