Logits Reranking via Semantic Labels for Hard Samples in Text Classification (2024.findings-emnlp)
Copied to clipboard
| Challenge: | Existing research on text classification models ignores the semantic information inherent in labels, treating them as one-hot vectors. |
| Approach: | They propose a model-agnostic method that leverages label semantics and auto detection of hard samples to improve classification accuracy. |
| Outcome: | The proposed method shows significant improvements across different PLMs. |
Similar Papers
Reranking for Neural Semantic Parsing (P19-1)
Copied to clipboard
| Challenge: | Semantic parsing is the task of transducing natural language utterances into machine executable meaning representations (e.g., Python code). |
| Approach: | They propose to rerank an n-best list of predicted MRs and use features to fix observed problems with baseline models to improve parser performance. |
| Outcome: | The proposed method outperforms the best published neural parser on four datasets and improves the baseline parsing performance by 5.7% and 2.9%. |
LLMs Can Also Do Well! Breaking Barriers in Semantic Role Labeling via Large Language Models (2025.findings-acl)
Copied to clipboard
| Challenge: | Semantic role labeling (SRL) is a crucial task of natural language processing (NLP). |
| Approach: | They propose to equip LLMs with retrieval-augmented generation and self-correction mechanisms to enable SRL to perform better in Chinese and English. |
| Outcome: | The proposed method achieves state-of-the-art in Chinese and English on three widely-used benchmarks. |
FIRST: Faster Improved Listwise Reranking with Single Token Decoding (2024.emnlp-main)
Copied to clipboard
| Challenge: | Existing listwise LLMs lack efficiency as they provide ranking output in the form of a generated ordered sequence of candidate passage identifiers. |
| Approach: | They propose a listwise LLM reranking approach that leverages the first generated identifier to obtain a ranked ordering of the candidates. |
| Outcome: | The proposed approach accelerates inference by 50% while maintaining robust ranking performance with gains across BEIR benchmark. |
PRP-Graph: Pairwise Ranking Prompting to LLMs with Graph Aggregation for Effective Text Re-ranking (2024.acl-long)
Copied to clipboard
| Challenge: | Existing methods for pairing ranking prompting only output the same label for comparison results of different confidence intervals without considering the uncertainty of pairwise comparison. |
| Approach: | They propose a pairwise ranking prompting approach that exploits the output probabilities of target labels to capture the degree of certainty of comparison results. |
| Outcome: | The proposed method shows strong robustness and acceptable efficiency on the BEIR benchmark. |
Don’t Miss the Labels: Label-semantic Augmented Meta-Learner for Few-Shot Text Classification (2021.findings-acl)
Copied to clipboard
| Challenge: | Existing studies focus on building a meta-learner from input text but ignore abundant semantic information beneath class labels. |
| Approach: | They propose a framework to make full use of label semantics in few-shot text classification systems. |
| Outcome: | The proposed framework can be plugged into the existing few-shot text classification system. |
Logits-Based Finetuning (2025.emnlp-main)
Copied to clipboard
| Challenge: | Existing methods for developing compact and efficient large language models lack token-level dependencies and linguistic diversity. |
| Approach: | They propose a logits-based fine-tuning framework that integrates supervised learning and knowledge distillation to build enriched training targets using teacher logits and ground truth labels. |
| Outcome: | The proposed method outperforms existing methods on a large-scale logits dataset and a series of science-focused models. |
Large Language Models Do Multi-Label Classification Differently (2025.emnlp-main)
Copied to clipboard
| Challenge: | Multi-label classification is prevalent in real-world settings, but the behavior of Large Language Models (LLMs) in this setting is understudied. |
| Approach: | They propose to use initial probability distributions to analyze output distributions of LLMs at each label generation step to find out how LLM models perform multi-label classification. |
| Outcome: | The proposed methods improve alignment and predictive performance over existing methods. |
Label Smoothing for Text Mining (2022.coling-1)
Copied to clipboard
| Challenge: | Existing text mining models are trained with 0-1 hard label that indicates whether an instance belongs to a class, ignoring rich information of the relevance degree. |
| Approach: | They propose a keyword-based method to automatically generate soft labels from hard labels . they exploit relevance between labels and instances to incorporate them into models . |
| Outcome: | The proposed method improves models under balanced and unbalanced conditions. |
Consolidating Ranking and Relevance Predictions of Large Language Models through Post-Processing (2024.emnlp-main)
Copied to clipboard
| Challenge: | Existing approaches to generate relevance labels for large language models have not been successful in generating relevance labels. |
| Approach: | They propose a method to combine LLM relevance labels with ranking abilities . they take both LLM generated relevance labels and pairwise preferences . |
| Outcome: | The proposed method balances the ranking and labeling abilities of large language models . it takes both LLM generated relevance labels and pairwise preferences . |
Comparing Text Representations: A Theory-Driven Approach (2021.emnlp-main)
Copied to clipboard
| Challenge: | Recent advances in NLP have been made by learning representations that transform complex tasks into simple classification tasks. |
| Approach: | They propose a method to evaluate the compatibility between representations and tasks by fitting text features to specific characteristics of text datasets. |
| Outcome: | The proposed model provides a calibrated, quantitative measure of the difficulty of a classification-based NLP task. |