Saved in:
| Main Authors: | , , , , , |
|---|---|
| Format: | Preprint |
| Published: |
2026
|
| Subjects: | |
| Online Access: | https://arxiv.org/abs/2601.08403 |
| Tags: |
Add Tag
No Tags, Be the first to tag this record!
|
| _version_ | 1866915985462657024 |
|---|---|
| author | Nath, Abhijnan Garakani, Alireza Bagheri Zhou, Tianchen Yang, Fan Gao, Yan Krishnaswamy, Nikhil |
| author_facet | Nath, Abhijnan Garakani, Alireza Bagheri Zhou, Tianchen Yang, Fan Gao, Yan Krishnaswamy, Nikhil |
| contents | Large language models are increasingly trained via reinforcement learning for personalized recommendation tasks, but standard methods like GRPO rely on sparse, sequence-level rewards. These obscure which tokens actually contribute to high-quality outputs, creating a credit assignment gap. This gap is especially problematic when models must infer latent user intent from under-specified language without ground truth labels, which is a reasoning pattern rarely seen during pretraining but commonly required in deployment. We introduce Owen-Shapley Policy Optimization (OSPO), a framework that redistributes sequence-level advantages based on tokens' marginal contributions to outcomes. OSPO transforms task feedback into potential-based reward shaping via Shapley-Owen attributions to assign segment-level credit while preserving the optimal policy, all without parametric value models. By forming coalitions of semantically coherent units (e.g., phrases describing product attributes or sentences capturing preferences), OSPO identifies which response parts drive performance. Experiments on Amazon ESCI and H&M Fashion datasets including controlled generation tasks show consistent gains over baselines and notable test-time robustness to out-of-distribution retrievers unseen during training. |
| format | Preprint |
| id |
arxiv_https___arxiv_org_abs_2601_08403 |
| institution | arXiv |
| publishDate | 2026 |
| record_format | arxiv |
| spellingShingle | Owen-Shapley Policy Optimization: A Principled RL Algorithm for Generative Search LLMs Nath, Abhijnan Garakani, Alireza Bagheri Zhou, Tianchen Yang, Fan Gao, Yan Krishnaswamy, Nikhil Artificial Intelligence Large language models are increasingly trained via reinforcement learning for personalized recommendation tasks, but standard methods like GRPO rely on sparse, sequence-level rewards. These obscure which tokens actually contribute to high-quality outputs, creating a credit assignment gap. This gap is especially problematic when models must infer latent user intent from under-specified language without ground truth labels, which is a reasoning pattern rarely seen during pretraining but commonly required in deployment. We introduce Owen-Shapley Policy Optimization (OSPO), a framework that redistributes sequence-level advantages based on tokens' marginal contributions to outcomes. OSPO transforms task feedback into potential-based reward shaping via Shapley-Owen attributions to assign segment-level credit while preserving the optimal policy, all without parametric value models. By forming coalitions of semantically coherent units (e.g., phrases describing product attributes or sentences capturing preferences), OSPO identifies which response parts drive performance. Experiments on Amazon ESCI and H&M Fashion datasets including controlled generation tasks show consistent gains over baselines and notable test-time robustness to out-of-distribution retrievers unseen during training. |
| title | Owen-Shapley Policy Optimization: A Principled RL Algorithm for Generative Search LLMs |
| topic | Artificial Intelligence |
| url | https://arxiv.org/abs/2601.08403 |