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

• URL: http://arxiv.org/abs/2309.02856v1
• Date: Wed, 6 Sep 2023 09:34:54 GMT
• Title: Getting too personal(ized): The importance of feature choice in online adaptive algorithms
• Authors: ZhaoBin Li, Luna Yee, Nathaniel Sauerberg, Irene Sakson, Joseph Jay Williams, Anna N. Rafferty
• Abstract summary: 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. We demonstrate that the inclusion of student characteristics for personalization can be beneficial when those characteristics are needed to learn the optimal action.
• Score: 6.716421415117937
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: 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.

Related papers

• A Comparative Analysis of Student Performance Predictions in Online Courses using Heterogeneous Knowledge Graphs [0.0]
  We analyze a heterogeneous knowledge graph consisting of students, course videos, formative assessments and their interactions to predict student performance. We then compare the models generated between 5 on-campus and 2 fully-online MOOC-style instances of the same course. The model developed achieved a 70-90% accuracy of predicting whether a student would pass a particular problem set based on content consumed, course instance, and modality.
  arXiv  Detail & Related papers  (2024-05-19T03:33:59Z)
• Modeling User Preferences via Brain-Computer Interfacing [54.3727087164445]
  We use Brain-Computer Interfacing technology to infer users' preferences, their attentional correlates towards visual content, and their associations with affective experience. We link these to relevant applications, such as information retrieval, personalized steering of generative models, and crowdsourcing population estimates of affective experiences.
  arXiv  Detail & Related papers  (2024-05-15T20:41:46Z)
• Toward In-Context Teaching: Adapting Examples to Students' Misconceptions [54.82965010592045]
  We introduce a suite of models and evaluation methods we call AdapT. AToM is a new probabilistic model for adaptive teaching that jointly infers students' past beliefs and optimize for the correctness of future beliefs. Our results highlight both the difficulty of the adaptive teaching task and the potential of learned adaptive models for solving it.
  arXiv  Detail & Related papers  (2024-05-07T17:05:27Z)
• Personalized Privacy Auditing and Optimization at Test Time [44.15285550981899]
  This paper asks whether it is necessary to require emphall input features for a model to return accurate predictions at test time. Under a personalized setting, each individual may need to release only a small subset of these features without impacting the final decisions. Evaluation over several learning tasks shows that individuals may be able to report as little as 10% of their information to ensure the same level of accuracy.
  arXiv  Detail & Related papers  (2023-01-31T20:16:59Z)
• Personalized Student Attribute Inference [0.0]
  This work is to create a system able to automatically detect students in difficulty, for instance predicting if they are likely to fail a course. We compare a naive approach widely used in the literature, which uses attributes available in the data set (like the grades) with a personalized approach we called Personalized Student Attribute Inference (IPSA)
  arXiv  Detail & Related papers  (2022-12-26T23:00:28Z)
• CIAO! A Contrastive Adaptation Mechanism for Non-Universal Facial Expression Recognition [80.07590100872548]
  We propose Contrastive Inhibitory Adaptati On (CIAO), a mechanism that adapts the last layer of facial encoders to depict specific affective characteristics on different datasets. CIAO presents an improvement in facial expression recognition performance over six different datasets with very unique affective representations.
  arXiv  Detail & Related papers  (2022-08-10T15:46:05Z)
• SF-PATE: Scalable, Fair, and Private Aggregation of Teacher Ensembles [50.90773979394264]
  This paper studies a model that protects the privacy of individuals' sensitive information while also allowing it to learn non-discriminatory predictors. A key characteristic of the proposed model is to enable the adoption of off-the-selves and non-private fair models to create a privacy-preserving and fair model.
  arXiv  Detail & Related papers  (2022-04-11T14:42:54Z)
• Interpretable Knowledge Tracing: Simple and Efficient Student Modeling with Causal Relations [21.74631969428855]
  Interpretable Knowledge Tracing (IKT) is a simple model that relies on three meaningful latent features. IKT's prediction of future student performance is made using a Tree-Augmented Naive Bayes (TAN) IKT has great potential for providing adaptive and personalized instructions with causal reasoning in real-world educational systems.
  arXiv  Detail & Related papers  (2021-12-15T19:05:48Z)
• A Framework to Counteract Suboptimal User-Behaviors in Exploratory Learning Environments: an Application to MOOCs [1.1421942894219896]
  We focus on a data-driven user-modeling framework that uses logged interaction data to learn which behavioral or activity patterns should trigger help. We present a novel application of this framework to Massive Open Online Courses (MOOCs), a form of exploratory environment.
  arXiv  Detail & Related papers  (2021-06-14T16:16:33Z)
• Differentially Private and Fair Deep Learning: A Lagrangian Dual Approach [54.32266555843765]
  This paper studies a model that protects the privacy of the individuals sensitive information while also allowing it to learn non-discriminatory predictors. The method relies on the notion of differential privacy and the use of Lagrangian duality to design neural networks that can accommodate fairness constraints.
  arXiv  Detail & Related papers  (2020-09-26T10:50:33Z)
• Differentially Private Deep Learning with Smooth Sensitivity [144.31324628007403]
  We study privacy concerns through the lens of differential privacy. In this framework, privacy guarantees are generally obtained by perturbing models in such a way that specifics of data used to train the model are made ambiguous. One of the most important techniques used in previous works involves an ensemble of teacher models, which return information to a student based on a noisy voting procedure. In this work, we propose a novel voting mechanism with smooth sensitivity, which we call Immutable Noisy ArgMax, that, under certain conditions, can bear very large random noising from the teacher without affecting the useful information transferred to the student
  arXiv  Detail & Related papers  (2020-03-01T15:38:00Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.