The Nah Bandit: Modeling User Non-compliance in Recommendation Systems
Not on the map. Why?
Abstract (arXiv)
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√Tlog 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.
Key facts. No citing papers in the map yet (data through 14 Oct 2026). Builds on 20 of its 67 references that are in the map. First posted on arXiv 15 Aug 2024.
Builds on
20 of 67 references.
References · 20
- 2016XGBoost: A Scalable Tree Boosting Systemcited by 5,166
- 2020An Efficient Framework for Clustered Federated Learningcited by 511
- 2019Clustered Federated Learning: Model-Agnostic Distributed Multi-Task Optimization under Privacy Constraintscited by 503
- 2019Introduction to Multi-Armed Banditscited by 481
- 2014Online Clustering of Banditscited by 102
- 2017Fast Matrix Factorization for Online Recommendation with Implicit Feedbackcited by 101
- 2021Local Clustering in Contextual Multi-Armed Banditscited by 29
- 2014Mondrian Forests: Efficient Online Random Forestscited by 25
- 2020IntelligentPooling: Practical Thompson Sampling for mHealthcited by 24
- 2015Online Gradient Boostingcited by 15
- 2023On the sample complexity of parameter estimation in logistic regression with normal designcited by 13
- 2018The closed loop between opinion formation and personalised recommendationscited by 12
8 more
- 2023Learning Personalized Models with Clustered System Identificationcited by 11
- 2020Fatigue-aware Bandits for Dependent Click Modelscited by 10
- 2022Rate-Constrained Remote Contextual Banditscited by 5
- 2022Exploration, Exploitation, and Engagement in Multi-Armed Bandits with Abandonmentcited by 5
- 2021Time-Varying Optimization of Networked Systems with Human Preferencescited by 4
- 2024Expert with Clustering: Hierarchical Online Preference Learning Frameworkcited by 3
- 2017Uniform Deviation Bounds for Unbounded Loss Functions like k-Meanscited by 2
- 2023Distributed Consensus Algorithm for Decision-Making in Multi-agent Multi-armed Banditcited by 2
Built on by
Not cited yet.