Skip to content

Don't Mix Rewards, Mix Policies: Policy Decomposition and Optimization for Multi-Reward RL

Jul 2026 · arXiv.org · Vol abs/2607.29246 · 1 citation · 46 references
Computer Science

TL;DR

This work proposes PRISM, a new multi-reward RL framework built upon the idea of policy-space decomposition and composition, which alleviates the potential conflict during multi-reward policy optimization, while enabling controllability during inference by flexible policy composition.

Abstract

Modern large language models (LLMs) are expected not just to answer correctly, but to adapt their behavior to different human values and use cases. As a result, multi-reward reinforcement learning (RL) has become an increasingly important problem for LLMs, where each reward captures a different aspect of desired behavior. However, optimizing with multiple rewards suffers from a more severe alignment tax issue, where different optimization objectives can trade off or even conflict with each other, leading to unstable and inefficient post-training. In this work, we propose PRISM, a new multi-reward RL framework built upon the idea of policy-space decomposition and composition. Instead of compositing different rewards, PRISM optimizes a set of standalone positive policies and a global negative policy. This alleviates the potential conflict during multi-reward policy optimization, while enabling controllability during inference by flexible policy composition. Experiments on scientific reasoning, tool-use reasoning, and helpfulness-safety alignment show that PRISM consistently outperforms existing multi-reward RL baselines, with extra controllability for inference-time preference control.

View source

Similar papers

#machine learning Preprint Aug 2026

Learn What's Left, Not What's Mastered: Saturation Aware Advantage Reweighting for Multi-Reward Policy Optimization

Saturation Aware Advantage Reweighting for Multi-Reward Policy Optimization (SA-MRPO), which standardizes each reward objective independently and adaptively discounts its contribution according to a batch-level estimate of objective saturation, and dynamically reallocates optimization effort toward under-optimized obje...

Yi-Xuan Wang, Yi-Fei Chen, Haichao Zhang et al. · 3 citations · ⚡1
Preprint Jul 2026

RSPO: Reward-Swap Policy Optimization for Multi-Turn LLM Agents

Reinforcement learning holds significant potential for training large language models to handle multi-turn interactive tasks, but directly training with outcome rewards often results in slow convergence due to the sparsity of signals and the lack of fine-grained feedback.

Qiang Liu, Taian Guo, Ruizhi Qiao et al. · 0 citations
Preprint Aug 2026

To Go Far, Go Together: Diverse Preferences Induce a Curriculum for Reward Optimization

This work argues that, given a sufficiently diverse user population, a curriculum naturally emerges between easy- and hard-to-optimize reward models, and proposes CurriPO, which grows a tree-structured curriculum to accommodate diverse user-specific objectives, covering the population in a single traversal.

Taehyung Kim, Jongeun Choi · 0 citations
Jul 2026

MADA-RL: Multi-Agent Debate-Aware Reinforcement Learning for Parameter-Efficient Reasoning in Compact Models

A controlled study isolates the source of MADA-RL's gains: the counterfactual advantage produces the highest critic improvement rate of any model evaluated, indicating that trained critics learn to correct generator errors rather than to imitate them.

Martino M. L. Pulici, Cuong Xuan Chu, Evgeny Kharlamov et al. · 0 citations
Preprint Jul 2026

Inference-Time Policy Alignment for Fair Reinforcement Learning

This work formalizes inference-time fairness alignment as a policy shaping problem and proposes a multiplicative policy shaping framework that adjusts action probabilities using action-dependent welfare scores, thus requiring no modification to the base policy.

Umer Siddique, Peilang Li, Conor Wallace et al. · 0 citations
2025

LaRes: Evolutionary Reinforcement Learning with LLM-based Adaptive Reward Search

This work proposes LaRes, a novel hybrid framework that achieves efficient policy learning through reward function search by leveraging large language models to generate the reward function population, guiding RL in policy learning.

Pengyi Li, Hongyao Tang, Jinbin Qiao et al. · 7 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.