When in Doubt: Improving Classification Performance with Alternating Normalization (2021.findings-emnlp)
Copied to clipboard
| Challenge: | a classifier that uses a nonparametric post-processing step for classification suffers when given examples that are close to its decision boundary. |
| Approach: | They propose a nonparametric post-processing step that re-adjusts predicted class probability distributions using high-confidence validation examples. |
| Outcome: | The proposed method improves classifier accuracy on difficult examples. |
Similar Papers
Efficient, Uncertainty-based Moderation of Neural Networks Text Classifiers (2022.findings-acl)
Copied to clipboard
| Challenge: | A series of benchmarking experiments based on three different datasets and three state-of-the-art classifiers show that our framework can improve the classification F1-scores by 5.1 to 11.2% (up to approx. 98 to 99%) |
| Approach: | They propose a semi-automated approach that passes unconfident, probably incorrect classifications to human moderators to minimize the workload. |
| Outcome: | The proposed approach can improve the classification F1-scores by 5.1 to 11.2% (up to approx. 98 to 99%) while reducing the moderation load up to 73.3% compared to a random moderation. |
Generalized Entropy Regularization or: There’s Nothing Special about Label Smoothing (2020.acl-main)
Copied to clipboard
| Challenge: | Prior work has explored regularizing the output distributions of probabilistic models to alleviate overfitting. |
| Approach: | They propose a family of entropy regularizers that have a connection to regularization . they find that label smoothing provably does not allow for sparsity in an output distribution . |
| Outcome: | The proposed method improves the relationship between model entropy and performance on language generation tasks. |
Virtual Data Augmentation: A Robust and General Framework for Fine-tuning Pre-trained Models (2021.emnlp-main)
Copied to clipboard
| Challenge: | Recent studies have shown that powerful pre-trained language models can be fooled by small perturbations or intentional attacks. |
| Approach: | They propose a framework for fine-tuning PLMs using a masked language model and Gaussian noise to augment semantically relevant examples with sufficient diversity. |
| Outcome: | The proposed framework improves the robustness of pre-trained language models and alleviates performance degradation under adversarial attacks. |
Simple and effective data augmentation for compositional generalization (2024.naacl-long)
Copied to clipboard
| Challenge: | Compositional generalization is the ability of a system to correctly predict the meaning of complex sentences when trained on simpler sentences. |
| Approach: | They propose to use data augmentation methods to generate additional training data by sampling from an augmentation distribution to generalize to the out-of-distribution test data. |
| Outcome: | The proposed method outperforms existing methods that sampled from the training distribution and outperformed existing methods. |
Targeted Augmentation for Low-Resource Event Extraction (2024.findings-naacl)
Copied to clipboard
| Challenge: | Existing methods for low-resource information extraction struggle to strike a balance between weak augmentation and drastic augmentation. |
| Approach: | They propose a data augmentation paradigm that uses back validation and targeted augmentation to produce augmented examples with enhanced diversity, polarity, accuracy, and coherence. |
| Outcome: | The proposed paradigm produces augmented examples with enhanced diversity, polarity, accuracy, and coherence. |
EDA: Easy Data Augmentation Techniques for Boosting Performance on Text Classification Tasks (D19-1)
Copied to clipboard
| Challenge: | Existing data augmentation techniques for text classification are difficult to implement and cost a high amount of money. |
| Approach: | They propose to use four simple but powerful operations to boost performance on text classification tasks to improve synonym replacement, random insertion, random swap, and random deletion. |
| Outcome: | The proposed techniques improve performance on five classification tasks and are particularly useful for smaller datasets. |
Does Robustness Improve Fairness? Approaching Fairness with Word Substitution Robustness Methods for Text Classification (2021.findings-acl)
Copied to clipboard
| Challenge: | Existing methods to reduce disparities in model outcomes have focused on data augmentation, debiasing model embeddings, or adding fairness-based optimization objectives during training. |
| Approach: | They propose to use certified word substitution robustness methods to improve equality of odds and equality of opportunity on multiple text classification tasks. |
| Outcome: | The proposed methods improve equality of odds and equality of opportunity on multiple text classification tasks. |
TReX: Tokenizer Regression for Optimal Data Mixture (2026.eacl-long)
Copied to clipboard
| Challenge: | Existing approaches to train and inference tokenizers rely on heuristics or large-scale searches to determine optimal data mixtures. |
| Approach: | They propose a regression-based framework that efficiently predicts the optimal data mixture for tokenizer training. |
| Outcome: | The proposed model outperforms mixtures based on LLaMA3 and uniform distributions by up to 12% in both in- and out-of-distribution compression efficiency. |
EPiDA: An Easy Plug-in Data Augmentation Framework for High Performance Text Classification (2022.naacl-main)
Copied to clipboard
| Challenge: | Existing methods for data augmentation do not fully exploit the potential of DA in NLP. |
| Approach: | They propose an easy and plug-in framework for data augmentation to support effective text classification. |
| Outcome: | The proposed framework outperforms existing methods in most cases, but not using agent networks or pre-trained generation networks. |
EMS-SD: Efficient Multi-sample Speculative Decoding for Accelerating Large Language Models (2025.naacl-long)
Copied to clipboard
| Challenge: | Speculative decoding is a key technique for enhancing the inference speed of Large Language Models. |
| Approach: | They propose a method that adds padding tokens to ensure that the number of new tokens remains consistent across samples. |
| Outcome: | The proposed method can handle the issue of inconsistent prediction tokens without adding padding tokens. |