CellCLAT: Preserving Topology and Trimming Redundancy in Self-Supervised Cellular Contrastive Learning
Bin Qin, Qirui Ji, Jiangmeng Li, Yupeng Wang, Xuesong Wu, Jianwen Cao, Fanjiang Xu
Abstract
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: extrinsic 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.
Ask about this paper
Your agent reads all of it.
Lune indexed this paper to the last equation, along with the top-tier papers that cite it. Ask a question and the answer quotes them.
Your agent calls
Luneget_paper_fulltext
Free to start. No credit card required.
Terminal
Install the CLIlune papers fulltext 7b31139f-48d9-4513-be71-b592718b2d79Cited by top-tier papers1
Ask how each one uses itBuilds on20
- Graph Contrastive Learning with AugmentationsYuning You, Tianlong Chen, Yongduo Sui, Ting Chen et al.NeurIPS 2020 · 3,042 citations
- Understanding Contrastive Representation Learning through Alignment and Uniformity on the HypersphereTongzhou Wang, Phillip IsolaICML 2020 · 2,360 citations
- InfoGraph: Unsupervised and Semi-supervised Graph-Level Representation Learning via Mutual Information MaximizationFan-Yun Sun, Jordan Hoffmann, Vikas Verma, Jian TangICLR 2020 · 1,010 citations
- Graph Contrastive Learning AutomatedYuning You, Tianlong Chen, Yang Shen, Zhangyang WangICML 2021 · 604 citations
- Adversarial Graph Augmentation to Improve Graph Contrastive LearningSusheel Suresh, Pan Li, Cong Hao, Jennifer NevilleNeurIPS 2021 · 475 citations
Related papers
- TopoSRL: Topology preserving self-supervised Simplicial Representation LearningHiren Madhu, Sundeep Prabhakar ChepuriNeurIPS 2023 · 8 citations
- Boosting Graph Contrastive Learning via Graph Contrastive SaliencyChunyu Wei, Yu Wang, Bing Bai, Kai Ni et al.ICML 2023 · 31 citations
- Contrastive Learning with Simplicial Convolutional Networks for Short-Text ClassificationHuang Liang, Benedict Lee, Daniel Hui Loong Ng, Kelin XiaICML 2025
- Self-Contrastive Graph Diffusion NetworkYixuan Ma, Kun ZhanACM MM 2023 · 15 citations
- CL-GCL: Comprehensive and Lightweight Graph Contrastive LearningJianqing Liang, Xinkai Wei, Zhiqiang LiICML 2026
