Pith. sign in

REVIEW 1 cited by

Revisiting Recommendation Loss Functions through Contrastive Learning (Technical Report)

Not yet reviewed by Pith; the record is open.

This paper has not been read by Pith yet. Machine review is queued; the pith claim, tier, and objections will appear here once it completes.

SPECIMEN: schema-true, not a live event

T0 review · schema-true

One-sentence machine reading of the paper's core claim.

pith:XXXXXXXX · record.json · timestamp

arxiv 2312.08520 v2 pith:RWEWNPKC submitted 2023-12-13 cs.AI

classification cs.AI
keywords contrastivedebiasedinfoncelossrecommendationlearninglossesmine
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original 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.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 1 Pith paper

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. Full citation record

  1. Future Link Prediction Without Memory or Aggregation

    cs.LG 2025-05 conditional novelty 6.0 of 10

    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.

Pith tools