Intrinsic interpretability at parity: Attention-Based RL–MIL for student outcome prediction

Natural Language Processing Journal Pub Date : 2026-03-01 Epub Date: 2026-02-28 DOI:10.1016/j.nlp.2026.100204
Nina May Braakman , Seyed Sahand Mohammadi Ziabari , Ali Mohammed Mansoor Alsahag , Yousuf Nasser Al Husaini
{"title":"Intrinsic interpretability at parity: Attention-Based RL–MIL for student outcome prediction","authors":"Nina May Braakman ,&nbsp;Seyed Sahand Mohammadi Ziabari ,&nbsp;Ali Mohammed Mansoor Alsahag ,&nbsp;Yousuf Nasser Al Husaini","doi":"10.1016/j.nlp.2026.100204","DOIUrl":null,"url":null,"abstract":"<div><div>Predicting student outcomes such as course completion or dropout is central to early intervention in online education. In this context, learning analytics systems must extract actionable insights from noisy, sequential, and weakly labeled interaction data. We revisit Reinforcement Learning-based Multiple Instance Learning (RL-MIL), a framework that learns a policy to select critical instances from bags of interactions while optimizing a downstream predictor. However, prior RL-MIL approaches rely on the Epsilon-Greedy strategy, which under-explores context and requires expensive post-hoc explanations (e.g., SHAP) to justify instance selection.</div><div>We propose two attention-based RL-MIL policies, Gated Attention and Multi-Head Attention, that directly embed context-aware selection into the policy network, providing intrinsic interpretability at inference time. Experiments on two versions of the Open University Learning Analytics Dataset (OULAD) show that while both attention-based methods match the predictive performance of the Epsilon-Greedy baseline (0.92 Macro F1 on the aggregated dataset; 0.80 on the full dataset), they reduce interpretation latency by up to two orders of magnitude and allow tunable trade-offs between sparsity and accuracy via attention-temperature control.</div><div>This work establishes the feasibility of analytical, efficient, and context-aware instance selection in weakly labeled educational settings, and provides a path toward scalable, interpretable RL-MIL frameworks that do not depend on costly post-hoc methods.</div></div>","PeriodicalId":100944,"journal":{"name":"Natural Language Processing Journal","volume":"14 ","pages":"Article 100204"},"PeriodicalIF":0.0000,"publicationDate":"2026-03-01","publicationTypes":"Journal Article","fieldsOfStudy":null,"isOpenAccess":false,"openAccessPdf":"","citationCount":"0","resultStr":null,"platform":"Semanticscholar","paperid":null,"PeriodicalName":"Natural Language Processing Journal","FirstCategoryId":"1085","ListUrlMain":"https://www.sciencedirect.com/science/article/pii/S2949719126000087","RegionNum":0,"RegionCategory":null,"ArticlePicture":[],"TitleCN":null,"AbstractTextCN":null,"PMCID":null,"EPubDate":"2026/2/28 0:00:00","PubModel":"Epub","JCR":"","JCRName":"","Score":null,"Total":0}
引用次数: 0

Abstract

Predicting student outcomes such as course completion or dropout is central to early intervention in online education. In this context, learning analytics systems must extract actionable insights from noisy, sequential, and weakly labeled interaction data. We revisit Reinforcement Learning-based Multiple Instance Learning (RL-MIL), a framework that learns a policy to select critical instances from bags of interactions while optimizing a downstream predictor. However, prior RL-MIL approaches rely on the Epsilon-Greedy strategy, which under-explores context and requires expensive post-hoc explanations (e.g., SHAP) to justify instance selection.
We propose two attention-based RL-MIL policies, Gated Attention and Multi-Head Attention, that directly embed context-aware selection into the policy network, providing intrinsic interpretability at inference time. Experiments on two versions of the Open University Learning Analytics Dataset (OULAD) show that while both attention-based methods match the predictive performance of the Epsilon-Greedy baseline (0.92 Macro F1 on the aggregated dataset; 0.80 on the full dataset), they reduce interpretation latency by up to two orders of magnitude and allow tunable trade-offs between sparsity and accuracy via attention-temperature control.
This work establishes the feasibility of analytical, efficient, and context-aware instance selection in weakly labeled educational settings, and provides a path toward scalable, interpretable RL-MIL frameworks that do not depend on costly post-hoc methods.
奇偶的内在可解释性:基于注意的RL-MIL对学生成绩预测的影响
在线教育早期干预的核心是预测学生完成课程或辍学等结果。在这种情况下,学习分析系统必须从嘈杂的、顺序的、弱标记的交互数据中提取可操作的见解。我们重新审视基于强化学习的多实例学习(RL-MIL),这是一个框架,它学习策略,从交互包中选择关键实例,同时优化下游预测器。然而,之前的RL-MIL方法依赖于Epsilon-Greedy策略,该策略对上下文的探索不足,并且需要昂贵的事后解释(例如SHAP)来证明实例选择的合理性。我们提出了两种基于注意的RL-MIL策略,门控注意和多头注意,它们直接将上下文感知选择嵌入到策略网络中,在推理时提供内在的可解释性。在两个版本的开放大学学习分析数据集(OULAD)上的实验表明,虽然两种基于注意力的方法都符合Epsilon-Greedy基线的预测性能(在聚合数据集上为0.92 Macro F1;在完整数据集上为0.80),但它们将解释延迟减少了两个数量级,并允许通过注意力温度控制在稀疏性和准确性之间进行可调的权衡。这项工作建立了在弱标记教育环境中分析、高效和上下文感知的实例选择的可行性,并提供了一条通往可扩展、可解释的RL-MIL框架的途径,该框架不依赖于昂贵的事后方法。
本文章由计算机程序翻译,如有差异,请以英文原文为准。
求助全文
约1分钟内获得全文 求助全文
来源期刊
自引率
0.00%
发文量
0
×
引用
GB/T 7714-2015
复制
MLA
复制
APA
复制
导出至
BibTeX EndNote RefMan NoteFirst NoteExpress
×
提示
您的信息不完整,为了账户安全,请先补充。
现在去补充
×
提示
您因"违规操作"
具体请查看互助需知
我知道了
×
提示
确定
请完成安全验证×
copy
已复制链接
快去分享给好友吧!
我知道了
右上角分享
点击右上角分享
0
联系我们:info@booksci.cn Book学术提供免费学术资源搜索服务,方便国内外学者检索中英文文献。致力于提供最便捷和优质的服务体验。 Copyright © 2023 布克学术 All rights reserved.
京ICP备2023020795号-1
ghs 京公网安备 11010802042870号
Book学术文献互助
Book学术文献互助群
群 号:604180095
Book学术官方微信
小红书