PoEM: Predicting RL Outcomes from Existing Policies
Foundation models are post-trained with reinforcement learning (RL) to maximize specific rewards, such as human alignment, correctness, or instruction following. This post-training process is computationally intensive, sometimes unstable, and has to be run from scratch every time the reward model changes or when we want to combine multiple rewards. We hence ask: given a new rew
Reading in Plain English mode — toggle below to switch
Foundation models are post-trained with reinforcement learning (RL) to maximize specific rewards, such as human alignment, correctness, or instruction following. This post-training process is computationally intensive, sometimes unstable, and has to be run from scratch every time the reward model changes or when we want to combine multiple rewards. We hence ask: given a new rew
This paper addresses the significant computational cost and instability associated with RL post-training for foundation models. By proposing a method to predict RL outcomes without running full RL, it offers a path to more efficient and stable model alignment, which is crucial for deploying robust AI systems.