Pith. sign in

REVIEW 3 cited by

Not All Negatives are Equal: Label-Aware Contrastive Loss for Fine-grained Text Classification

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 2109.05427 v1 pith:F4LHOEQ6 submitted 2021-09-12 cs.CL cs.AI

classification cs.CLcs.AI
keywords contrastiveclassificationfine-grainedclassesconfusablenegativeslabel-awarelarger
verification ladder T0 review T1 audit T2 compute T3 formal
0 comments
read the original abstract

Fine-grained classification involves dealing with datasets with larger number of classes with subtle differences between them. Guiding the model to focus on differentiating dimensions between these commonly confusable classes is key to improving performance on fine-grained tasks. In this work, we analyse the contrastive fine-tuning of pre-trained language models on two fine-grained text classification tasks, emotion classification and sentiment analysis. We adaptively embed class relationships into a contrastive objective function to help differently weigh the positives and negatives, and in particular, weighting closely confusable negatives more than less similar negative examples. We find that Label-aware Contrastive Loss outperforms previous contrastive methods, in the presence of larger number and/or more confusable classes, and helps models to produce output distributions that are more differentiated.

Discussion (0). Continue with ORCID to comment.

Forward citations

Cited by 3 Pith papers

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

  1. CLASS: Contrastive Learning via Action Sequence Supervision for Robot Manipulation

    cs.RO 2025-08 unverdicted novelty 6.0 of 10

    CLASS pre-training with Diffusion Policy reaches 75% average success under visual shifts where baseline behavior cloning methods fail.

  2. Domain Lexical Knowledge-based Word Embedding Learning for Text Classification under Small Data

    cs.CL 2025-06 conditional novelty 5.0 of 10

    A lexical-knowledge projection of BERT word embeddings, trained with center loss, improves small-data text classification accuracy across six datasets.

  3. Supervised Contrastive Learning for Ordinal Engagement Measurement

    cs.CV 2025-05 conditional novelty 5.0 of 10

    A supervised contrastive ordinal classifier with time-series augmentation improves minority-class recall on DAiSEE, but not overall accuracy, and the best non-contrastive baseline nearly matches it.

Pith tools