COIN: Graph Contrastive Learning with Orthogonal Continuous Augmentation and Information Balance
Year: 2026
Type: article
Abstract: 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.
Source: Data Science and Engineering
Language: English
Subfield: Artificial Intelligence
Field: Computer Science
Domain: Physical Sciences
Open Access status: gold
Estimated APC paid: $1,390
Awards: G421627741, G4755484798, G6749463622
OpenAlex ID: W7156335663
