MétaCan
Menu
Back to cohort
Record W3192889988 · doi:10.1109/icalt52272.2021.00057

IRT++: Improving Student Response Prediction With Gaussian Initialisation and Other Modifications

2021· article· en· W3192889988 on OpenAlexaff
Nayan Saxena, Varun Lodaya, Trisha Thakur

Bibliographic record

Venuenot available
Typearticle
Languageen
FieldMathematics
TopicTensor decomposition and applications
Canadian institutionsUniversity of Toronto
Fundersnot available
KeywordsInterpretabilityItem response theoryComputer scienceSimple (philosophy)Convergence (economics)Machine learningArtificial intelligenceExtension (predicate logic)Model parameterGaussianGaussian processGradient descentMathematicsStatisticsArtificial neural network

Abstract

fetched live from OpenAlex

In this paper, we explore an extension of the Item Response Theory (IRT) model to predict student responses using dichotomous data and formulate approaches to improve the predictive accuracy of the traditional algorithm. We present a simple extension to the IRT modelling approach called IRT++, which combines both the 1-parameter and 2-parameter IRT models and modulates parameter optimisation through simple machine learning techniques like adaptive gradient descent and random-normal initialisation of parameters. By experimentation on real-world education data, we show how the IRT++ modelling framework other baselines at predicting student responses, and achieves better performance while sacrificing very little in model interpretability and rate of convergence.

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.

How this classification was reachedexpand

Full frame machine prediction

Teacher imitation

Not calibrated prevalence, not ground truth. Human validation pending. The Gemma side is a direct model label for every work in the frame, read from the title-only record. The Codex side is a classifier learned from the 10,348 direct Codex labels and calibrated to design-weighted sample rates; fields without enough sample support carry no Codex call. Candidate is the union of the two sides; consensus is their intersection. These outputs are machine_predicted_unvalidated and are not human labels.

metaresearch head score (Codex)0.009
metaresearch head score (Gemma)0.039
Version: metacan-v3-hybrid-931329e0061cValidation 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: Methods · Consensus signal: Methods
Teacher disagreement score0.009
Threshold uncertainty score0.047

Distilled classifier scores by category (both heads)

CategoryCodexGemma
Metaresearch0.0090.039
Meta-epidemiology (narrow)0.0020.001
Meta-epidemiology (broad)0.0020.002
Bibliometrics0.0010.001
Science and technology studies0.0000.001
Scholarly communication0.0010.003
Open science0.0030.003
Research integrity0.0020.004
Insufficient payload (model declined to judge)0.0070.008

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.058
GPT teacher head0.340
Teacher spread0.282 · 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

Classification

machine, unvalidated

Machine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.

The models applied no category: nothing in the taxonomy fit this work.
Study designSimulation or modeling
Domainnot available
GenreMethods

How this classification was reached, model by model and score by score, is at the end of the page under "How this classification was reached".

Quick stats

Citations2
Published2021
Admission routes1
Has abstractyes

Explore more

Same topicTensor decomposition and applicationsFrench-language works237,207