CRAFT replaces memory and aggregation with learnable node embeddings and destination-to-source-neighbor cross-attention, improving future link prediction on most of 17 temporal graph benchmarks.
Revisiting Recommendation Loss Functions through Contrastive Learning (Technical Report)
1 Pith paper cite this work. Polarity classification is still indexing.
abstract
Inspired by the success of contrastive learning, we systematically examine recommendation losses, including listwise (softmax), pairwise (BPR), and pointwise (MSE and CCL) losses. In this endeavor, we introduce InfoNCE+, an optimized generalization of InfoNCE with balance coefficients, and highlight its performance advantages, particularly when aligned with our new decoupled contrastive loss, MINE+. We also leverage debiased InfoNCE to debias pointwise recommendation loss (CCL) as Debiased CCL. Interestingly, our analysis reveals that linear models like iALS and EASE are inherently debiased. Empirical results demonstrates the effectiveness of MINE+ and Debiased-CCL.
citation-role summary
citation-polarity summary
fields
cs.LG 1years
2025 1verdicts
CONDITIONAL 1roles
background 1polarities
background 1representative citing papers
citing papers explorer
-
Future Link Prediction Without Memory or Aggregation
CRAFT replaces memory and aggregation with learnable node embeddings and destination-to-source-neighbor cross-attention, improving future link prediction on most of 17 temporal graph benchmarks.