Papers
Topics
Authors
Recent
Search
2000 character limit reached

Stabilizing On-Policy Targeted Guidance in Agentic Reinforcement Learning

Published 3 Nov 2026 in cs.LG | (2611.05266v2)

Abstract: Naive on-policy RL is often bottlenecked by the capabilities of the base model --- insufficient coverage can result in an inability to learn from certain rewards. At the same time, rewards in modern post-training systems often come from rich textual sources, e.g. judge models with a rubric of criteria. Can we utilize such structures to provide a rich directional signal that enables improving on otherwise difficult to optimize rewards? In this work, we examine a framework we refer to as targeted guidance that learns from per-turn textual feedback via an on-policy self-distillation objective. Our focus is not only on directly improving hard-to-optimize behaviors, but on how to do so throughout the training process without degrading baseline RL performance. Over a range of settings across an agentic multi-turn software engineering environment, we find success by combining targeted self-distillation with a per-criteria RL reward, and by limiting feedback to turns where the policy specifically fails. We further examine the design choices that lead to stable entropy and reduce oscillatory behavior throughout training.

Summary

  • The paper introduces targeted self-distillation for stabilizing agentic reinforcement learning whereas on-policy reinforcement learning otherwise fails to learn sparse and rare-to-observe behaviours.
  • It achieves significant performance gains on various stylistic criteria and is robust to conditions like training and learning to write poems in coding tasks.
  • The additional computational requirement over the base method is primarily one expert forward pass per rollout batch, though memory and communication costs become significant for longer contexts and larger vocabularies.

The paper presents targeted guidance as a method for extending on-policy reinforcement learning beyond the behavioral support of a base LLM while preserving performance on an established primary task. Its central setting is agentic reinforcement learning with multi-turn tool use, where sparse terminal rewards and limited policy coverage can prevent policy-gradient methods from learning behaviors that are initially rare or absent. The proposed solution is to convert textual, per-criterion feedback into a localized self-distillation target and to apply that target only when the current policy fails the corresponding criterion.

Motivation and problem formulation

The paper addresses a specific failure mode of on-policy RL for language agents. Standard policy-gradient optimization increases the probability of actions already sampled in successful trajectories, but it provides little information about how to construct behaviors that the current policy almost never produces. This is especially consequential in multi-turn environments: a tool-call format, stylistic convention, or intermediate action may be required before the agent can obtain a useful terminal reward. If the relevant behavior lies outside the effective support of the policy, repeated scalar rewards do not necessarily create a path toward it.

Modern reward pipelines frequently contain more information than the scalar reward exposed to RL. A judge may evaluate several criteria and produce textual feedback explaining why a rollout failed. The paper treats this feedback as a directional signal rather than discarding it during reward aggregation. Each binary reward component has an associated feedback string, and the feedback is inserted immediately before the agent turn responsible for the failure.

The setting assumes a terminal reward decomposed into weighted criteria,

R(τ)=∑iλiRi(τ),R(\tau) = \sum_i \lambda_i R_i(\tau),

where the primary criterion is typically task completion and auxiliary criteria encode properties such as tool usage, formatting, style, or output length. The authors assume that these criteria are sufficiently independent that an auxiliary behavior can be modified without necessarily damaging coding performance. This assumption is important: the method is designed primarily for targeted auxiliary changes, not for arbitrary transformation of the policy.

Targeted self-distillation

For a failed criterion at turn tt, the method constructs a feedback-conditioned expert from the current policy itself. If ftf_t denotes the textual feedback, the expert is

μ(⋅∣st)=πθ(⋅∣st,ft),\mu(\cdot \mid s_t) = \pi_\theta(\cdot \mid s_t, f_t),

while at untargeted states it coincides with the ordinary policy. The live policy is then trained toward the feedback-conditioned distribution through a token-level KL objective. The teacher shares the student’s weights, so the method does not require a separately trained expert or autoregressive generation of replacement trajectories.

The final objective combines GRPO with the targeted distillation term:

L(θ)=LGRPO(θ)+λ∑t∈FKL(πθ(⋅∣st)  ∥  sg⁡(πθ(⋅∣st,ft))),\mathcal{L}(\theta) = \mathcal{L}_{\mathrm{GRPO}}(\theta) + \lambda \sum_{t \in F} \mathrm{KL} \left( \pi_\theta(\cdot \mid s_t) \;\middle\|\; \operatorname{sg}\bigl(\pi_\theta(\cdot \mid s_t,f_t)\bigr) \right),

where FF contains agent turns that fail at least one criterion, λ\lambda is the distillation weight, and stop-gradient prevents the expert target from changing within the update.

Three design choices define the method’s stability profile. First, feedback is inserted locally before the offending turn rather than globally into the entire context. Second, the KL term is masked on all turns that do not contain a relevant failure. Third, the textual guidance is combined with an ordinary RL reward for the same criterion. The distillation term supplies a directional mechanism for reaching low-probability behaviors, whereas the RL term remains responsible for evaluating and refining those behaviors on-policy.

