mlsanityData to 14 Oct 2026

Enhancing Bandit Algorithms with LLMs for Time-varying User Preferences in Streaming Recommendations

arXiv 2602.08067 ↗First posted 8 Feb 2026cs.LGcited by 1

On the map: LLM alignment / RLHF / preference optimisation → Preference alignment for recommenders and RAG

Abstract (arXiv)

In real-world streaming recommender systems, user preferences evolve dynamically over time. Existing bandit-based methods treat time merely as a timestamp, neglecting its explicit relationship with user preferences and leading to suboptimal performance. Moreover, online learning methods often suffer from inefficient exploration-exploitation during the early online phase. To address these issues, we propose HyperBandit+, a novel contextual bandit policy that integrates a time-aware hypernetwork to adapt to time-varying user preferences and employs a large language model-assisted warm-start mechanism (LLM Start) to enhance exploration-exploitation efficiency in the early online phase. Specifically, HyperBandit+ leverages a neural network that takes time features as input and generates parameters for estimating time-varying rewards by capturing the correlation between time and user preferences. Additionally, the LLM Start mechanism employs multi-step data augmentation to simulate realistic interaction data for effective offline learning, providing warm-start parameters for the bandit policy in the early online phase. To meet real-time streaming recommendation demands, we adopt low-rank factorization to reduce hypernetwork training complexity. Theoretically, we rigorously establish a sublinear regret upper bound that accounts for both the hypernetwork and the LLM warm-start mechanism. Extensive experiments on real-world datasets demonstrate that HyperBandit+ consistently outperforms state-of-the-art baselines in terms of accumulated rewards.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Placed in Preference alignment for recommenders and RAG, one of 10 directions in LLM alignment / RLHF / preference optimisation. Builds on 30 of its 73 references that are in the map. First posted on arXiv 8 Feb 2026.

Builds on

30 of 73 references.

References · 30

  1. 2018Self-Attentive Sequential Recommendationcited by 1,184
  2. 2016HyperNetworkscited by 1,027
  3. 2019Introduction to Online Convex Optimizationcited by 803
  4. 2019Continual learning with hypernetworkscited by 273
  5. 2021Personalized Federated Learning using Hypernetworkscited by 212
  6. 2023Recommender Systems in the Era of Large Language Models (LLMs)cited by 189
  7. 2023LLMRec: Large Language Models with Graph Augmentation for Recommendationcited by 172
  8. 2020Learning the Pareto Front with Hypernetworkscited by 125
  9. 2019Self-Tuning Networks: Bilevel Optimization of Hyperparameters using Structured Best-Response Functionscited by 105
  10. 2022KuaiRec: A Fully-observed Dataset and Insights for Evaluating Recommender Systemscited by 96
  11. 2018Learning to Optimize under Non-Stationaritycited by 85
  12. 2021Mining Latent Structures for Multimedia Recommendationcited by 79
18 more
  1. 2019Hypernetwork functional image representationcited by 65
  2. 2020Sequential Batch Learning in Finite-Action Linear Contextual Banditscited by 63
  3. 2021A Simple Approach for Non-stationary Linear Banditscited by 54
  4. 2020Low-Rank Generalized Linear Bandit Problemscited by 49
  5. 2014Optimal Exploration-Exploitation in a Multi-Armed-Bandit Problem with Non-stationary Rewardscited by 42
  6. 2019Hyper-Graph-Network Decoders for Block Codescited by 42
  7. 2023Exploring the Upper Limits of Text-Based Collaborative Filtering Using Large Language Models: Discoveries and Insightscited by 38
  8. 2022Contrastive Meta Learning with Behavior Multiplicity for Recommendationcited by 37
  9. 2018Contextual Bandits with Cross-learningcited by 31
  10. 2022Multi-level Cross-view Contrastive Learning for Knowledge-aware Recommender Systemcited by 30
  11. 2018Learning Contextual Bandits in a Non-stationary Environmentcited by 26
  12. 2024Efficient Frameworks for Generalized Low-Rank Matrix Bandit Problemscited by 20
  13. 2020Contextual-Bandit Based Personalized Recommendation with Time-Varying User Interestscited by 18
  14. 2016Streaming Recommender Systemscited by 17
  15. 2023Controllable Multi-Objective Re-ranking with Policy Hypernetworkscited by 15
  16. 2024A Survey of Controllable Learning: Methods and Applications in Information Retrievalcited by 12
  17. 2023HyperBandit: Contextual Bandit with Hypernewtork for Time-Varying User Preferences in Streaming Recommendationcited by 10
  18. 2022Reward Imputation with Sketching for Contextual Batched Banditscited by 5

Built on by

Cited by year (2026 to 14 Oct)

Citing papers per year: 2026: 1.

1 paper.

Similar, not cited

Close in wording, no citation either way

  1. 2026RecHarness: A Bandit-Routed Agentic Harness for Self-Evolving Recommender Systems
  2. 2026Don't Let Bandit Feedback Pull Continual LLM-Recommender Updates Off Target
  3. 2026Long-term User Engagement Optimization through Model-agnostic Downstream Rewards Learning
  4. 2025What Makes LLMs Effective Sequential Recommenders? A Study on Preference Intensity and Temporal Context
  5. 2025User Feedback Alignment for LLM-powered Exploration in Large-scale Recommendation Systems
  6. 2025Learning to Route LLMs from Bandit Feedback: One Policy, Many Trade-offs
  7. 2024ContextWIN: Whittle Index Based Mixture-of-Experts Neural Model For Restless Bandits Via Deep RL
  8. 2024Neural Dueling Bandits: Preference-Based Optimization with Human Feedback