COIN: Graph Contrastive Learning with Orthogonal Continuous Augmentation and Information Balance
Graph contrastive learning has demonstrated success in generating high-quality node representations. Existing data augmentation and pretext tasks for unsupervised graph contrastive learning reslut in suboptimal node representations. In this paper, we propose COIN, a new graph contrastive learning framework with continuous orthogonal augmentation and information balancing, to improve model performance. We introduce a continuous view augmenter with a masked topology module and a cross-channel feature module to adaptively capture both topological and feature information, preventing dimensional collapse. We further propose the InfoBal principle to balance consistency and diversity across views, and to enable effective utilization of representational information. Extensive experiments demonstrate that COIN outperforms state-of-the-art frameworks.
Authors
- Yingxia Shao (ORCID: https://orcid.org/0000-0002-8559-2628)
- Meiyu Liang (ORCID: https://orcid.org/0000-0003-1835-1848)
- Zhenyu Lin (ORCID: https://orcid.org/0000-0001-7890-6812)
- Guanhua Ye (ORCID: https://orcid.org/0000-0002-1683-1875)
- Yawen Li (ORCID: https://orcid.org/0000-0003-2662-3444)
- Hongzheng Li (ORCID: https://orcid.org/0000-0002-8377-5367)
Institutions
- Beijing University of Posts and Telecommunications (CN)
- Inspur (China) (CN)
Publication Details
- Journal
- Data Science and Engineering
- Published
- 2026-04-27
- DOI
- https://doi.org/10.1007/s41019-025-00333-7
- Primary Topic
- Advanced Graph Neural Networks
- Type
- article
- Field-Weighted Citation Impact
- 0.00
Funders
- National Natural Science Foundation of China
- Beijing Nova Program