Can Model Fusing Help Transformers in Long Document Classification? An Empirical Study
원문 초록
Text classification is an area of research which has been studied over the years in Natural Language Processing (NLP). Adapting NLP to multiple domains has introduced many new challenges for text classification and one of them is long document classification. While state-of-the-art transformer models provide excellent results in text classification, most of them have limitations in the maximum sequence length of the input sequence. The majority of the transformer models are limited to 512 tokens, and therefore, they struggle with long document classification problems. In this research, we explore on employing Model Fusing for long document classification while comparing the results with well-known BERT and Longformer architectures.
함께 살펴볼 논문
공통 태그를 근거로 연결했습니다. 실제 인용 관계나 논문의 우수성을 뜻하지 않습니다.
TokenBreak: Bypassing Text Classification Models Through Token Manipulation
Incremental Sequence Classification with Temporal Consistency
Small Language Models in the Real World: Insights from Industrial Text Classification
Token Masking Improves Transformer-Based Text Classification
KDH-MLTC: Knowledge Distillation for Healthcare Multi-Label Text Classification
Towards Robust Few-Shot Text Classification Using Transformer Architectures and Dual Loss Strategies
토론
이 논문과 연결된 포럼 글이 아직 없습니다.