Learning from Cross-Modal Behavior Dynamics with Graph-Regularized Neural Contextual Bandit
Xian Wu, Suleyman Cetintas, Deguang Kong, Miao Lu, Jian Yang, Nitesh V. Chawla
Abstract
Contextual multi-armed bandit algorithms have received significant attention in modeling users’ preferences for online personalized recommender systems in a timely manner. While significant progress has been made along this direction, a few major challenges have not been well addressed yet: (i) a vast majority of the literature is based on linear models that cannot capture complex non-linear inter-dependencies of user-item interactions; (ii) existing literature mainly ignores the latent relations among users and non-recommended items: hence may not properly reflect users’ preferences in the real-world; (iii) current solutions are mainly based on historical data and are prone to cold-start problems for new users who have no interaction history.
Ask about this paper
Ask your agent about it.
Lune has read the top-tier papers around this one, so every answer names the papers it rests on.
Your agent calls
Lunesearch_papers
Free to start. No credit card required.
Terminal
Install the CLIlune papers get 7c54c611-febe-4842-b51b-35cb2142c4d6Cited by top-tier papers1
Ask how each one uses itRelated papers
- Local Clustering in Contextual Multi-Armed BanditsYikun Ban, Jingrui HeWWW 2021 · 51 citations
- A Dynamic Meta-Learning Model for Time-Sensitive Cold-Start RecommendationsKrishna Prasad Neupane, Ervine Zheng, Yu Kong, Qi YuAAAI 2022 · 16 citations
- Online Clustering of Dueling BanditsZhiyong Wang, Jiahang Sun, Mingze Kong, Jize Xie et al.ICML 2025
- When and Whom to Collaborate with in a Changing Environment: A Collaborative Dynamic Bandit SolutionChuanhao Li, Qingyun Wu, Hongning WangSIGIR 2021 · 5 citations
- Contextual-Bandit Based Personalized Recommendation with Time-Varying User InterestsXiao Xu, Fang Dong, Yanghua Li, Shaojian He et al.AAAI 2020 · 41 citations
