paper-with-me

홈 › Papers

Re-embedding Difficult Samples via Mutual Information Constrained Semantically Oversampling for Imbalanced Text Classification

2021-11-01 · EMNLP 2021 11 · Jiachen Tian, Shizhan Chen, Xiaowang Zhang, Zhiyong Feng, Deyi Xiong, Shaojuan Wu, Chunliu Dou

Difficult samples of the minority class in imbalanced text classification are usually hard to be classified as they are embedded into an overlapping semantic region with the majority class. In this paper, we propose a Mutual Information constrained Semantically Oversampling framework (MISO) that can generate anchor instances to help the backbone network determine the re-embedding position of a non-overlapping representation for each difficult sample. MISO consists of (1) a semantic fusion module that learns entangled semantics among difficult and majority samples with an adaptive multi-head attention mechanism, (2) a mutual information loss that forces our model to learn new representations of entangled semantics in the non-overlapping region of the minority class, and (3) a coupled adversarial encoder-decoder that fine-tunes disentangled semantic representations to remain their correlations with the minority class, and then using these disentangled semantic representations to generate anchor instances for each difficult sample. Experiments on a variety of imbalanced text classification tasks demonstrate that anchor instances help classifiers achieve significant improvements over strong baselines.

📄 PDF Abstract BibTeX

Code (0)

등록된 구현이 없습니다.

Tasks

Decodertext-classificationText Classification

Similar Papers 제목 키워드 기반

Formal Limitations on the Measurement of Mutual Information

2018-11-10 · ICLR 2019 5 · David McAllester, Karl Stratos

Measuring mutual information from finite data is difficult. Recent work has considered variational methods maximizing a lower bound. In this paper, we prove that serious statistical limitations are inherent to any method…

LSMI-Sinkhorn: Semi-supervised Mutual Information Estimation with Optimal Transport

2019-09-05 · Yanbin Liu, Makoto Yamada, Yao-Hung Hubert Tsai, Tam Le 외

Estimating mutual information is an important statistics and machine learning problem. To estimate the mutual information from data, a common practice is preparing a set of paired samples $\{(\mathbf{x}_i,\mathbf{y}_i)\}…

BIG-bench Machine LearningMutual Information Estimation

Estimating Mutual Information Between Dense Word Embeddings

2020-07-01 · ACL 2020 6 · Vitalii Zhelezniak, Aleks Savkov, ar, Nils Hammerla

Word embedding-based similarity measures are currently among the top-performing methods on unsupervised semantic textual similarity (STS) tasks. Recent work has increasingly adopted a statistical view on these embeddings…

Semantic Textual SimilaritySTSWord Embeddings

On Mutual Information in Contrastive Learning for Visual Representations

2020-05-27 · Mike Wu, Chengxu Zhuang, Milan Mosse, Daniel Yamins 외

In recent years, several unsupervised, "contrastive" learning algorithms in vision have been shown to learn representations that perform remarkably well on transfer tasks. We show that this family of algorithms maximizes…

Contrastive LearningGeneral ClassificationInstance SegmentationKeypoint Detection+3

Interpretable Topic Extraction and Word Embedding Learning using row-stochastic DEDICOM

2025-07-22 · Lars Hillebrand, David Biesner, Christian Bauckhage, Rafet Sifa arxiv

The DEDICOM algorithm provides a uniquely interpretable matrix factorization method for symmetric and asymmetric square matrices. We employ a new row-stochastic variation of DEDICOM on the pointwise mutual information ma…