Negative samples play a crucial role in graph contrastive learning (GCL), yet existing methods mainly focus on which negatives should be selected, mined, filtered, or progressively introduced. Less attention has been given to separating the negative candidates available to an anchor from the subset that actively participates in optimization, and to adapting this exposure according to training behavior. To address this gap, we propose the Adaptive Negative Scheduling for Graph Contrastive Learning (AdNGCL) framework, which maintains a bounded per-anchor candidate reservoir and periodically reassesses candidate hardness as representations evolve. Its core component, Hardness-Aware Negative Scheduling (HANS), uses a category-specific training-response signal to determine whether exposure to easy, intermediate, or hard negatives should increase at each scheduling opportunity. Furthermore, reliability-aware candidate refresh handles potentially positive-like candidates, while within-category diversity refresh changes active identities without altering HANS-controlled exposure. AdNGCL retains a standard symmetric InfoNCE objective. Experiments on ten benchmark datasets against state-of-the-art self-supervised graph learning methods show that AdNGCL achieves the highest mean Micro-F1 among the evaluated methods on eight datasets, with improvements of up to 1.30 percentage points over the second-best method, ranks second on Actor, and remains competitive on Coauthor-CS. Ablation, sensitivity, scheduler and reliability diagnostics, and computational analyses further examine the behavior and contribution of the proposed mechanisms.

翻译：暂无翻译