Please use this identifier to cite or link to this item: https://bura.brunel.ac.uk/handle/2438/34173
Full metadata record
DC FieldValueLanguage
dc.contributor.authorShakaa, Yamama-
dc.contributor.authorAburumman, Nadine-
dc.contributor.authorAnagnostou, Anastasia-
dc.contributor.authorTaylor, Simon-
dc.contributor.authorLi, Yongmin-
dc.coverage.spatialLondon, UK-
dc.date.accessioned2026-11-15T11:14:30Z-
dc.date.available2026-11-15T11:14:30Z-
dc.date.issued2026-08-15-
dc.identifier.citationShakaa, Y. et al. (2026) 'Automated Essay Marking with Data-Efficient Augmentation and Score-Token Weighted Loss', 2026 7th International Conference on Computer Vision and Data Mining (ICCVDM), London, UK, 15–17 August, pp. 356–364. doi: 10.1109/iccvdm71812.2026.11709134.en_US
dc.identifier.isbn9798319545886-
dc.identifier.isbn9798319545879-
dc.identifier.isbn9798319545893-
dc.identifier.urihttps://bura.brunel.ac.uk/handle/2438/34173-
dc.description.abstractAutomated Essay Scoring (AES) research has predominantly focused on holistic scoring, yet rubric-based trait scoring provides richer diagnostic feedback for both students and instructors. While encoder-based models such as BERT have achieved competitive trait scoring performance, they are limited to score prediction and cannot generate the explanatory feedback that makes rubric-based assessment educationally useful. Large Language Models (LLMs), by contrast, naturally support both scoring and feedback generation within a single unified framework. However, most existing work on fine-tuned LLM-based rubric scoring relies on either large annotated corpora or synthetic data augmentation to achieve competitive performance, limiting practical adoption in settings where neither is readily available. This paper investigates whether a small, carefully balanced dataset of real essays can enable a fine-tuned LLM to achieve competitive rubric-based trait scoring. We fine-tune Qwen2.5-7B-Instruct using QLoRA on progressively augmented subsets of DREsSNew (371, 478, and 736 essays), targeting under-represented score bands at each stage, and propose a score-token weighted loss function that concentrates the training signal on score-bearing tokens. Data augmentation drives the majority of the performance improvement: expanding from 371 to 736 essays yields gains of +0.042 QWK on Content, +0.021 on Organization, +0.041 on Language, 0.024 on Total. Score-token weighting provides a further modest but consistent improvement, most notably on Content (+0.025). Our best configuration achieves per-trait QWK of 0.631 (Content), 0.612 (Organization), 0.625 (Language), and 0.669 (Total) on the DREsSNew test set using only 736 real essays - remaining competitive with models trained on datasets over 65 times larger while preserving the generative capability needed for downstream feedback generation.en_US
dc.format.extentpp. 356–364-
dc.format.mediumPrint-Electronic-
dc.languageEnglishen_US
dc.language.isoen_USen_US
dc.publisherInstitute of Electrical and Electronics Engineers (IEEE)en_US
dc.rightsRe-use licence for this version: Creative Commons Attribution 4.0 International-
dc.rightsLicence for published version: Publisher's own licence-
dc.rights.urihttps://creativecommons.org/licenses/by/4.0/-
dc.source2026 7th International Conference on Computer Vision and Data Mining (ICCVDM)en_US
dc.subjecttext miningen_US
dc.subjectdata augmentationen_US
dc.subjecteducational data miningen_US
dc.subjectautomated essay scoringen_US
dc.subjectQLoRAen_US
dc.titleAutomated Essay Marking with Data-Efficient Augmentation and Score-Token Weighted Lossen_US
dc.typeConference paperen_US
dc.identifier.doihttps://doi.org/10.1109/iccvdm71812.2026.11709134-
dc.relation.isPartOf2026 7th International Conference on Computer Vision and Data Mining (ICCVDM)en_US
pubs.finish-date2026-08-17-
pubs.publication-statusPublished-
pubs.start-date2026-08-15-
dc.rights.licensehttps://creativecommons.org/licenses/by/4.0/legalcode.en-
dcterms.dateAccepted2026-06-01-
dcterms.issued2026-08-15-
dc.date.updated2026-11-15T11:07:13Z-
dc.rights.holderThe authors-
dc.contributor.orcidAburumman, Nadine [0000-0003-4578-8738]-
dc.contributor.orcidAnagnostou, Anastasia [0000-0003-3397-8307]-
dc.contributor.orcidTaylor, Simon [0000-0001-8252-0189]-
dc.contributor.orcidLi, Yongmin [0000-0003-1668-2440]-
Appears in Collections:Department of Computer Science Research Papers

Files in This Item:
File Description SizeFormat 
FullText.pdfCopyright ‘For the purpose of open access, the author has applied a ‘Creative Commons Attribution (CC BY) licence to any Author Accepted Manuscript version arising.’2.24 MBAdobe PDFView/Open


This item is licensed under a Creative Commons License Creative Commons