The paper motivates this construction using approximate policy-improvement arguments. A feedback-conditioned expert is useful when it has positive expected advantage under the current state distribution, while its divergence from the live policy should remain limited. Neither condition is guaranteed merely by supplying text. Consequently, the authors propose evaluating candidate feedback strings by comparing the performance of the feedback-conditioned model against the contextless model and retaining prompts that produce an empirical improvement.

The use of reverse KL is not presented as essential. Forward KL, Jensen–Shannon divergence, and a Rao–Blackwellized KL estimator reportedly behaved similarly in preliminary comparisons, although the paper does not provide a systematic study of these alternatives. The implementation uses full-vocabulary logits computed on the trainer side, avoiding a sample-based estimator and reducing inference–training mismatch. The additional computational requirement is therefore primarily one expert forward pass per rollout batch; no teacher rollout is required.

Tool-format correction

The first experiment isolates a concrete coverage problem: introducing a semantic-search tool format that was absent from the supervised fine-tuning distribution. The new format requires an additional parameter specifying the number of lines returned. Standard RL receives a reward for correct tool use, but the base policy does not initially produce the required syntax.

Targeted guidance injects feedback before turns in which the tool is called incorrectly. The feedback-conditioned policy exposes a distribution over the corrected format, and the distillation loss transfers this signal to the live policy. The reported result is qualitative but operationally important: the agent learns the new tool format without regressing on primary coding performance. The localization mechanism is especially relevant because the distillation signal concentrates on tokens where the feedback-conditioned and unconditioned policies disagree, rather than uniformly reshaping the entire response.

This experiment supports the paper’s claim that targeted guidance can address behaviors that are difficult to obtain through scalar on-policy rewards alone. It does not, however, establish that the method scales to arbitrary tool semantics or that the feedback-conditioned expert is reliable when the base model lacks the relevant conceptual knowledge. The demonstrated correction is a formatting behavior whose intended solution can be communicated directly in text.

Optimization of multiple stylistic criteria

The main comparison evaluates a Qwen3-Coder-30B policy in a multi-turn software-engineering harness. The training setup combines GRPO for coding pass-rate and length regularization with several methods for optimizing stylistic criteria. The policy is trained on a single-epoch problem set, with asynchronous inference and training, a learning rate of 3×10−63 \times 10^{-6}, and batches consisting of 32 groups with 32 rollouts per group.

The stylistic criteria include requirements such as using Markdown, describing the problem, ordering content, requesting approval, bolding commands, running commands, and suggesting work. The results show a pronounced advantage for targeted guidance in the joint objective:

Method Markdown Solution description Requirement order Approval Bolded commands Run commands Suggestions Coding pass-rate
Baseline 0.00 0.70 0.04 0.00 0.43 0.00 0.03 0.33
GRPO 0.00 0.96 0.48 0.00 0.95 0.00 0.20 0.33
OPSD 0.77 0.88 0.29 0.25 0.90 0.01 0.44 0.30
Online SFT 0.01 0.78 0.29 0.02 0.69 0.00 0.28 0.26
LaTRO 0.00 0.57 0.03 0.00 0.21 0.00 0.07 0.14
Verifree 0.01 0.83 0.26 0.01 0.65 0.00 0.15 0.20
Targeted guidance 0.85 0.95 0.77 0.55 0.99 0.64 0.85 0.33

Targeted guidance achieves the highest reported value on every listed stylistic criterion while matching the $0.33$ coding pass-rate of GRPO and the baseline. The gains are particularly large for criteria that standard GRPO effectively fails to optimize: Markdown rises from $0.00$ under GRPO to $0.85$, command execution from $0.00$ to $0.64$, and suggestions from $0.20$ to $0.85$. The approval criterion improves from $0.00$ to $0.55$, while requirement ordering increases from $0.48$ to $0.77$.

The comparison also clarifies the role of combining RL with distillation. OPSD obtains strong performance on some criteria, including Markdown at $0.77$ and bolded commands at $0.90$, but its results are less consistent and coding pass-rate falls to $0.30$. Online SFT, LaTRO, and Verifree all reduce coding performance, with pass-rates of $0.26$, $0.14$, and $0.20$, respectively. The authors attribute these regressions partly to off-policy teacher-generated actions and, for Online SFT, to continual supervised pressure in an asynchronous training regime. These explanations remain hypotheses rather than controlled causal findings, since the methods differ in more than one implementation detail.

The strongest empirical claim is therefore not simply that textual feedback improves auxiliary behavior. It is that failure-gated, on-policy, token-level distillation combined with per-criterion RL can improve a broad suite of auxiliary objectives without the primary-task degradation observed in several alternative methods.

Multi-turn and interleaved feedback

The paper next evaluates criteria that apply at every agent turn rather than only to a final response. The chosen criterion requires each status report to be written as a poem, a behavior described as substantially outside the base model’s ordinary distribution. This setting tests whether guidance remains stable when feedback is repeatedly interleaved throughout a trajectory.

