Robust Text Classifier on Test-Time Budgets
원문 초록
We propose a generic and interpretable learning framework for building robust text classification model that achieves accuracy comparable to full models under test-time budget constraints. Our approach learns a selector to identify words that are relevant to the prediction tasks and passes them to the classifier for processing. The selector is trained jointly with the classifier and directly learns to incorporate with the classifier. We further propose a data aggregation scheme to improve the robustness of the classifier. Our learning framework is general and can be incorporated with any type of text classification model. On real-world data, we show that the proposed approach improves the performance of a given classifier and speeds up the model with a mere loss in accuracy performance.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
Specialized text classification: an approach to classifying Open Banking transactions
Universal Training of Neural Networks to Achieve Bayes Optimal Classification Accuracy
Making Language Model a Hierarchical Classifier and Generator
Robustness of Misinformation Classification Systems to Adversarial Examples Through BeamAttack
Prompt Candidates, then Distill: A Teacher-Student Framework for LLM-driven Data Annotation
PRL: Prompts from Reinforcement Learning
토론
이 논문과 연결된 포럼 글이 아직 없습니다.