mlsanityData to 14 Oct 2026

Getting too personal(ized): The importance of feature choice in online adaptive algorithms

arXiv 2309.02856 ↗First posted 6 Sep 2023cs.AI cs.CYcited by 1

Not on the map. Why?

Abstract (arXiv)

Digital educational technologies offer the potential to customize students' experiences and learn what works for which students, enhancing the technology as more students interact with it. We consider whether and when attempting to discover how to personalize has a cost, such as if the adaptation to personal information can delay the adoption of policies that benefit all students. We explore these issues in the context of using multi-armed bandit (MAB) algorithms to learn a policy for what version of an educational technology to present to each student, varying the relation between student characteristics and outcomes and also whether the algorithm is aware of these characteristics. Through simulations, we demonstrate that the inclusion of student characteristics for personalization can be beneficial when those characteristics are needed to learn the optimal action. In other scenarios, this inclusion decreases performance of the bandit algorithm. Moreover, including unneeded student characteristics can systematically disadvantage students with less common values for these characteristics. Our simulations do however suggest that real-time personalization will be helpful in particular real-world scenarios, and we illustrate this through case studies using existing experimental results in ASSISTments. Overall, our simulations show that adaptive personalization in educational technologies can be a double-edged sword: real-time adaptation improves student experiences in some contexts, but the slower adaptation and potentially discriminatory results mean that a more personalized model is not always beneficial.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 6 of its 29 references that are in the map. First posted on arXiv 6 Sep 2023.

Builds on

6 of 29 references.

References · 6

  1. 2016Fairness in Learning: Classic and Contextual Banditscited by 168
  2. 2017Fairness in Machine Learning: Lessons from Political Philosophycited by 149
  3. 2015Multi-armed Bandit Models for the Optimal Design of Clinical Trials: Benefits and Challengescited by 114
  4. 2013Multi-Armed Bandits for Intelligent Tutoring Systemscited by 21
  5. 2018The Externalities of Exploration and How Data Diversity Helps Exploitationcited by 20
  6. 2018Combining Difficulty Ranking with Multi-Armed Bandits to Sequence Educational Contentcited by 6

Built on by

Cited by year

Citing papers per year: 2025: 1.

1 paper.