Pith. sign in

REVIEW 2 cited by

Negative Sampling for Contrastive Representation Learning: A Review

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 2206.00212 v1 pith:4APF45BY submitted 2022-06-01 cs.IR

classification cs.IR
keywords learningnegativerepresentationcontrastivedomainsfutureresearchreview
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

The learn-to-compare paradigm of contrastive representation learning (CRL), which compares positive samples with negative ones for representation learning, has achieved great success in a wide range of domains, including natural language processing, computer vision, information retrieval and graph learning. While many research works focus on data augmentations, nonlinear transformations or other certain parts of CRL, the importance of negative sample selection is usually overlooked in literature. In this paper, we provide a systematic review of negative sampling (NS) techniques and discuss how they contribute to the success of CRL. As the core part of this paper, we summarize the existing NS methods into four categories with pros and cons in each genre, and further conclude with several open research questions as future directions. By generalizing and aligning the fundamental NS ideas across multiple domains, we hope this survey can accelerate cross-domain knowledge sharing and motivate future researches for better CRL.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 2 Pith papers

Reviewed papers in the Pith corpus that reference this work. Sorted by Pith novelty score. OpenAlex reports about 20 citations worldwide. Full citation record

  1. HYVINT: Intensity-Driven Hypergraph Generation with Variational Embeddings

    stat.ML 2026-05 unverdicted novelty 6.0 of 10

    HYVINT introduces an intensity-driven incidence mechanism and tractable variational estimator for hypergraph generation, with error bounds and empirical gains in fidelity, novelty, and diversity.

  2. ScalingNote: Scaling up Retrievers with Large Language Models for Real-World Dense Retrieval

    cs.IR 2024-11 conditional novelty 5.0 of 10

    Train dual LLM towers for dense retrieval, then distill the query tower into a small BERT encoder, keeping most of the accuracy gain without the online latency.

Pith tools