Relation-Aware Dual-View Graph Contrastive Learning with Huber Covariance Whitening

Self-supervised graph collaborative filtering suffers from two geometric pathologies. In Dimensional Collapse, embeddings quietly collapse into a low-rank subspace, a well-documented but poorly solved problem. Semantic Collapse is more complex: stiff L2-squared orthogonalization penalties that are supposed to push the embeddings apart end up ripping through the heavy-tailed community overlaps that contain the collaborative signal. Earlier studies attempted to mitigate sparsity by injecting static noise or structural perturbations, but such interventions did not pinpoint the root cause, i.e., the distortions in the global covariance geometry itself. In this paper, we propose a Huber-Contrastive Graph Convolutional Network (HCGCN) that combines a spatial message-passing backbone with an O(1) contrastive augmentation overhead and a Relation-Aware Dual-View Gated Contrastive Network. The main novelty is a Huber Covariance Whitening module that imposes a geometry-aware threshold on the cross-correlation matrix of augmented views—below the threshold, the gradients follow an L2 penalty (enforcing uniformity); above it, the penalty flattens to L1 (protecting genuine semantic clusters from gradient explosion). This theoretically motivated dual-regime penalty actively preserves the macro-semantic topology of the graph while aggressively stamping out spurious noise correlations. The HCGCN is evaluated on the Yelp2018, Amazon-Book, and MovieLens datasets and performs significantly better than state-of-the-art baselines like LightGCN, SGL, SimGCL, and NESCL, especially under severe cold-start settings where covariance regulation proves most critical.