GRPO improves coding pass-rate but fails to optimize the poem criterion. Targeted guidance learns the required style while largely preserving coding performance. Two ablations identify the importance of the proposed stabilization components. Removing the per-criterion RL reward produces an OPSD variant that learns poems at a reasonable rate but becomes unstable, inconsistently maintains the behavior, and incurs a significant coding regression. Applying feedback on every turn, including turns where the criterion has already been satisfied, also causes a coding regression.

These ablations support a division of labor between the two objectives. Distillation initiates movement toward behavior outside the policy’s effective support, while the corresponding RL reward determines whether the behavior should be retained. Failure gating prevents the auxiliary objective from continuing to perturb already-correct behavior. The experiment also indicates that turn-level localization is not merely a computational convenience: it is a mechanism for controlling interference in multi-turn policies.

Entropy, collapse, and reasoning-token distillation

The paper identifies a sharp increase in policy entropy as an early indicator of collapse. In unstable runs, entropy growth is accompanied by increasing output length and followed by a decline in coding pass-rate. High distillation weights yield faster initial stylistic improvement but subsequently cause collapse in both stylistic and coding rewards. Lower weights improve style more slowly while remaining stable.

The proposed explanation is recursive self-distillation. Because the teacher and student share parameters, an increase in student entropy can also alter the feedback-conditioned teacher distribution. Subsequent distillation may reinforce this broadening, producing a positive feedback loop. The analysis implies that entropy growth itself is not necessarily pathological: some increase is expected when the policy begins assigning probability to low-likelihood behaviors. The failure condition is an abrupt spike indicating excessive or poorly localized exploratory pressure.

A static distillation weight is sufficient to maintain a stable regime in the reported experiments. The paper nevertheless leaves the choice of this coefficient as a practical tuning problem and suggests dynamic weighting as a possible efficiency improvement. No general stability criterion or adaptive schedule is derived.

A second instability concerns oscillations among competing stylistic criteria. When the distillation loss is applied only to final-message tokens, individual criteria improve and later regress as pressure shifts among incompatible or competing requirements. Including thinking tokens in the distillation objective substantially reduces this behavior. The authors report that thinking-token distillation changes the trajectory from oscillatory to comparatively monotonic improvement.

The qualitative explanation is that intermediate reasoning begins to encode multiple stylistic constraints. Without distillation on thinking tokens, the reasoning trace may contain no representation of the style requirements, leaving the final response to satisfy them through unstable local adjustments. With thinking-token distillation, the trace includes explicit reminders concerning summaries, explanations, formatting, and confirmation. In this interpretation, thinking-token KL acts as a mechanism for propagating feedback across the causal computation that precedes the final action.

This result is notable but should be interpreted narrowly. The paper does not establish that distilling into hidden reasoning is universally beneficial, nor does it separate the effect of additional token-level supervision from the effect of increased loss magnitude or sequence coverage. The evidence supports the claim that, in this agentic coding setup, excluding thinking tokens is associated with greater criterion oscillation.

Limitations and open questions

The method requires a designed feedback string for every reward criterion. Its effectiveness consequently depends on prompt engineering and on the policy’s ability to interpret the feedback in context. The judge must produce feedback that is both behaviorally specific and compatible with the policy’s capabilities; poorly targeted feedback can provide a misleading expert distribution and interfere with the primary objective. The paper does not provide a systematic evaluation of feedback quality, automatic feedback generation, or robustness to judge errors.

The empirical scope is limited to multi-turn software engineering with Qwen3-Coder-30B. Most auxiliary targets concern style and formatting rather than core reasoning or task competence. It therefore remains open whether the same stabilization principles apply when feedback concerns algorithm selection, long-horizon planning, factual reliability, or behaviors whose optimization directly conflicts with task success.

The comparisons are also incomplete relative to the broader OPSD literature. Several related methods are not ported into the experimental harness, and the paper does not fully isolate the contribution of each atomic choice: reverse versus forward KL, full-vocabulary versus sampled targets, per-turn versus global context insertion, failure gating, thinking-token coverage, and the additional per-criterion RL reward. The asynchronous training setup further complicates attribution because some baselines use teacher-generated actions that may become stale.

The asymptotic argument is conditional. If all criteria are consistently satisfied, failure gating removes the distillation term and the objective reduces to standard policy-gradient optimization. This supports convergence to the optimal policy only under the stated assumptions, including the existence of such a policy and adequate optimization. If feedback-conditioned and optimal policies continue to differ because of spurious context effects, the method may remain biased before the gating condition is reached. The paper does not prove that the gating mechanism prevents all such residual bias.

Finally, the computational advantage over teacher-generation methods depends on access to full-vocabulary logits and efficient trainer-side kernels. Although the authors estimate the main incremental cost as one additional forward pass, memory and communication costs may become material for longer contexts, larger vocabularies, or more frequent turn-level feedback.

Conclusion

