Pith. Sign in

RECORD

Class-Aware Contrastive Optimization for Imbalanced Text Classification

Computation and Language · Submitted 29 Oct 2024

abstract compiled · 2026-09-23 · no language-model review

The authors' main claim In this paper, we show that leveraging class-aware contrastive optimization combined with denoising autoencoders can successfully tackle imbalanced text classification tasks, achieving better performance than the current state-of-the-art.

how it is stated · asserted 1.00 read the record →

Comment (0) Read on arXiv ↗
Cite ▾
arXiv ID2410.22197 (version 1)
Pith ID7J3CKBS5, Pith's permanent record of this paper and its review
CitationGrigorii Khvatskii, Khoa Doan, Nitesh V Chawla, Nuno Moniz. "Class-Aware Contrastive Optimization for Imbalanced Text Classification." arXiv:2410.22197 (2024). https://pith.science/paper/7J3CKBS5
Claim paper

The compiled record

The paper's own sentences, arranged. Each label is drawn from a closed vocabulary; the number beside it is the probability the classifier gave that label. Numbers in the tables are the authors', checked by code. No sentence in this record was written by a model.

Open the compiled record

Compiled by classifier-1.13.0 via TypeSafe API, question bank abstract-p1-20260923, 2026-09-23: 1 request, 4,948 input tokens.

What the abstract itself states, as probabilities: claims first 0.06 · states limitation 0.07 · human participants 0.03 · controlled comparison 0.69 · randomized assignment 0.01 · states quantitative result 0.04 · compares with prior results 0.97 · mentions code or data availability 0.02.

The abstract, sentence by sentence

arXiv listing abstract v1. Results and the main claim are underlined; .

The unique characteristics of text data make classification tasks a complex problem. Advances in unsupervised and semi-supervised learning and autoencoder architectures addressed several challenges. However, they still struggle with imbalanced text classification tasks, a common scenario in real-world applications, demonstrating a tendency to produce embeddings with unfavorable properties, such as class overlap. In this paper, we show that leveraging class-aware contrastive optimization combined with denoising autoencoders can successfully tackle imbalanced text classification tasks, achieving better performance than the current state-of-the-art. Concretely, our proposal combines reconstruction loss with contrastive class separation in the embedding space, allowing a better balance between the truthfulness of the generated embeddings and the model's ability to separate different classes. Compared with an extensive set of traditional and state-of-the-art competing methods, our proposal demonstrates a notable increase in performance across a wide variety of text datasets.

background contribution method result interpretation main claim

What the classifier reports for each sentence. The number is the probability it gave the label.
#sentencerolethe authors' own workstates the main conclusionstrength
s0 The unique characteristics of text data make classification tasks a complex problem. background 1.00 0.05 0.01 asserted 1.00
s1 Advances in unsupervised and semi-supervised learning and autoencoder architectures addressed several challenges. background 1.00 0.04 0.02 asserted 1.00
s2 However, they still struggle with imbalanced text classification tasks, a common scenario in real-world applications, demonstrating a tendency to produce embeddings with unfavorable properties, such as class overlap. gap 0.78 0.08 0.03 asserted 0.99
s3 In this paper, we show that leveraging class-aware contrastive optimization combined with denoising autoencoders can successfully tackle imbalanced text classification tasks, achieving better performance than the current state-of-the-art. contribution 0.95 0.95 0.95 asserted 1.00
s4 Concretely, our proposal combines reconstruction loss with contrastive class separation in the embedding space, allowing a better balance between the truthfulness of the generated embeddings and the model's ability to separate different classes. method 0.99 0.88 0.09 asserted 0.95
s5 Compared with an extensive set of traditional and state-of-the-art competing methods, our proposal demonstrates a notable increase in performance across a wide variety of text datasets. result 1.00 0.95 0.20 asserted 1.00

What kind of paper the classifier reports this is: method or tool 1.00 · evidence from observation or experiment 0.93.

What was examined, and what was not

sources read
  • arXiv listing abstract v1
not examined
  • full text
  • figures and tables
  • references and citing sentences
  • relations to other papers
levels run
  • P abstract
not run
  • S sections
  • T body sentences
  • C citations
  • R cross-paper relations

Every quoted sentence on this record is the authors'. Every label is from Pith's closed vocabulary, with the probability shown beside it. Every number in the measurements table is the authors', checked by code. Record as JSON

The paper
Original abstract

The unique characteristics of text data make classification tasks a complex problem. Advances in unsupervised and semi-supervised learning and autoencoder architectures addressed several challenges. However, they still struggle with imbalanced text classification tasks, a common scenario in real-world applications, demonstrating a tendency to produce embeddings with unfavorable properties, such as class overlap. In this paper, we show that leveraging class-aware contrastive optimization combined with denoising autoencoders can successfully tackle imbalanced text classification tasks, achieving better performance than the current state-of-the-art. Concretely, our proposal combines reconstruction loss with contrastive class separation in the embedding space, allowing a better balance between the truthfulness of the generated embeddings and the model's ability to separate different classes. Compared with an extensive set of traditional and state-of-the-art competing methods, our proposal demonstrates a notable increase in performance across a wide variety of text datasets.

Human review
How the literature uses it

What this paper does with the arXiv papers it cites

Each citing sentence is taken from the citing paper's LaTeX source and typed by Pith's classifier. A label appears at probability 0.8 or more (0.95 for support), a contest at 0.7 or more; the quoted words are the citing authors'. How each label was checked · JSON

What it cites · 16 sentences without a confident label

Uses the method or tool of 3 papers
Cites as support 2 papers
Cites as background 12 papers
  • Furthermore, a notion of supervised contrastive loss based on distances of samples from different classes was proposed for computer vision tasks [ref] .

    Supervised Contrastive Learning · Related Work · 0.85

  • Starting with SMOTE [ref] , these techniques have focused on synthesizing new data examples not previously seen in text data.

    SMOTE: Synthetic Minority Over-sampling Technique · Related Work · 0.88

  • Transformer-based model architectures have produced a new state-of-the-art (SOTA) performance on many natural language processing tasks such as machine translation [ref] , question answering [ref] , text generation [ref] , text-to-image translation [ref] , as well as a variety of text classification and information extraction tasks [ref] .

    Sentence-BERT: Sentence Embeddings using Siamese BERT-Networks · Introduction · 0.98

Discussion

Know something about this paper? Leave a comment, or highlight any passage above to comment on it.