Pith. sign in

REVIEW 2 cited by

Contrastive Learning with Negative Sampling Correction

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 2401.08690 v1 pith:M3HGUF45 submitted 2024-01-13 cs.LG

classification cs.LG
keywords contrastivelearningnegativepositivepuclsampleslosssampling
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

As one of the most effective self-supervised representation learning methods, contrastive learning (CL) relies on multiple negative pairs to contrast against each positive pair. In the standard practice of contrastive learning, data augmentation methods are utilized to generate both positive and negative pairs. While existing works have been focusing on improving the positive sampling, the negative sampling process is often overlooked. In fact, the generated negative samples are often polluted by positive samples, which leads to a biased loss and performance degradation. To correct the negative sampling bias, we propose a novel contrastive learning method named Positive-Unlabeled Contrastive Learning (PUCL). PUCL treats the generated negative samples as unlabeled samples and uses information from positive samples to correct bias in contrastive loss. We prove that the corrected loss used in PUCL only incurs a negligible bias compared to the unbiased contrastive loss. PUCL can be applied to general contrastive learning problems and outperforms state-of-the-art methods on various image and graph classification tasks. The code of PUCL is in the supplementary file.

Discussion (0). Sign in to comment.

Forward citations

Cited by 2 Pith papers

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

  1. jina-reranker-v3.5: An Efficient Listwise Reranker with Hybrid Attention and Self-Distillation

    cs.IR 2026-07 conditional novelty 6.0 of 10

    jina-reranker-v3.5, a 0.6B listwise reranker with a 3L2G hybrid attention schedule and three-stage self-distillation, scores 63.20 nDCG@10 on BEIR and runs up to 1.56x faster than its predecessor.

  2. AbLWR:A Context-Aware Listwise Ranking Framework for Antibody-Antigen Binding Affinity Prediction via Positive-Unlabeled Learning

    cs.LG 2026-04 unverdicted novelty 5.0 of 10

    AbLWR turns affinity prediction into listwise ranking with positive-unlabeled learning and context-aware attention, claiming over 10% better Precision@1 than baselines on cross-validation and case studies for influenz...

Pith tools