mlsanityData to 14 Oct 2026

Don't Let Bandit Feedback Pull Continual LLM-Recommender Updates Off Target

arXiv 2605.18899 ↗First posted 17 May 2026cs.LG cs.AIcited by 1

Not on the map. Why?

Abstract (arXiv)

Generative LLM-based recommenders (LLM-Rec) require continual post-deployment updates, yet deployment logs provide only policy-shaped contextual bandit feedback: outcomes are observed solely for items exposed by a prior serving policy, inducing exposure bias and yielding partial, asymmetric signals consisting of relatively reliable positive responses and ambiguous no-responses. We propose an Anchored Bandit Policy Optimization (ABPO) framework for continual LLM-Rec updates that combines group-relative policy optimization (GRPO) with explicit treatment of exposure bias and feedback ambiguity. Specifically, we insert the exposed recommendation as a logged anchor into each GRPO rollout group, so that group-relative normalization is calibrated against the action actually exposed by the prior policy rather than against newly sampled rollouts alone. Because both positive- and no-responses are observed only through prior-policy exposure, we apply self-normalized inverse propensity scoring to the fixed anchor for both feedback types to correct for policy mismatch. At the same time, we treat the two feedback types asymmetrically in reliability: positive responses provide relatively direct endorsement signals, whereas no-responses remain ambiguous because they may reflect either true disinterest or unobserved external factors. To avoid overly aggressive updates from ambiguous no-responses, we temper their penalties with self-certainty, using the model's output-token confidence as a verifier-free reliability signal. Across five domains from Amazon Reviews and MovieLens, our method yields consistent post-update gains in recommendation accuracy while mitigating prior-policy-induced exposure bias more effectively than prior baselines.

Key facts. Cited by 1 paper in the map (data through 14 Oct 2026). Builds on 11 of its 18 references that are in the map. First posted on arXiv 17 May 2026.

Builds on

11 of 18 references.

References · 11

  1. 2024DeepSeekMath: Pushing the Limits of Mathematical Reasoning in Open Language Modelscited by 9,379
  2. 2025Learning to Reason without External Rewardscited by 210
  3. 2026GDPO: Group reward-Decoupled Normalization Policy Optimization for Multi-reward RL Optimizationcited by 193
  4. 2024Data-efficient Fine-tuning for LLM-based Recommendationcited by 104
  5. 2024On Softmax Direct Preference Optimization for Recommendationcited by 64
  6. 2025Rec-R1: Bridging Generative Large Language Models and User-Centric Recommendation Systems via Reinforcement Learningcited by 33
  7. 2024Leveraging LLM Reasoning Enhances Personalized Recommender Systemscited by 28
  8. 2025CTR-Guided Generative Query Suggestion in Conversational Searchcited by 9
  9. 2025From Clicks to Preference: A Multi-stage Alignment Framework for Generative Query Suggestion in Conversational Systemcited by 9
  10. 2025Reinforcement Learning from User Feedbackcited by 8
  11. 2025Towards Trustworthy LLM-Based Recommendation via Rationale Integrationcited by 1

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. 2026ReCast: Recasting Learning Signals for Reinforcement Learning in Generative Recommendation
  2. 2025What Makes LLMs Effective Sequential Recommenders? A Study on Preference Intensity and Temporal Context
  3. 2026FlexRec: Adapting LLM-based Recommenders for Flexible Needs via Reinforcement Learning
  4. 2026RecHarness: A Bandit-Routed Agentic Harness for Self-Evolving Recommender Systems
  5. 2026Adaptive Loss Balancing for Noise-Robust GRPO in Generative Recommendation
  6. 2026LLM-Enhanced Reinforcement Learning for Long-Term User Satisfaction in Interactive Recommendation
  7. 2026Robust Post-Training for Generative Recommenders: Why Exponential Reward-Weighted SFT Outperforms RLHF
  8. 2026Objective Shaping with Hard Negatives: Windowed Partial AUC Optimization for RL-based LLM Recommenders ↗