TY - GEN
T1 - A Case for Bayesian Grading
AU - Zilles, Craig
AU - Zhao, Chenyan
AU - Chen, Yuxuan
AU - Matthews, Evan Michael
AU - West, Matthew
N1 - Publisher Copyright:
© 2024 Owner/Author.
PY - 2024/12/5
Y1 - 2024/12/5
N2 - Academic integrity continues to be an issue in education. Students' grades are often computed using a collection of evidence that varies in its trustworthiness (e.g., a proctored exam can be trusted more than an out-of-class programming project) due to practical constraints. When a student cheats, their trusted and less trustworthy scores are inconsistent, which presents instructors a choice between rewarding the cheating behavior and the burden of investigating / making cheating allegations. In this position paper, we propose that Bayesian inference might be a useful tool in assigning grades derived from trusted and less trusted evidence. Rather than compute grades by performing arithmetic on both trusted and untrusted assessments, we instead try to infer a latent variable, the student's mastery of the course material, from these observed performances and their potential for cheating. Key to this approach is that grades can be assigned that discount suspicious work without needing to explicitly make a cheating allegation. A logical conclusion of this approach is that the needed amount of trusted assessments for a given student depends on how inconsistent are their trusted and untrusted assessments.
AB - Academic integrity continues to be an issue in education. Students' grades are often computed using a collection of evidence that varies in its trustworthiness (e.g., a proctored exam can be trusted more than an out-of-class programming project) due to practical constraints. When a student cheats, their trusted and less trustworthy scores are inconsistent, which presents instructors a choice between rewarding the cheating behavior and the burden of investigating / making cheating allegations. In this position paper, we propose that Bayesian inference might be a useful tool in assigning grades derived from trusted and less trusted evidence. Rather than compute grades by performing arithmetic on both trusted and untrusted assessments, we instead try to infer a latent variable, the student's mastery of the course material, from these observed performances and their potential for cheating. Key to this approach is that grades can be assigned that discount suspicious work without needing to explicitly make a cheating allegation. A logical conclusion of this approach is that the needed amount of trusted assessments for a given student depends on how inconsistent are their trusted and untrusted assessments.
KW - bayesian inference
KW - cheating
KW - grading
KW - trust
UR - http://www.scopus.com/inward/record.url?scp=85215533251&partnerID=8YFLogxK
UR - http://www.scopus.com/inward/citedby.url?scp=85215533251&partnerID=8YFLogxK
U2 - 10.1145/3649165.3703624
DO - 10.1145/3649165.3703624
M3 - Conference contribution
AN - SCOPUS:85215533251
T3 - SIGCSE Virtual 2024 - Proceedings of the 2024 ACM Virtual Global Computing Education Conference V. 1
SP - 275
EP - 278
BT - SIGCSE Virtual 2024 - Proceedings of the 2024 ACM Virtual Global Computing Education Conference V. 1
PB - Association for Computing Machinery
T2 - 1st ACM Virtual Global Computing Education Conference V. 1, SIGCSE Virtual 2024
Y2 - 5 December 2024 through 8 December 2024
ER -