Adversarial Metric Learning for Fine-Grained Emotion Classification (2026.acl-long)
Copied to clipboard
| Challenge: | Recent advances in fine-grained emotion classification relied on contrastive learning with hard-pair mining. |
| Approach: | They propose an adversarial metric learning framework that replaces fixed similarity metrics with a learnable metric family and trains representations to remain discriminative under worst-case similarity distortions. |
| Outcome: | The proposed framework trains a pairwise discriminator to maximally confuse two hard pair types while training the encoder to remain discriminative under worst-case similarity distortions. |
Similar Papers
A Triple-View Framework for Fine-Grained Emotion Classification with Clustering-Guided Contrastive Learning (2025.acl-long)
Copied to clipboard
| Challenge: | Existing studies have focused on dealing with only one of the two difficulties of coarse-grained emotion classification. |
| Approach: | They propose a triple-view framework that treats FEC as an instance-label joint embedding learning problem to tackle both difficulties concurrently by considering three complementary views. |
| Outcome: | The proposed framework achieves significant and consistent improvements on two widely-used benchmark datasets. |
Not All Negatives are Equal: Label-Aware Contrastive Loss for Fine-grained Text Classification (2021.emnlp-main)
Copied to clipboard
| Challenge: | Fine-grained classification tasks involve distinguishing between classes with subtle differences between them. |
| Approach: | They analyse fine-grained text classification tasks by embedding class relationships into a contrastive objective function to help differently weigh the positives and negatives. |
| Outcome: | The proposed model outperforms previous contrastive methods on emotion classification and sentiment analysis. |
Label-Aware Hyperbolic Embeddings for Fine-grained Emotion Classification (2023.acl-long)
Copied to clipboard
| Challenge: | Existing models only address text classification problem in the euclidean space, which is not optimal . e.g., fear and terrified labels may not be differentiated in such space, harming performance . |
| Approach: | They propose a framework that can integrate hyperbolic embeddings to improve the task . they learn label embeddements in the hyperbolical space and then add them to the framework . |
| Outcome: | The proposed framework improves fine-grained emotion classification on two benchmark datasets with 3% improvement over previous state-of-the-art models. |
SoftMCL: Soft Momentum Contrastive Learning for Fine-grained Sentiment-aware Pre-training (2024.lrec-main)
Copied to clipboard
| Challenge: | Existing methods for pre-training language models capture general language understanding but fail to distinguish affective impact of a particular context to a specific word. |
| Approach: | They propose a soft momentum contrastive learning method for fine-grained sentiment-aware pre-training that uses valence ratings as soft-label supervision instead of hard labels. |
| Outcome: | The proposed method improves on four sentiment-related tasks and the results are published online. |
Neural Fine-Grained Entity Type Classification with Hierarchy-Aware Loss (N18-1)
Copied to clipboard
| Challenge: | Existing methods for fine-grained type classification rely on distant supervision and are susceptible to noisy labels that can be out-of-context or overly-specific. |
| Approach: | They propose a neural network model that uses cross-entropy loss function to handle out-of-context labels and hierarchical loss normalization to cope with overly-specific ones. |
| Outcome: | The proposed model outperforms the state-of-the-art on established benchmarks for the task. |
RELATE: Generating a linguistically inspired Knowledge Graph for fine-grained emotion classification (2022.lrec-1)
Copied to clipboard
| Challenge: | Existing knowledge resources for sentiment analysis (SA) tasks are either large, common-sense knowledge graphs (KGs) that cover a limited amount of polarities/emotions or they are smaller in size (e.g. lexicons) . however, these resources are limited by the low coverage of e.t. and scalability. |
| Approach: | They propose a new directed KG called ‘RELATE’ which incorporates the benefit of semantics without relying on costly human annotation. |
| Outcome: | The proposed KG overcomes low coverage of emotions and scalability issues . it is the first KG of its size to cover Ekman’s six basic emotions that are directed towards entities. |
Semantic alignment in hyperbolic space for fine-grained emotion classification (2025.acl-srw)
Copied to clipboard
| Challenge: | Existing approaches to fine-grained emotion classification operate in Euclidean space, where the flat geometry makes it difficult to distinguish semantically similar label labels. |
| Approach: | They propose a semantic alignment framework that leverages the Lorentz model of hyperbolic space to embed text and label representations into hyperbolical space via the exponential map. |
| Outcome: | The proposed framework improves on two benchmark FEC datasets. |
A Generic Method for Fine-grained Category Discovery in Natural Language Texts (2024.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods for fine-grained category discovery neglect semantic similarities of fine-grain categories. |
| Approach: | They propose a method that detects fine-grained clusters of semantically similar texts guided by a novel objective function. |
| Outcome: | The proposed method surpasses state-of-the-art methods on three benchmark tasks. |
CHEER-Ekman: Fine-grained Embodied Emotion Classification (2025.acl-short)
Copied to clipboard
| Challenge: | Emotions manifest through physical experiences and bodily reactions, yet identifying such embodied emotions in text remains understudied. |
| Approach: | They propose to extend existing binary embodied emotion dataset with Ekman’s six basic emotion categories. |
| Outcome: | The proposed dataset outperforms existing methods with large language models. |
Supervised Adversarial Contrastive Learning for Emotion Recognition in Conversations (2023.acl-long)
Copied to clipboard
| Challenge: | Existing methods to recognize emotions have limitations in discovering the intrinsic structure of data relevant to emotion labels, and struggle to extract generalized and robust representations. |
| Approach: | They propose a supervised adversarial contrastive learning framework for learning class-spread structured representations in a controlled manner. |
| Outcome: | The proposed framework can extract generalized and robust representations on three datasets and achieves state-of-the-art performance. |