<p dir="ltr"><em>Scale&rsquo;s paper, <a href="https://scale.com/research/learning-goalconditioned-representations-large-rewards-models">Learning Goal-Conditioned Representations for Language Reward Models</a>, has been accepted to the NeurIPS 2024 main track. This post overviews the research presented in that paper.<br></em><em><strong>Paper Authors</strong>: Vaskar Nath, Dylan Slack, Jeff Da, Yuntao Ma, Hugh Zhang, Spencer Whitehead, Sean Hendryx</em></p>
<p dir="ltr">For large language models (LLMs) to power useful tools from coding assistants to autonomous browser agents, their behavior must be aligned to follow instructions given by users. Traditional methods for training language models, such as Reinforcement Learning from Human Feedback (RLHF) or methods like Direct Preference Optimization (DPO), evaluate the final product of their outputs. This approach often means missteps during generation aren't caught until it's too late, leading to more reasoning errors.</p>
<p dir="ltr">A new approach from researchers at Scale AI, inspired by <strong>goal-conditioned reinforcement learning</strong>, allows a reward model to provide early feedback throughout the generation process. By giving language models an ongoing sense of whether they're on the right track, this conditioning can improve performance on reasoning tasks.</p>
<p dir="ltr">The approach aims to enable <strong>detecting missteps during generation</strong> by extracting richer signals from traditional human preference labels. The model identifies points where the trajectory diverges from the desired outcome, allowing for resampling or other corrections without requiring direct intervention or additional fine-grained labels.</p>
<h2 dir="ltr">Goal-Conditioned Representations: The Value of Early Feedback</h2>
<p dir="ltr">Goal-conditioned representations provide continuous feedback to language models during text generation, allowing them to adjust based on whether they are moving toward the desired outcome. Instead of evaluating only at the final output, the reward model continuously checks its progress, allowing early correction of errors.</p>
<h3 dir="ltr">Q-function in Goal-Conditioned Representations</h3>
<p dir="ltr">Mathematically, a <em>Q</em>-function, denoted as <em>Q</em>(<em>s</em>, <em>a</em>), represents the expected cumulative reward starting from state <em>s</em> and taking action <em>a</em>, and following a specific policy of actions thereafter. In goal-conditioned reinforcement learning, the <em>Q</em>-function estimates the future reward of partially generated sequences, helping the model decide on the best course of action in real-time.</p>
<p dir="ltr">For example, in the GSM8k-style problem below, the model is expected to generate Python code to compute a solution. The <em>Q</em>-function evaluates the expected correctness of the solution after each token in the generated code, implicitly revealing the point at which an error is introduced:</p>
<p dir="ltr"><img src="https://img.plasmic.app/img-optimizer/v1/img?src=b4e1db6f3143e3b4c3e305fe275ff7cd.png&amp;f=webp&amp;q=75" alt="" width="1600" height="875"></p>
<div dir="ltr" align="center">
<table><colgroup><col width="667"></colgroup>
<tbody>
<tr>
<td>
<p dir="ltr"><strong>Figure</strong>: Excerpt from Appendix D showing an example of the method evaluating the correctness of a math problem as the solution is being given. At the point where a clear error is introduced &mdash; multiplying the per-dozen price of a box of donuts by 12, in the fifth line of the response &mdash;&nbsp;the Q-fuction&rsquo;s opinion of whether the answer is correct quickly turns negative.</p>
</td>
</tr>
</tbody>
</table>
</div>
<h2 dir="ltr">Evaluating Partial Solutions with Goal-Conditioned Representations</h2>
<p dir="ltr">Goal-conditioned representations rely on a Q-function to assess partially generated sequences and evaluate their likelihood of achieving the desired outcome.</p>
<p dir="ltr"><strong>Contrastive learning</strong> helps refine these representations by using a contrastive objective to identify promising paths. It encourages similarity to successful paths while discouraging similarity to unsuccessful ones, allowing for real-time adjustments during inference. This approach extracts fine-grained signals from pairwise preference annotations of completed outputs, improving the model's ability to learn from coarse feedback.</p>
<h2 dir="ltr">Benefits of Goal-Conditioned Representations</h2>
<p dir="ltr">Goal-conditioned representations offer two main benefits: improved accuracy and fine-grained control. Continuous feedback enables better performance across many reasoning tasks.</p>
<p dir="ltr">Benchmark evaluations on Codellama 7B showed significant improvements when using goal-conditioned representations to guide inference. On mathematical reasoning tasks like GSM8k and MATH, this approach improved AUROC by up to 0.09 compared to standard preference ranking training. For out-of-distribution (OOD) datasets, average improvements were 0.04, with a maximum of roughly 0.08 on the svamp dataset. Additionally, the approach enhanced alignment on the Helpful-Harmless dataset by increasing accuracy by 2.3%.</p>
<p dir="ltr">Goal-conditioned representations provide fine-grained control, allowing the model to steer outputs toward desired qualities such as helpfulness or complexity. Attributes like correctness and coherence can be represented as goals to guide the model and generate better responses.</p>
<h3 dir="ltr">Key Takeaway</h3>
<p dir="ltr">Goal-conditioned representations provide early feedback that can help align language models during inference. This method allows us to extract richer signals from traditional preference ranking datasets, leveraging intermediate representations without requiring additional human labels or fine-grained annotations. This enables better alignment with less effort, as these signals can better guide the model using existing data.</p>

Scale's research team has developed an approach to aligning language models using goal-conditioned representations. 