"Stabilizing On-Policy Targeted Guidance in Agentic Reinforcement Learning" (2611.05266) develops a localized self-distillation procedure for converting textual reward feedback into an on-policy exploration signal. Its essential design is to condition a same-weights expert on per-turn feedback, apply full-vocabulary KL only at failed turns, and retain an ordinary RL reward for each guided criterion. Across software-engineering experiments, this combination learns behaviors that standard GRPO fails to discover, reaches substantially higher stylistic-criterion scores, and preserves the reported coding pass-rate at $0.33$. The results further identify distillation-weight control and thinking-token coverage as important stability variables. The principal unresolved issue is whether feedback design and failure-gated self-distillation remain reliable when the auxiliary objectives concern substantive capabilities rather than formatting and style.

Paper to Video (Beta)

No one has generated a video about this paper yet.

Whiteboard

Explain it Like I'm 14

1. What is this paper about?

This paper studies how to train AI agents to improve at difficult tasks, especially software engineering tasks such as editing code and using computer tools.

The researchers focus on a problem with normal reinforcement learning (RL). In RL, an AI tries something, receives a reward or score, and gradually learns to repeat actions that earn higher scores. However, this method struggles when the AI almost never tries the correct behavior in the first place.

For example, suppose an AI must use a new tool in a special format. If it never produces that format, ordinary RL has no good example to learn from. The paper proposes a method called targeted guidance, which gives the AI short, useful text feedback—similar to a teacher’s hint—when it makes a specific mistake.

2. What questions did the researchers ask?

The main questions were:

  • Can written feedback help an AI learn behaviors that ordinary RL cannot discover?
  • Can the AI learn several goals at the same time, such as using the correct tool format and following a particular writing style?
  • Can this extra guidance be added without making the AI worse at its main task, such as solving programming problems?
  • What design choices make training stable instead of causing the AI’s behavior to suddenly become worse?

The researchers were especially interested in avoiding problems such as:

  • Collapse, where the AI’s behavior becomes confused or useless.
  • Oscillation, where the AI learns one behavior but then forgets it while learning another.
  • Loss of diversity, where the AI produces fewer kinds of answers than before.

3. How did the researchers approach the problem?

Reinforcement learning

The AI was trained in a multi-step software environment. It could:

  1. Read a programming problem.
  2. Think about what to do.
  3. Call tools.
  4. Edit code.
  5. Receive a score based on how well it solved the problem.

This is similar to training a student by giving them practice problems and rewarding correct answers.

The researchers used several kinds of rewards. The main reward measured whether the code worked. Additional rewards measured things such as:

  • Whether the AI used a tool correctly.
  • Whether it followed a requested writing style.
  • Whether it explained its work in a certain way.
  • Whether it kept its answer to a reasonable length.

Textual feedback as a teacher’s hint

When the AI failed a particular requirement, a judge supplied feedback such as:

“Use the semantic-search tool with the required number-of-lines parameter.”

The AI then saw this feedback before trying that part of the task again.

The researchers created a temporary “expert” by using the same AI model with the feedback added to its context. The model with the hint often chose better next words or actions. The original model was then trained to make its predictions more like this feedback-guided version.

This is called self-distillation. An everyday analogy would be:

  • A student first tries to solve a problem alone.
  • A teacher gives the student a hint.
  • The student watches how they would solve it with the hint.
  • The student practices making the improved choice independently next time.

Only guide the AI when necessary

The researchers found that the feedback should not be used everywhere. They applied it only:

  • On turns where the AI actually failed a requirement.
  • To the particular part of the conversation connected to that failure.
  • Alongside the normal RL reward.

This was important because constant advice could interfere with behaviors the AI had already learned well.

The technical training signal

The researchers used a mathematical measure called KL divergence. In simple terms, it measures how different two sets of probabilities are.

A LLM gives different probabilities to possible next words. The researchers encouraged the ordinary model to have probabilities similar to the feedback-guided model, especially on the words where the two models disagreed.

They also tested the method on the AI’s internal “thinking” text, not just its final answer. This helped the AI remember several instructions at once.

4. What did they find?

The AI learned behaviors that normal RL missed

In one experiment, the AI had to use a new format for a semantic-search tool. Normal RL failed because the original model almost never produced the new format.

Targeted guidance helped the AI learn the correct format. Importantly, its main coding performance did not get worse.

It improved many writing-style requirements

The researchers tested requirements such as:

  • Including a Markdown table.
  • Describing the user’s problem.
  • Giving suggestions.
  • Using bold text.
  • Running a particular command.
  • Writing status updates as poems.

The results showed that targeted guidance improved many of these behaviors more reliably than the other tested methods.

A simplified version of the results is:

Training method Learned style requirements Maintained coding performance
Standard RL Some, but not all Usually yes
Basic self-distillation Some Mostly
Online supervised training Some Often worse
Targeted guidance Most of the tested requirements Yes, about as well as the baseline

The exact scores differed by requirement, but the main pattern was clear: targeted guidance improved extra behaviors while preserving the AI’s main coding ability.

