Unfolding the Network of Peer Grades: A Latent Variable Approach
Giuseppe Mignemi, Yunxiao Chen, Irini Moustaki

TL;DR
This paper presents a Bayesian latent variable model for analyzing peer grading networks, improving grade accuracy, assessing grader reliability, and providing insights into grading behaviors in MOOCs and classrooms.
Contribution
It introduces a novel Bayesian latent variable framework that accounts for grader effects and complex dependencies in peer grading data, enhancing accuracy and interpretability.
Findings
More accurate aggregated grades than simple averages.
Ability to identify reliable graders and provide grading feedback.
Insights into the relationship between student performance and grading reliability.
Abstract
Peer grading is an educational system in which students assess each other's work. It is commonly applied under Massive Open Online Course (MOOC) and offline classroom settings. With this system, instructors receive a reduced grading workload, and students enhance their understanding of course materials by grading others' work. Peer grading data have a complex dependence structure, for which all the peer grades may be dependent. This complex dependence structure is due to a network structure of peer grading, where each student can be viewed as a vertex of the network, and each peer grade serves as an edge connecting one student as a grader to another student as an examinee. This paper introduces a latent variable model framework for analyzing peer grading data and develops a fully Bayesian procedure for its statistical inference. This framework has several advantages. First, when…
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.
