MétaCan
Menu
Back to cohort
Record W2945134239 · doi:10.65109/ecst4444

Report-Sensitive Spot-Checking in Peer-Grading Systems

2019· article· en· W2945134239 on OpenAlex

Why this work is in the frame

A frame that forgets how it found something cannot be audited. These are the routes that admitted this work.

affAt least one author lists a Canadian institution in the pinned OpenAlex snapshot.

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldComputer Science
TopicMachine Learning and Algorithms
Canadian institutionsUniversity of British Columbia
Fundersnot available
KeywordsGrading (engineering)Computer scienceScalabilityIncentiveObstacleHomogeneousGround truthTheoretical computer scienceMathematical proofMathematics educationArtificial intelligenceMathematics

Abstract

fetched live from OpenAlex

Peer grading systems make large courses more scalable, provide students with faster and more detailed feedback, and help teach students to think critically about the work of others. Various recent implementations of peer grading mechanisms make such systems relatively easy to deploy in practice [2, 11, 24]. The broader adoption of such systems faces a common, critical obstacle: motivating students to provide accurate grades. A natural solution is asking multiple students to grade the same assignment and rewarding them based on their behavior (e.g., based on the extent to which their grades agree with the grades given by other students). Such solutions have been explored in detail in a large literature on peer prediction, which considers how to incentivize agents to truthfully disclose unverifiable private information [4, 7-10, 12-17, 22, 23]. Unfortunately, almost all known peer prediction mechanisms also give rise to uninformative equilibria in which agents do not reveal their private information; e.g., all students grading an assignment favorably regardless of its quality [1, 8, 10, 17, 22]. Human experiments show that such strategic behavior does arise in practice [5].

Fetched live from OpenAlex and de-inverted. Abstracts are not stored in this database: the inverted indexes are 8.6 GB of the frame’s 9.3 GB of text, and the host has 13 GB free.

Full frame distilled prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. Learned from the 10,348 direct Codex labels and 10,348 direct Gemma labels. Candidate is the union of thresholded teacher heads; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels or direct frontier model labels.

metaresearch head score (Codex)0.001
metaresearch head score (Gemma)0.000
Version: codex-gemma-dda1882f352aValidation status: machine_predicted_unvalidated
Candidate categoriesnone
Consensus categoriesnone
DomainCandidate signal: none · Consensus signal: none
Study designCandidate signal: Simulation or modeling · Consensus signal: none
GenreCandidate signal: Empirical · Consensus signal: Empirical
Teacher disagreement score0.934
Threshold uncertainty score0.355

Codex and Gemma teacher scores by category

CategoryCodexGemma
Metaresearch0.0010.000
Meta-epidemiology (narrow)0.0000.000
Meta-epidemiology (broad)0.0000.000
Bibliometrics0.0000.000
Science and technology studies0.0000.000
Scholarly communication0.0000.000
Open science0.0000.000
Research integrity0.0000.000
Insufficient payload (model declined to judge)0.0000.000

Machine scores (provisional)

The two teacher heads of the student model, read on this work. A score orders the frame for review; it never asserts a category, and the validation status ships verbatim with every row.

Baseline scores from an immature model (maturity gate not passed, 7 training rounds). Scores rank; they never assert a category.

Opus teacher head0.010
GPT teacher head0.253
Teacher spread0.242 · how far apart the two teachers sit on this one work
Validation statusscore_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from it

Quick stats

Citations5
Published2019
Admission routes1
Has abstractyes

Explore more

Same topicMachine Learning and AlgorithmsFrench-language works237,207