Enhancing Marker Scoring Accuracy through Ordinal Confidence Modelling in Educational Assessments
Abhirup Chakravarty, Mark Brenchley, Trevor Breakspear, Ian Lewin, Yan Huang

TL;DR
This paper improves automated essay scoring reliability by modeling ordinal confidence, using novel loss functions and score binning to accurately predict CEFR levels, enabling more trustworthy score releases.
Contribution
It introduces Kernel Weighted Ordinal Categorical Cross Entropy loss functions and score binning to enhance confidence estimation in AES systems.
Findings
Achieved an F1 score of 0.97 in confidence prediction.
Enabled 47% of scores to be released with 100% CEFR agreement.
System maintains 99% CEFR agreement at 95% confidence threshold.
Abstract
A key ethical challenge in Automated Essay Scoring (AES) is ensuring that scores are only released when they meet high reliability standards. Confidence modelling addresses this by assigning a reliability estimate measure, in the form of a confidence score, to each automated score. In this study, we frame confidence estimation as a classification task: predicting whether an AES-generated score correctly places a candidate in the appropriate CEFR level. While this is a binary decision, we leverage the inherent granularity of the scoring domain in two ways. First, we reformulate the task as an n-ary classification problem using score binning. Second, we introduce a set of novel Kernel Weighted Ordinal Categorical Cross Entropy (KWOCCE) loss functions that incorporate the ordinal structure of CEFR labels. Our best-performing model achieves an F1 score of 0.97, and enables the system to…
Peer Reviews
No public reviews on file for this paper yet. If you reviewed it on a platform where reviews are public (OpenReview, ICLR, NeurIPS, ICML), you can paste yours below so the community can read it here.
Videos
No videos yet. Explain this paper in a talk, walkthrough, or lecture? Add one.
Taxonomy
MethodsAttention Model · Sparse Evolutionary Training
