Graph Neural Networks (GNNs) achieve strong performance on node classification tasks, but their effectiveness often depends on the quality of the supervision, and real-world labels are often noisy. Learning curves—which describe how test performance scales with the number of labelled training nodes—have been extensively studied in classical machine learning, but their behaviour under realistic annotation noise in GNNs remains poorly explored.

We present a systematic empirical study of how three label noise protocols—symmetric random flipping, feature-dependent asymmetric flipping, and structure-dependent flipping—affect the learning curve shape of ChebNet across four benchmark graphs spanning homophilic and heterophilic structure, at noise rates η ∈ {0.1, 0.3, 0.5}.

The central finding is that noise does not simply shift the learning curve downward: above a moderate noise rate it reduces the effective slope, so the gap between clean and noisy performance widens as the label budget grows. Feature-dependent asymmetric noise is consistently the most harmful protocol across all datasets and budgets for η ≥ 0.3, while structure-dependent noise is the least harmful on homophilic graphs. On graphs where the model already operates near its performance limit, noise type has little practical effect.

These findings suggest that beyond a moderate noise rate, cleaning existing labels yields greater returns than acquiring more noisy ones, and that the nature of annotation error interacts with graph structure in ways that single-budget evaluations cannot detect. ... Read more