REVIEW 3 cited by
DiffCSE: Difference-based Contrastive Learning for Sentence Embeddings
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
read the original abstract
We propose DiffCSE, an unsupervised contrastive learning framework for learning sentence embeddings. DiffCSE learns sentence embeddings that are sensitive to the difference between the original sentence and an edited sentence, where the edited sentence is obtained by stochastically masking out the original sentence and then sampling from a masked language model. We show that DiffSCE is an instance of equivariant contrastive learning (Dangovski et al., 2021), which generalizes contrastive learning and learns representations that are insensitive to certain types of augmentations and sensitive to other "harmful" types of augmentations. Our experiments show that DiffCSE achieves state-of-the-art results among unsupervised sentence representation learning methods, outperforming unsupervised SimCSE by 2.3 absolute points on semantic textual similarity tasks.
Forward citations
Cited by 3 Pith papers
-
Quantum-inspired Embeddings Projection and Similarity Metrics for Representation Learning
A quantum-inspired, parameter-light projection head compressing BERT embeddings to 256 dimensions matches a classical dense head on TREC passage reranking and improves on small training sets.
-
HNCSE: Advancing Sentence Embeddings via Hybrid Contrastive Learning with Hard Negatives
HNCSE reports 2-point average STS gains over SimCSE using positive mixing and hard-negative mixing, but the method is under-specified and unverified.
-
Beyond Self-Consistency: Loss-Balanced Perturbation-Based Regularization Improves Industrial-Scale Ads Ranking
Adding low-weight noisy copies of training examples improves Meta's ads ranking by about 0.1% to 0.3% relative Normalized Entropy, and slightly outperforms self-consistency regularization.
Discussion (0). Continue with ORCID to comment.