dorsal/arxiv
View SchemaOwen-Shapley Policy Optimization (OSPO): A Principled RL Algorithm for Generative Search LLMs
| Authors | Abhijnan Nath, Alireza Bagheri Garakani, Tianchen Zhou, Fan Yang, Nikhil Krishnaswamy |
|---|---|
| Categories | |
| ArXiv ID | 2601.08403vv1 |
| URL | https://arxiv.org/abs/2601.08403 |
| License | http://creativecommons.org/licenses/by/4.0/ |
Abstract
Large language models are increasingly trained via reinforcement learning for personalized recommendation tasks, but standard methods like GRPO rely on sparse, sequence-level rewards that create a credit assignment gap, obscuring which tokens drive success. This gap is especially problematic when models must infer latent user intent from under-specified language without ground truth labels, a reasoning pattern rarely seen during pretraining. We introduce Owen-Shapley Policy Optimization (OSPO), a framework that redistributes sequence-level advantages based on tokens' marginal contributions to outcomes. Unlike value-model-based methods requiring additional computation, OSPO employs potential-based reward shaping via Shapley-Owen attributions to assign segment-level credit while preserving the optimal policy, learning directly from task feedback without parametric value models. By forming coalitions of semantically coherent units (phrases describing product attributes or sentences capturing preferences), OSPO identifies which response parts drive performance. Experiments on Amazon ESCI and H&M Fashion datasets show consistent gains over baselines, with notable test-time robustness to out-of-distribution retrievers unseen during training.
{
"annotation_id": "7e47c7b0-482c-4b83-8f9f-7cc4bb9a2d81",
"date_created": "2026-02-17T05:53:16.236000Z",
"date_modified": "2026-02-17T05:53:16.236000Z",
"file_hash": "cd9e2e790d2cd87c8b29ead634e2636eee05d1e93719c0906a5d7713237d0606",
"private": false,
"record": {
"abstract": "Large language models are increasingly trained via reinforcement learning for personalized recommendation tasks, but standard methods like GRPO rely on sparse, sequence-level rewards that create a credit assignment gap, obscuring which tokens drive success. This gap is especially problematic when models must infer latent user intent from under-specified language without ground truth labels, a reasoning pattern rarely seen during pretraining. We introduce Owen-Shapley Policy Optimization (OSPO), a framework that redistributes sequence-level advantages based on tokens\u0027 marginal contributions to outcomes. Unlike value-model-based methods requiring additional computation, OSPO employs potential-based reward shaping via Shapley-Owen attributions to assign segment-level credit while preserving the optimal policy, learning directly from task feedback without parametric value models. By forming coalitions of semantically coherent units (phrases describing product attributes or sentences capturing preferences), OSPO identifies which response parts drive performance. Experiments on Amazon ESCI and H\u0026M Fashion datasets show consistent gains over baselines, with notable test-time robustness to out-of-distribution retrievers unseen during training.",
"arxiv_id": "2601.08403",
"authors": [
"Abhijnan Nath",
"Alireza Bagheri Garakani",
"Tianchen Zhou",
"Fan Yang",
"Nikhil Krishnaswamy"
],
"categories": [
"cs.AI"
],
"license": "http://creativecommons.org/licenses/by/4.0/",
"title": "Owen-Shapley Policy Optimization (OSPO): A Principled RL Algorithm for Generative Search LLMs",
"url": "https://arxiv.org/abs/2601.08403",
"version": "v1"
},
"schema_id": "dorsal/arxiv",
"source": {
"execution_id": "a509e8d9-b39b-46ad-a239-0f4b95f41fb9",
"id": "arXiv Dataset",
"type": "Model",
"variant": "snapshot-2026-01-17",
"version": "0.1.0"
},
"user_id": 1000002
}