It handled unusual behaviors

In another experiment, the AI had to write a poem in every status update. This was very different from the behavior it had originally learned.

Normal RL failed to discover this behavior. Targeted guidance helped the AI adopt it while still solving coding tasks.

The method was more stable when designed carefully

The researchers found several important design rules:

  • Use feedback only when the AI fails. Giving feedback all the time caused a drop in coding performance.
  • Combine feedback with ordinary RL rewards. Feedback helped the AI discover new behaviors, while RL helped it keep and refine them.
  • Keep the feedback strength moderate. If the guidance was too strong, the AI became unstable. Its answers became longer and more random, and its coding performance later collapsed.
  • Guide the model’s internal thinking as well as its final answer. This helped it remember several requirements at once and reduced the pattern of improving one behavior while forgetting another.

In technical language, the researchers monitored the model’s entropy, which measures how spread out or uncertain its predictions are. A sudden jump in entropy was an early warning that training might soon become unstable.

5. Why are these findings important?

Normal RL is good at strengthening behaviors that an AI already performs sometimes. But it is not good at teaching a completely new behavior if the AI never tries it.

Targeted guidance helps solve this “how would the AI ever discover the right action?” problem. It provides a direction without completely replacing the AI’s own behavior.

The method is also useful because modern AI systems often receive rich written evaluations from judges or reviewers. Instead of reducing all that information to one number, targeted guidance uses the actual explanation.

For example, a score of 0 only says that something went wrong. A message such as “include the required parameter in the tool call” explains how to improve.

6. Simple conclusion and possible impact

The paper argues that AI training can work better when it combines:

  • Rewards, which tell the AI whether it succeeded.
  • Textual hints, which explain how to improve.
  • Careful timing, so advice is given only when needed.

This could help future AI agents learn new tool commands, communication styles, safety rules, or other behaviors that are difficult to discover through trial and error alone.

However, the research has limits. The experiments mainly involved software-engineering agents and style or formatting goals. Each goal also needed a carefully written feedback message. The researchers do not yet know how well the method will work for every kind of task.

Overall, the paper’s main message is:

An AI can learn difficult new behaviors more reliably when it receives specific hints at the exact moment it makes a mistake—but the hints must be used carefully so they do not disrupt skills the AI already has.

Practical Applications

Immediate Applications

The paper’s method can be integrated into existing on-policy reinforcement-learning pipelines, particularly where a model receives verifiable rewards plus textual feedback. The most directly deployable applications are concentrated in agentic software systems, although the underlying workflow is transferable.

  • Software engineering agents: learning new tool-call formats (Software; Immediate Application) A coding agent can receive targeted feedback when it uses an outdated or invalid API, search command, parameter schema, or tool delimiter. The feedback-conditioned model supplies token-level guidance only on the failed turn, while the normal task-completion reward preserves coding performance. Potential product/workflow: an RL training component that automatically teaches coding agents newly introduced tools without requiring a complete supervised fine-tuning cycle. Dependencies: reliable detection of tool-format violations, accurate textual hints, an on-policy training pipeline, and sufficiently capable base-model understanding of the feedback.
  • Improving coding-agent communication style without reducing correctness (Software; Immediate Application) Development teams can optimize auxiliary requirements such as “describe the user’s problem,” “include a Markdown table,” “explain the solution,” “use a specified command format,” or “request confirmation.” Targeted guidance is applied only when the criterion fails, while coding pass-rate remains part of the ordinary RL objective. Potential product/workflow: configurable style policies for enterprise coding assistants, with organization-specific response rubrics enforced during post-training. Dependencies: style criteria must be independently judgeable; criteria that strongly conflict with task correctness may require careful reward weighting and validation.
  • Multi-criteria quality control for LLM agents (Software and enterprise AI; Immediate Application) An existing judge-based post-training system can retain its scalar rewards while also emitting per-criterion explanations. These explanations can be converted into feedback strings and used to target specific failures rather than applying a global distillation loss. Potential product/workflow: a training dashboard showing criterion-level failure rates, feedback effectiveness, KL divergence, entropy, output length, and primary-task performance. Dependencies: judge-model reliability, calibration of binary or weighted criteria, and safeguards against feedback that is incorrect, ambiguous, or overly prescriptive.
  • Learning rare output formats and structured communication (Enterprise automation, documentation, customer support; Immediate Application) Models can be trained to produce uncommon but operationally useful formats—status reports, incident summaries, structured handoffs, XML or JSON schemas, compliance disclosures, or domain-specific templates—even when those behaviors have little support in the base policy. Potential product/workflow: a post-training system that adds new formatting conventions through targeted hints rather than collecting a large new demonstration dataset. Dependencies: format validators must accurately identify failures, and the feedback must specify the required change without unintentionally altering content quality.
  • Agent-specific error correction during RL training (Software infrastructure; Immediate Application) Failed turns can be routed to a feedback-conditioned expert, with the distillation loss masked on all unrelated turns. This provides a practical debugging and training workflow for tool misuse, invalid arguments, incomplete action sequences, and repeated reasoning loops. Potential product/workflow: automated “failure replay” pipelines that associate each failed action with a judge explanation and a localized policy update. Dependencies: accurate turn attribution; asynchronous training systems may require controls for stale rollouts and stale feedback.
  • Safer deployment of style and policy updates (Software governance and AI operations; Immediate Application) The method can support incremental policy changes while monitoring whether the base capability degrades. Because the paper finds that high distillation weights can produce entropy spikes, teams can use entropy, token length, and primary-task reward as deployment gates. Potential product/workflow: a model-release checklist that blocks a training run when output length rises sharply, entropy becomes unstable, or verified task performance falls. Dependencies: suitable baseline metrics, threshold selection, representative evaluation data, and independent safety testing.
  • Academic research infrastructure for studying exploration in language-model RL (Academia; Immediate Application) Researchers can use the framework as a controlled baseline for comparing scalar rewards, on-policy self-distillation, online SFT, likelihood-based rewards, and targeted guidance. The method also offers experimentally testable interventions: failure-only gating, per-criterion RL rewards, feedback placement before the offending turn, and distillation over reasoning tokens. Potential tool: an open benchmark containing multi-turn tasks, auxiliary criteria, judge feedback, failure localization, and stability metrics. Dependencies: reproducible implementations, transparent judge prompts, access to substantial compute, and evaluation beyond a single software-engineering environment.
  • Targeted reinforcement learning for robotics and tool-using systems (Robotics; Immediate Application with adaptation) In a robot or workflow agent, textual feedback could identify localized failures such as an incorrect action sequence, invalid tool invocation, or failure to follow a safety procedure. The approach is most immediately applicable to language-mediated controllers and simulator-based training rather than directly to continuous motor control. Dependencies: a language interface between the feedback and policy, reliable event-level failure detection, and evidence that textual guidance maps consistently to physical actions. Real-world deployment would require safety constraints and conservative policy updates.

