Fairer but Not Fair Enough On the Equitability of Knowledge Tracing
Open accessThe DOI matches its Crossref record; 2 of the 2 references it cites were found in a registry or an index.
Abstract
Adaptive educational technologies have the capacity to meet the needs of individual students in theory, but in some cases, the degree of personalization might be less than desired, which could lead to inequitable outcomes for students. In this paper, we use simulations to demonstrate that while knowledge tracing algorithms are substantially more equitable than giving all students the same amount of practice, such algorithms can still be inequitable when they rely on inaccurate models. This can arise as a result of two factors: (1) using student models that are fit to aggregate populations of students, and (2) using student models that make incorrect assumptions about student learning. In particular, we demonstrate that both the Bayesian knowledge tracing algorithm and the N-Consecutive Correct Responses heuristic are susceptible to these concerns, but that knowledge tracing with the additive factor model may be more equitable. The broader message of this paper is that when designing learning analytics algorithms, we need to explicitly consider whether the algorithms act fairly with respect to different populations of students, and if not, how we can make our algorithms more equitable.
Overview
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Integrity signals
Registry
Cites
Statistics
Verification
Claims the paper makes
The claims and statistics of this paper haven’t been checked yet.
Free: it reads the open-access text and checks the first 5 claims that cite a source we can check. Create a free account to check every claim.
Self-check
Percentages, sums and reported differences re-computed from the paper’s own numbers.
The self-check needs the paper’s full text.
Citations
Cites
Democratizing education? Examining access and usage patterns in massive open online courses
Hansen, J. D., & Reich, J. (2015) · Science · doi:10.1126/science.aab3782 · Cited by 255 · cited 1×
“As some researchers have pointed out, educational technologies that aim to benefit all learners might disproportionately benefit more advantaged groups of learners [6, 12].”
BackgroundThe effects of adaptive learning in a massive open online course on learners' skill development
Rosen, Y., Rushkin, I., Rubin, R., Munson, L., Ang, A., Weber, G., Lopez, G., & Tingley, D. (2018) · Proceedings of the Fifth Annual ACM Conference on Learning at Scale · doi:10.1145/3231644.3231651 · Cited by 38 · cited 2×
“Knowledge tracing algorithms are used in learning technologies such as intelligent tutoring systems [4, 13], massive open online courses [14], and Khan Academy [7], in order to adaptively assess learners’ knowledge states and use that assessment to implement mastery learning (i.”
Method
Cited by
Baker, R. S., & Hawn, A. (2022) · International Journal of Artificial Intelligence in Education · doi:10.1007/s40593-021-00285-9 · Cited by 993
Personalized Education in the Artificial Intelligence Era: What to Expect Next
Maghsudi, S., Lan, A., Xu, J., & van der Schaar, M. (2021) · IEEE Signal Processing Magazine · doi:10.1109/msp.2021.3055032 · Cited by 341
Sha, L., Rakovic, M., Das, A., Gasevic, D., & Chen, G. (2022) · IEEE Transactions on Learning Technologies · doi:10.1109/tlt.2022.3196278 · Cited by 67
Assessing Algorithmic Fairness in Automatic Classifiers of Educational Forum Posts
Sha, L., Rakovic, M., Whitelock-Wainwright, A., Carroll, D., Yew, V. M., Gasevic, D., & Chen, G. (2021) · Lecture Notes in Computer Science · doi:10.1007/978-3-030-78292-4_31 · Cited by 34
Holstein, K., & Doroudi, S. (2021) · arXiv · doi:10.48550/arxiv.2104.12920 · Cited by 29
Self-citation
Metadata
- Authors
- Doroudi, S., & Brunskill, E.
- Venue
- Proceedings of the 9th International Conference on Learning Analytics & Knowledge
- Publisher
- ACM
- Published
- 2019-03-04
- Pages
- 335-339
- OpenAlex
- W2917204536
- Cited by
- 59
- References
- 2
- FWCI
- 3.21
- Type
- conference paper
- Language
- en
- Open access
- bronze
About these checks
Registry, retraction, Cites and statistics results are computed, not judged, with one exception: a printed reference that no index lists is read once by a model before it counts as a citation error. Claims are extracted by a model and kept only when their quote appears verbatim in the text; each cited source is then checked, with a model’s help, for whether it says what the claim relies on. Those verdicts can be wrong — read the claim’s quote and the cited source before relying on one.
Statistics and arithmetic are recomputed, not judged.
Confidence bands are shown only for fields calibrated on our annotated test set. None is calibrated yet, so no band is shown.
What counts as a claim ›How we measure confidence ›How we check this ›
Are you an author, or do you see a problem with this page? Request a review
Data sources
Bibliographic data: Semantic Scholar, OpenAlex, Crossref.
Contains information from the Semantic Scholar Academic Graph Datasets, made available under the ODC Attribution License (ODC-BY 1.0).
Semantic Scholar’s data is described in: Kinney, R., et al. (2023). The Semantic Scholar Open Data Platform. arXiv:2301.10140.