Pith. sign in

REVIEW 2 cited by

Unsupervised hard Negative Augmentation for contrastive learning

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.02594 v1 pith:AYU6P6EB submitted 2024-01-05 cs.CL

classification cs.CL
keywords negativeaugmentationhardmethodmodelsperformancetermstf-idf
verification ladder T0 review T1 audit T2 compute T3 formal

Signed reviews

No signed human review yet.

0 comments
read the original abstract

We present Unsupervised hard Negative Augmentation (UNA), a method that generates synthetic negative instances based on the term frequency-inverse document frequency (TF-IDF) retrieval model. UNA uses TF-IDF scores to ascertain the perceived importance of terms in a sentence and then produces negative samples by replacing terms with respect to that. Our experiments demonstrate that models trained with UNA improve the overall performance in semantic textual similarity tasks. Additional performance gains are obtained when combining UNA with the paraphrasing augmentation. Further results show that our method is compatible with different backbone models. Ablation studies also support the choice of having a TF-IDF-driven control on negative augmentation.

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. Full citation record

  1. Build it, Break it, Repeat: Benchmarking and improving LLM-manipulated disinformation detection in social media posts

    cs.CL 2026-08 conditional novelty 6.0 of 10

    An iterative adversarial framework shows that chained back-translation and persona rewrites flip detector labels up to 95% of the time, and a triplet contrastive detector with dynamic anchor switching remains the most robust.

  2. Informed Mixing -- Improving Open Set Recognition via Attribution-based Augmentation

    cs.CV 2025-05 conditional novelty 6.0 of 10

    GradMix masks the most attribution-activated image regions during training, pushing the model to learn additional features and improving open set recognition and robustness.

Pith tools