arrow
Return

STTA: enhanced text classification via selective test-time augmentation

delete2023-12-19
delete0
delete
OA
AI
H
Haoyu Xiong
X
Xinchun Zhang
L
Leixin Yang
Y
Yu Xiang
Y
Yaping Zhang *
DOI:10.7717/peerj-cs.1757delete
deleteOriginal
deleteShare
deleteSave
View PDF
Abstract

Abstract

En 中文
Test-time augmentation (TTA) is a well-established technique that involves aggregating transformed examples of test inputs during the inference stage. The goal is to enhance model performance and reduce the uncertainty of predictions. Despite its advantages of not requiring additional training or hyperparameter tuning, and being applicable to any existing model, TTA is still in its early stages in the field of NLP. This is partly due to the difficulty of discerning the contribution of different transformed samples, which can negatively impact predictions. In order to address these issues, we propose Selective Test-Time Augmentation, called STTA, which aims to select the most beneficial transformed samples for aggregation by identifying reliable samples. Furthermore, we analyze and empirically verify why TTA is sensitive to some text data augmentation methods and reveal why some data augmentation methods lead to erroneous predictions. Through extensive experiments, we demonstrate that STTA is a simple and effective method that can produce promising results in various text classification tasks.
Keywords:
Text classification
Sentiment analysis
Data augmentation
Language model
Sentiment classification
Test-time augmentation
AI Summary

AI Summary

Key information extracted from the uploaded paper, including a brief overview, abstract, background, key highlights, visual analysis, and future outlook.

Journal

PeerJ Computer Science cover
PeerJ Computer Science
IF:
2.5
Papers:
3.4K
Citations:
6.9K

Organization

Y
yunnan normal university
Scholars:
4.8K
Papers: 2.7K
Citations: 9