Long-Term Applications

The paper supports broader applications, but these require validation beyond software engineering, improved feedback generation, or scaling to more complex environments.

  • General-purpose post-training for healthcare, finance, and legal agents (Healthcare, finance, legal technology; Long-Term Application) Domain agents could receive criterion-specific guidance for behaviors such as citing evidence, asking required clarification questions, documenting uncertainty, following approval workflows, or formatting regulated reports. The ordinary task reward could preserve diagnostic, analytical, or retrieval performance while targeted guidance improves compliance behavior. Dependencies: high-quality domain judges, expert-validated feedback, privacy-preserving training data, robust hallucination evaluation, and formal human oversight. Textual feedback must not be treated as authoritative in high-stakes decisions without independent verification.
  • Policy-compliant and auditable AI systems (Public policy and enterprise governance; Long-Term Application) Regulators or organizations could define explicit criteria for transparency, refusal behavior, data handling, accessibility, or documentation. A judge would identify failed criteria and produce actionable explanations that are distilled into the policy. Potential product/workflow: policy-as-code systems that convert regulations into verifiable criteria and maintain audit trails of failed rollouts, feedback, and policy changes. Dependencies: regulations must be translated into unambiguous operational tests; automated judges may encode bias or misinterpret legal requirements; human review remains necessary.
  • Adaptive educational tutors (Education; Long-Term Application) Tutors could be trained to improve specific pedagogical behaviors—such as asking a diagnostic question, giving a hint rather than an answer, adapting to reading level, or explaining a misconception—based on per-turn feedback. Failure-only gating could avoid unnecessarily changing responses that are already effective. Dependencies: validated learning-outcome measures, age-appropriate safety controls, privacy protections, and evidence that judge feedback improves learning rather than merely stylistic compliance.
  • Long-horizon reasoning and research agents (Scientific computing and knowledge work; Long-Term Application) Per-step feedback could guide agents to verify intermediate claims, maintain a plan, use appropriate tools, report uncertainty, or recover from failed experiments. Distilling guidance into internal reasoning tokens may reduce oscillation among competing objectives, as suggested by the paper’s ablation results. Dependencies: reliable process-level verifiers, explanations that improve rather than shorten reasoning, long-horizon credit assignment, and safeguards against models learning to satisfy the evaluator superficially.
  • Robotic manipulation and autonomous planning (Robotics; Long-Term Application) A future multimodal version could translate feedback such as “grasp from the stable side,” “re-check the object pose,” or “use the calibrated tool” into localized policy updates. The failure-turn gating principle could limit changes to the action that caused the problem. Dependencies: multimodal feedback, simulation-to-real transfer, low-latency inference, safety-constrained RL, and proof that language-conditioned self-distillation improves physical success rates without increasing unsafe exploration.
  • Dynamic tool and API adaptation (Software platforms and cloud infrastructure; Long-Term Application) Agents could continuously learn evolving APIs, database schemas, deployment commands, and service-specific conventions from validation errors and textual documentation. This could reduce the need to retrain a model whenever an interface changes. Potential product: an API-adaptation layer that converts runtime errors, schema validators, and documentation into localized training feedback. Dependencies: secure handling of untrusted tool output, protection against prompt injection, stable versioning, and mechanisms preventing the agent from learning unsafe workarounds.
  • Automatically learned feedback and gating policies (Machine-learning research; Long-Term Application) The paper identifies static human-designed feedback strings as a limitation. Future systems could learn which explanation is most useful, when to apply it, and how strongly to weight it. A meta-optimization loop could jointly train the judge, feedback generator, gating mechanism, and policy. Dependencies: reliable outer-loop objectives, prevention of reward hacking, computational scalability, and evaluation that distinguishes genuine capability improvement from judge exploitation.
  • Dense, rollout-level guidance for complex behaviors (General agentic AI; Long-Term Application) The current method targets individual turns. A more advanced version could provide feedback throughout an entire trajectory, including planning, tool selection, intermediate verification, and final reporting. This may help with tasks whose success depends on coordinated behavior across many turns. Dependencies: credit assignment across long trajectories, control of feedback interference, efficient storage of full-vocabulary targets, and stronger theoretical guarantees regarding convergence and bias.
  • Personalized assistants that preserve user preferences while improving competence (Daily life and consumer AI; Long-Term Application) Assistants could learn preferences such as concise responses, accessibility formats, household workflows, or preferred planning styles while retaining core task performance. Failure-only guidance could prevent unnecessary changes to interactions that already work well. Dependencies: explicit user consent, privacy-preserving personalization, protection against conflicting preferences, and reliable separation between harmless style changes and changes affecting factuality or safety.
  • Energy-efficient RL post-training (Energy and AI infrastructure; Long-Term Application) Because the teacher need not autoregressively generate replacement trajectories, the method could reduce the cost of some guided-training workflows relative to online SFT or expert rollout generation. Optimized kernels and last-hidden-layer implementations could make targeted guidance more practical at scale. Dependencies: the additional forward pass must remain cheaper than generating alternative trajectories; full-logit KL computation, memory use, and large-model training costs still require engineering optimization.
  • Standardized stability-aware training platforms (Industry and academia; Long-Term Application) The paper suggests a general control framework in which distillation strength is adjusted according to entropy, output length, failure rates, and primary-task reward. Future platforms could automatically reduce guidance when entropy spikes or when auxiliary objectives begin to interfere with core performance. Potential product: an adaptive RL controller with dynamic distillation weights, criterion routing, rollback checkpoints, and automatic regression detection. Dependencies: robust early-warning metrics, reliable dynamic weighting algorithms, and evidence that stability indicators transfer across models, tasks, and domains.

