Nah Bandit:推荐系统中的用户不服从行为建模
The Nah Bandit: Modeling User Non-compliance in Recommendation Systems
AI总结:
针对物理世界推荐系统中用户易拒绝推荐、回归基线行为的问题,本文提出Nah Bandit问题框架,建模用户不服从行为,并设计带聚类的专家算法EWC,理论与实验均验证其优于传统方法,为相关研究奠定基础。
摘要:
推荐系统如今已遍及数字世界,覆盖广告到娱乐等诸多领域。然而,在出行、健康等物理世界中部署高效推荐系统仍颇具挑战。本研究聚焦一项核心难题:在物理场景下,用户若不满意推荐内容,往往能轻易选择不接受任何推荐,转而回归自身的基线行为。因此,信息物理推荐系统必须采用能感知此类用户行为的交互模型,否则用户可能彻底放弃使用推荐功能。\n为此,本文提出Nah Bandit(戏称为“算了吧”老虎机)问题,用于描述用户可对推荐说“不”、转而选择自身偏好选项的老虎机问题,该问题介于典型老虎机设置与监督学习之间。我们通过参数化推荐对用户的锚定效应,对用户不服从行为进行建模。随后提出Expert with Clustering(EWC,带聚类的专家算法),这是一种分层方法,能同时利用来自推荐选项与非推荐选项的反馈,加快用户偏好学习速度。\n在包含N个用户、每个用户经历T轮交互、共K个聚类的推荐场景下,EWC的遗憾界为O(N√(TlogK) + NT),短期理论性能优于LinUCB算法。实验结果同样表明,EWC的表现优于监督学习方法与传统上下文老虎机方法。这一进展证明,有效利用不服从行为反馈可加快偏好学习速度、提升推荐准确率。本研究为Nah Bandit方向的后续研究奠定了基础,为构建更高效的推荐系统提供了鲁棒框架。
英文摘要:
Recommendation systems now pervade the digital world, ranging from advertising to entertainment. However, it remains challenging to implement effective recommendation systems in the physical world, such as in mobility or health. This work focuses on a key challenge: in the physical world, it is often easy for the user to opt out of taking any recommendation if they are not to her liking, and to fall back to her baseline behavior. It is thus crucial in cyber-physical recommendation systems to operate with an interaction model that is aware of such user behavior, lest the user abandon the recommendations altogether. This paper thus introduces the Nah Bandit, a tongue-in-cheek reference to describe a Bandit problem where users can say `nah' to the recommendation and opt for their preferred option instead. As such, this problem lies in between a typical bandit setup and supervised learning. We model the user non-compliance by parameterizing an anchoring effect of recommendations on users. We then propose the Expert with Clustering (EWC) algorithm, a hierarchical approach that incorporates feedback from both recommended and non-recommended options to accelerate user preference learning. In a recommendation scenario with $N$ users, $T$ rounds per user, and $K$ clusters, EWC achieves a regret bound of $O(N\sqrt{T\log K} + NT)$, achieving superior theoretical performance in the short term compared to LinUCB algorithm. Experimental results also highlight that EWC outperforms both supervised learning and traditional contextual bandit approaches. This advancement reveals that effective use of non-compliance feedback can accelerate preference learning and improve recommendation accuracy. This work lays the foundation for future research in Nah Bandit, providing a robust framework for more effective recommendation systems.
机构、总结、中文摘要均由AI分析而来,可能存在错误,请以论文正文为准。