Prerequisites and Performance in a Machine Learning Course: A Quantitative Analysis
Bibliographic record
Abstract
Demand for Machine Learning (ML) courses remains high, and educators face open questions about which prerequisites are important for student success in upper-year ML courses. Prior work has shown that instructors and students in ML courses believe that the math prerequisites and their relative recency are barriers to success, but this relationship has not been demonstrated quantitatively. In this paper, we study the link between prerequisite grades and performance in an upper-year ML course at two sites. We use linear models to study the extent to which student grades in prerequisite courses in calculus, linear algebra, statistics, and software design are predictive of student performance in the ML course. We consider the effect of additional factors like gender, first-in-family status, prior experience, comfort with mathematics, and comfort with academic English. Like prior work in many domains, and consistent with ML instructor and student perspectives, we find that prerequisite grades are predictive of ML performance. However, different combinations of prerequisites are important at different sites. Also, we find that cumulative grade point average (cGPA) in past technical and non-technical courses are as predictive of ML grade, if not more. Moreover, recency in prerequisite courses is not predictive of ML course grades in our setting. These findings suggest that general academic preparation may be as robust a predictor of ML course performance as specific math prerequisites, challenging assumptions about the role of mathematical recency and preparedness—at least as measured by grades.
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 imitationNot 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.
Distilled classifier scores by category (both heads)
| Category | Codex | Gemma |
|---|---|---|
| Metaresearch | 0.007 | 0.048 |
| Meta-epidemiology (narrow) | 0.000 | 0.000 |
| Meta-epidemiology (broad) | 0.001 | 0.001 |
| Bibliometrics | 0.003 | 0.002 |
| Science and technology studies | 0.001 | 0.001 |
| Scholarly communication | 0.002 | 0.002 |
| Open science | 0.001 | 0.002 |
| Research integrity | 0.001 | 0.002 |
| Insufficient payload (model declined to judge) | 0.009 | 0.002 |
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.
score_only:v0-immature-baseline · verbatim from the scoring run: score_only means the number may rank works, and no category label ships from itClassification
machine, unvalidatedMachine predicted; a candidate call from one source (direct Gemma or distilled Codex), not a consensus.
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".