mlsanityData to 7 Oct 2026

Empirical Comparison of Encoder-Based Language Models and Feature-Based Supervised Machine Learning Approaches to Automated Scoring of Long Essays

arXiv 2601.02659 ↗First posted 6 Jan 2026cs.CL cs.LGcited by 0

Not on the map. Why?

Abstract (arXiv)

Long context may impose challenges for encoder-only language models in text processing, specifically for automated scoring of essays. This study trained several commonly used encoder-based language models for automated scoring of long essays. The performance of these trained models was evaluated and compared with the ensemble models built upon the base language models with a token limit of 512?. The experimented models include BERT-based models (BERT, RoBERTa, DistilBERT, and DeBERTa), ensemble models integrating embeddings from multiple encoder models, and ensemble models of feature-based supervised machine learning models, including Gradient-Boosted Decision Trees, eXtreme Gradient Boosting, and Light Gradient Boosting Machine. We trained, validated, and tested each model on a dataset of 17,307 essays, with an 80%/10%/10% split, and evaluated model performance using Quadratic Weighted Kappa. This study revealed that an ensemble-of-embeddings model that combines multiple pre-trained language model representations with gradient-boosting classifier as the ensemble model significantly outperforms individual language models at scoring long essays.

Key facts. No citing papers in the map yet (data through 7 Oct 2026). Builds on 24 of its 52 references that are in the map. First posted on arXiv 6 Jan 2026.

Builds on

24 of 52 references.

References · 24

  1. 2017Attention Is All You Needcited by 59,932
  2. 2018BERT: Pre-training of Deep Bidirectional Transformers for Language Understandingcited by 40,204
  3. 2019Exploring the Limits of Transfer Learning with a Unified Text-to-Text Transformercited by 14,491
  4. 2021LoRA: Low-Rank Adaptation of Large Language Modelscited by 14,084
  5. 2019RoBERTa: A Robustly Optimized BERT Pretraining Approachcited by 13,266
  6. 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,120
  7. 2019DistilBERT, a distilled version of BERT: smaller, faster, cheaper and lightercited by 4,243
  8. 2020DeBERTa: Decoding-enhanced BERT with Disentangled Attentioncited by 2,157
  9. 2024Gemma 2: Improving Open Language Models at a Practical Sizecited by 1,928
  10. 2020Big Bird: Transformers for Longer Sequencescited by 1,673
  11. 2019What Does BERT Look At? An Analysis of BERT's Attentioncited by 994
  12. 2018Fundamentals of Recurrent Neural Network (RNN) and Long Short-Term Memory (LSTM) Networkcited by 415
12 more
  1. 2024Hybrid LLM: Cost-Efficient and Quality-Aware Query Routingcited by 354
  2. 2023Parameter-Efficient Fine-Tuning Methods for Pretrained Language Models: A Critical Review and Assessmentcited by 227
  3. 2021QuALITY: Question Answering with Long Input Texts, Yes!cited by 204
  4. 2019HIBERT: Document Level Pre-training of Hierarchical Bidirectional Transformers for Document Summarizationcited by 120
  5. 2022On the Use of BERT for Automated Essay Scoring: Joint Learning of Multi-Scale Essay Representationcited by 46
  6. 2020PARADE: Passage Representation Aggregation for Document Rerankingcited by 44
  7. 2022Automated Scoring for Reading Comprehension via In-context BERT Tuningcited by 15
  8. 2019Automated Essay Scoring based on Two-Stage Learningcited by 12
  9. 2022Quantized Training of Gradient Boosting Decision Treescited by 6
  10. 2020Corruption Is Not All Bad: Incorporating Discourse Structure into Pre-training via Corruption for Essay Scoringcited by 4
  11. 2025Exploration of Summarization by Generative Language Models for Automated Scoring of Long Essayscited by 2
  12. 2025Exploring the Utilities of the Rationales from Large Language Models to Enhance Automated Essay Scoringcited by 1

Built on by

Not cited yet.