Glossary

  • Agentic reinforcement learning: Reinforcement learning in which an AI agent performs multi-step actions, often using tools, to accomplish a task. “agentic multi-turn software engineering environment”
  • Autoregressive generation: Sequential generation in which each new token is conditioned on previously generated tokens. “we evaluate the feedback via autoregressive generation in this procedure”
  • Base policy: The initial or reference policy from which training begins. “We assume access to a base model which defines a starting policy π0\pi_0.”
  • Behavioral support: The set of actions or behaviors that a policy can produce with nonzero probability. “if the actions that satisfy such criterion are not within the support of the base policy”
  • Binary reward: A reward taking one of two values, typically indicating whether a criterion was satisfied. “each binary reward component can additionally define a textual feedback string”
  • Conditional expert policy: A policy formed by conditioning a model on additional information, such as textual feedback. “The policy conditioned on the feedback string then becomes an expert to serve as a source of guidance signal”
  • Convergence: The process by which an optimization procedure approaches a stable solution or policy. “it is less clear that such objectives result in stable convergence”
  • Criterion gating: Restricting an optimization signal to cases in which a specified criterion is not satisfied. “the distillation objective is only evaluated on agent turns that contain a failed criterion”
  • Distillation weight: A coefficient controlling the contribution of a distillation loss to the total training objective. “λ\lambda is the distillation weight”
  • Diversity collapse: A reduction in the variety of outputs generated by a model or policy. “reasoning shortening [31, 30, 48] or diversity collapse [28, 2]”
  • Entropy: A measure of uncertainty or spread in a probability distribution, here describing the policy’s action probabilities. “We find that an early predictor of collapse when utilizing distillation signal is a sharp increase in policy entropy.”
  • Expert distillation: Training a student policy to imitate the output distribution of an expert policy. “Expert distillation as approximate policy improvement.”
  • Feedback-conditioned expert: An expert distribution produced by conditioning the same model on textual feedback. “a per-token KL loss against a feedback-conditioned expert policy”
  • Forward KL: The Kullback–Leibler divergence computed in the direction that weights discrepancies according to the first distribution. “we found that forward-KL, Jensen-Shannon distance, and Rao-Blackwellized KL [4] performed similarly”
  • Full-vocabulary KL loss: A divergence loss computed over the complete vocabulary rather than only sampled tokens. “we utilize a full-vocabulary KL loss computed entirely on the trainer side”
  • GRPO: Group Relative Policy Optimization, a reinforcement-learning method that uses relative rewards among groups of sampled outputs. “we combine various style-optimization methodologies with a baseline GRPO algorithm”
  • Hidden test cases: Evaluation examples whose inputs or expected results are not exposed during training. “as evaluated by hidden test cases”
  • Inference-trainer mismatch: A discrepancy between the model used to generate training data and the model used to optimize it. “To reduce undesirable effects from inference-trainer mismatch”
  • Interleaved feedback: Feedback applied at multiple points throughout a multi-turn trajectory rather than only at its end. “DOES TARGETED GUIDANCE REMAIN STABLE EVEN WHEN OPTIMIZING MULTI-TURN INTERLEAVED FEEDBACK?”
  • Jensen–Shannon distance: A symmetric and bounded divergence measure comparing two probability distributions. “we found that forward-KL, Jensen-Shannon distance, and Rao-Blackwellized KL [4] performed similarly”
  • Judge model: A model that evaluates an output against specified criteria and may provide a score or explanation. “each criterion RiR_i is implemented as a call to judge LLM”
  • Kullback–Leibler divergence: A measure of the difference between two probability distributions. “we minimize KL between the live policy and μ\mu over the on-policy state distribution dπd_\pi”
  • Likelihood-as-reward: A method that uses the probability assigned to an output as a reinforcement-learning reward. “LaTRO [10], a representative likelihood-as-reward method.”
  • Markov decision process: A formal model of sequential decision-making defined by states, actions, transitions, and rewards. “We define a Markov decision process (MDP) by a state space SS, an action space AA”
  • On-policy reinforcement learning: Reinforcement learning that trains on trajectories generated by the current policy. “Naive on-policy RL is often bottlenecked by the capabilities of the base model”
  • On-policy self-distillation: Distillation in which a policy learns from a feedback-conditioned version of itself using states generated by the current policy. “Our algorithmic setup builds on a rich body of prior work often referred to as on-policy self-distillation (OPSD) methods”
  • Out-of-distribution behavior: Behavior that differs substantially from the examples or behaviors represented in the training distribution. “This is an out-of-distribution behavior that lies outside the support of the base model.”
  • Policy collapse: A failure mode in which a learned policy loses useful behavior or becomes unstable. “Combining the approaches naively leads to some risk of policy collapse or stagnation.”
  • Policy gradient: An optimization method that updates a policy in the direction of higher expected reward. “alongside the typical policy gradient loss”
  • Privileged information: Information available to a teacher or evaluator but not ordinarily available to the student policy. “This judge is equipped with additional privileged information on the correct way to solve the problem”
  • Rao–Blackwellized KL: A variance-reduced or analytically improved estimator of Kullback–Leibler divergence. “we found that forward-KL, Jensen-Shannon distance, and Rao-Blackwellized KL [4] performed similarly”
  • Reasoning trace: A sequence of intermediate internal or textual reasoning steps generated by a model. “by applying distillation to internal thinking traces”
  • Reverse KL: The Kullback–Leibler divergence computed with the student distribution as the first argument and the teacher distribution as the second. “The distillation loss in our setting is calculated via reverse KL distance between the student and the teacher.”
  • Rollout: A complete sampled trajectory produced by an agent interacting with an environment. “If a given rollout or agent turn fails to satisfy a given reward criteria”
  • Self-distillation: Training a model to imitate a related version of itself, often one provided with additional context or information. “we introduced a simple targeted guidance approach that combines textual feedback self-distillation with standard on-policy RL.”
  • Stop gradient: An operation that prevents a tensor or distribution from receiving gradient updates during backpropagation. “The ‘sg‘ operator represents stop gradient.”
  • Trajectory: A sequence of states, actions, and observations generated during an episode. “which combined with the MDP creates a distribution of trajectories p(τ)p(\tau )”
  • Teacher policy: A policy whose outputs or probability distribution provide learning targets for another policy. “the teacher is used purely for logit-level guidance and does not require autoregressive generation.”
  • Token-level distillation: Distillation performed separately on the probability distribution for each generated token. “Our main approach is to utilize a per-token distillation target to provide this directional signal”
  • Tool-calling policy: A policy trained to invoke external tools using structured actions or arguments. “a supervised finetuning (SFT) phase to adapt it to the tool call setting”
  • Trust-region policy optimization: A reinforcement-learning approach that limits policy updates to remain close to the current policy. “We base our algorithmic considerations on classical policy improvement arguments [29, 55, 1].”
  • Zero-shot ability: The ability to perform a task without task-specific examples or additional training. “we rely on the zero-shot ability of the policy to process this information”

Open Problems

We haven't generated a list of open problems mentioned in this paper yet.

Tweets

Sign up for free to view the 3 tweets with 315 likes about this paper.