Failure logs are usually where AI teams put the evidence that training was expensive.

A reasoning model tries a problem. It gets most of the chain right. Then, near the end, it makes one bad algebraic turn, chooses the wrong case, or quietly invents a rule that mathematics did not approve. Under standard reinforcement learning from verifiable rewards, that rollout receives the same score as nonsense: zero. The model may have climbed nine floors and tripped on the final step; the reward system marks it as indistinguishable from someone who never entered the building.

This is the problem behind SCOPE, proposed in Recycling Failures: Salvaging Exploration in RLVR via Fine-Grained Off-Policy Guidance.1 The paper’s central point is simple but useful: failed reasoning trajectories are not always bad data. Some are near-misses. If the model-generated prefix is correct, throwing away the whole trajectory is wasteful. If a verifier can identify where the first error begins, a stronger model can repair only the broken suffix. The original model keeps its own valid reasoning context; the teacher supplies correction only where the student has actually gone off the rails.

That is the dividend in the title. Not failure as a motivational poster. Failure as partially depreciated training inventory.

Sparse rewards waste the most interesting failures

Reinforcement Learning from Verifiable Rewards, or RLVR, is attractive because it avoids expensive human preference labels when tasks have checkable answers. Mathematical reasoning is the obvious playground: the final answer can be verified, so a rollout can receive a binary reward. Correct answer: reward. Wrong answer: no reward. Clean. Scalable. Brutal.

The brutality matters. A binary final reward cannot tell whether a wrong answer came from a completely confused solution or from a correct multi-step derivation with one late mistake. Both receive zero. That creates a credit assignment problem: the model is not told which reasoning steps were useful, which were harmful, and which should be preserved.

The common instinct is to add more feedback. Process Reward Models, or PRMs, score intermediate reasoning steps. So why not plug those step scores directly into RLVR as dense rewards?

The paper tests that obvious idea, and it does not work. On the Qwen2.5-Math-7B backbone, standard on-policy RL reaches 39.2% average in-distribution accuracy across the paper’s math benchmarks. Adding PRM rewards naively lowers this to 37.7%. In other words, “more signal” is not automatically better signal. A verifier score is not a training objective by divine right. This is where many neat engineering ideas go to become ablation tables.

SCOPE’s move is more specific. It does not ask the PRM to become the reward function. It asks the PRM to perform diagnosis.

The distinction is important:

Reader instinct SCOPE’s correction Why it matters
Failed rollouts are bad samples. Some failed rollouts contain valid prefixes. The training system can recover useful reasoning instead of discarding it.
PRM scores should become dense rewards. PRM scores should locate the first likely error. Direct reward shaping can misalign optimization; localization is a narrower job.
A stronger model should replace the whole answer. A stronger model should repair only the suffix after the student’s verified prefix. The resulting trajectory remains partly aligned with the student policy distribution.
More teacher data means better training. Teacher data is useful only when inserted at the right boundary. Off-policy guidance can help or distort, depending on where it enters.

The mechanism-first reading is therefore the right one. The paper is not merely claiming “our method scores higher.” It is arguing that the unit of reuse in reasoning RL should be the verified prefix, not the entire rollout.

SCOPE turns a failed rollout into a mixed training object

SCOPE has four moving parts.

First, the policy model samples multiple rollouts for a problem, as in GRPO-style RLVR. Each rollout receives a terminal verifiable reward. Correct rollouts are already useful. The interesting candidates are failed rollouts.

Second, the PRM evaluates the reasoning steps inside those failed rollouts. The paper segments solutions into newline-delimited steps and uses Qwen2.5-Math-PRM-7B to assign step-level correctness probabilities. SCOPE identifies the last step before the PRM confidence drops below its validity threshold. That gives a boundary: before this point, the student appears to be reasoning correctly; after this point, the solution is suspect.

Third, SCOPE does not repair every failed rollout. It uses a distribution-aware selection strategy. The selected trajectory should be a near-miss, but not an outlier. The method balances how much progress the rollout made with how representative its length is inside the rollout batch. This matters because very long, strange trajectories can look attractive if they contain many correct-looking steps, while still being unstable or expensive to repair. SCOPE prefers a failed sample that is both useful and reasonably normal. Apparently, even failure needs a dress code.

Fourth, a stronger refiner model generates only the continuation after the verified prefix. In the experiments, the refiner is DeepSeek-R1. The prompt gives the original problem, the verified-correct prefix, and the ground-truth final answer. The refiner is instructed not to repeat or alter the prefix, but to produce a correct suffix ending with the exact boxed answer.

The final training object is hybrid:

student-generated verified prefix + teacher-generated corrected suffix

That hybrid nature is the whole point. The prefix is on-policy: it came from the student model’s current distribution. The suffix is off-policy: it came from a stronger teacher. SCOPE’s objective treats these parts differently. The on-policy prefix uses a clipped RL-style objective. The off-policy suffix uses a weighted likelihood objective, encouraging the student to imitate the correction without pretending that the teacher-generated tokens are fully on-policy samples.

This is less glamorous than “the model learns from mistakes.” It is also more precise. SCOPE is not learning from arbitrary mistakes. It is learning from failures whose correct prefix can be localized and whose suffix can be repaired under a verifiable answer constraint.

The main result is modest in size but meaningful in direction

The headline experiment uses Qwen2.5-Math-7B as the backbone. Training data comes from 8,523 MATH Level 3–5 examples. The evaluation covers in-distribution math benchmarks, including AIME24, AIME25, AMC, MATH-500, Minerva, and Olympiad, plus out-of-distribution reasoning benchmarks ARC-c, GPQA-Diamond, and MMLU-Pro.

SCOPE reaches 46.6% average in-distribution accuracy and 53.4% average out-of-distribution accuracy. The strongest competing in-distribution baseline in the table is ReLIFT at 44.8%, so the average gain is +1.8 percentage points. For OOD performance, SCOPE improves over ReLIFT’s 51.5% and LUFFY’s 50.2%.

The magnitude should be read carefully. This is not a tenfold leap. It is a method-level gain in a crowded post-training setting, where baselines already include on-policy RL, supervised fine-tuning variants, and off-policy guided methods. The more interesting evidence is not only that SCOPE wins the table, but where the comparison hurts the alternatives.

Method on Qwen2.5-Math-7B In-distribution average OOD average Interpretation
Qwen-Instruct 37.6 43.0 Instruction tuning is already strong, but limited.
On-policy RL 39.2 42.3 RL helps ID performance but does not automatically improve OOD generalization.
SFT+RL 42.0 42.1 Adding supervised data before RL is not enough here.
LUFFY 43.4 50.2 Off-policy guidance helps, especially OOD.
ReLIFT 44.8 51.5 Strongest competing ID baseline in the table.
SCOPE 46.6 53.4 Best average performance, with mechanism-specific ablation support.

The comparison suggests that the value is not merely “use a teacher” or “add process information.” SCOPE’s advantage comes from preserving the student’s own correct reasoning prefix while using the teacher only where the student first fails. That is the paper’s central operational idea.

The ablations are the real argument

The paper’s ablation study is more revealing than the leaderboard table. It compares four variants:

Variant Average in-distribution accuracy Likely purpose of test What it supports What it does not prove
On-policy RL 39.2 Baseline Sparse RLVR leaves recoverable signal unused. It does not isolate which part of SCOPE helps.
RL with PRM reward 37.7 Ablation of naive dense reward use Direct PRM reward integration can degrade performance. It does not mean PRMs are useless.
Replace entire rollout 43.4 Ablation of whole-trajectory off-policy replacement Teacher guidance helps, but full replacement is weaker. It does not prove all replacement methods fail universally.
Qwen2.5-32B-Instruct as refiner 44.6 Robustness to weaker refiner quality Step-wise repair can still work with a weaker teacher. It does not remove dependence on refiner quality.
SCOPE 46.6 Full method Localized suffix repair plus prefix preservation performs best. It remains tested mainly in math-style verifiable reasoning.

Two lessons stand out.

First, PRM-as-reward is not the same as PRM-as-diagnostician. The former asks the PRM to reshape the optimization landscape. The latter asks it to find the likely boundary between valid reasoning and failure. SCOPE benefits from the narrower role.

Second, whole-trajectory replacement is a blunter instrument. It can improve over on-policy RL, but it replaces the student’s own reasoning distribution with a teacher trajectory. SCOPE keeps the student prefix and repairs only the suffix. That reduces distribution shift and makes the training signal less alien to the policy being updated.

This is the article’s callback: the dividend comes not from failure itself, but from knowing which part of failure still belongs on the balance sheet.

The diversity evidence matters because exploration is the claimed mechanism

The paper does not only report accuracy. It also argues that SCOPE preserves exploration. That claim needs evidence because off-policy guidance can easily become a polite name for mode collapse: the teacher supplies “good” answers, the student imitates a narrower style, and diversity quietly dies in the corner.

The authors test diversity using AIME-style samples. In the appendix, compared with GRPO, SCOPE improves distinct-1 from 0.11 to 0.14 and distinct-4 from 0.52 to 0.62. The aggregate diversity score increases from 0.34 to 0.39, while pass@1 rises from 16.67 to 26.67 and pass@10 rises from 53.33 to 60.00.

That combination is important. Higher diversity alone is not necessarily useful; a model can be diverse by being creatively wrong. Here, diversity improves alongside exact-answer quality. The paper’s interpretation is that SCOPE expands the set of viable reasoning paths rather than merely generating stylistic variation.

The training dynamics are consistent with that story:

Evidence Likely purpose Interpretation
Average keep ratio rises during training Mechanism diagnostic The student gradually produces longer verified prefixes, so less of the trajectory needs correction.
Reward curves exceed GRPO Optimization evidence Recycled near-miss trajectories provide stronger usable signal.
Policy entropy remains relatively high Exploration diagnostic The model does not collapse immediately into a narrow solution pattern.
Validation accuracy curves stay above GRPO Robustness during training Benefits are not confined to a final checkpoint accident.
Response length stays longer than GRPO Behavioral diagnostic The model maintains multi-step reasoning rather than shrinking into short, risk-averse outputs.
Near-miss@k among zero-reward samples declines Failure-composition diagnostic Fewer remaining failures are almost-correct-but-wasted trajectories.

These tests are not all equally strong. The benchmark table is main evidence. The ablation table is causal support for design choices. The diversity and training curves are mechanism diagnostics. The near-miss analysis is a useful within-failure diagnostic, not a separate theorem of intelligence. The appendix tests strengthen the explanation; they do not magically extend the method to every domain with a scoreboard.

This distinction matters because AI papers often contain enough figures to make every result look like a main result. Here, the better reading is: the accuracy table says SCOPE works in the tested setting; the ablations say why the design choices matter; the dynamics explain why the method plausibly sustains exploration.

Cross-model results suggest stabilization, not universal magic

The paper also tests SCOPE beyond Qwen2.5-Math-7B.

On Qwen2.5-1.5B, the instruct model averages 17.7% across the in-distribution math benchmarks. Standard on-policy RL falls to 12.3%, which is not the sort of “RL improves reasoning” story people enjoy putting in keynote slides. SCOPE reaches 21.5%, outperforming both the instruct model and the on-policy RL version.

On Llama3.1-8B, the base model averages 3.7%, while on-policy RL averages 3.5%. SCOPE reaches 10.5%. The absolute number is still low, but the relative improvement is meaningful because standard RL barely helps. In this setting, SCOPE behaves less like an accuracy booster and more like a stabilizer: it recovers a usable learning signal where binary reward RL struggles.

That is a more sober and more useful conclusion. SCOPE does not turn every backbone into a math champion. It appears to make RLVR less wasteful and less brittle when near-miss reasoning exists and can be identified.

The business value is failure accounting, not cheaper training by itself

For a business audience, the tempting takeaway is “SCOPE makes model training more efficient.” That is partly true, but too vague. The sharper lesson is that enterprises should stop treating failed reasoning traces as a single undifferentiated waste bucket.

In many operational AI systems, failure is already logged: incorrect SQL generation, code that fails tests, workflow plans rejected by validators, document extraction with wrong totals, compliance checks with invalid conclusions, financial analysis where the final figure does not reconcile. The usual pipeline records the failure and moves on. Sometimes it keeps the whole trace as a negative example. Sometimes it retries. Sometimes it adds another prompt bandage, because apparently the world has not suffered enough from prompt bandages.

SCOPE points to a better pattern for verifiable domains:

failed output
→ step-level diagnosis
→ preserve valid prefix
→ repair first invalid segment
→ train or improve future behavior using the mixed trace

The business relevance is strongest when four conditions hold:

Condition Example business setting Why SCOPE-like logic fits
The final answer is verifiable Unit tests, reconciliation checks, rule-based workflow validation The system can distinguish success from failure without subjective review.
Intermediate reasoning is structured Code blocks, SQL clauses, calculation steps, workflow stages A verifier can localize where the process first breaks.
Partial correctness is common Long-form analysis, multi-step planning, data transformation Failed outputs contain reusable work, not just noise.
A stronger repair source exists Senior model, tool-based solver, domain validator, human correction The suffix can be corrected without rewriting everything.

This does not mean a company should copy SCOPE literally tomorrow. The paper’s setup uses math benchmarks, a PRM specialized for math reasoning, DeepSeek-R1 as refiner, ground-truth final answers, and substantial training infrastructure. The experiments run with GRPO training on models such as Qwen2.5-Math-7B, Qwen2.5-1.5B, and Llama3.1-8B, using a single node with 8 NVIDIA A100 GPUs. This is not a spreadsheet macro.

But the design pattern is portable: do not merely score the final answer; diagnose the first recoverable failure boundary. In business terms, that is the difference between counting defects and learning from process traces.

Where the method does not automatically transfer

SCOPE’s strongest evidence sits in math-style verifiable reasoning. That matters.

Mathematics gives the method several conveniences: final answers are checkable, reasoning steps often have explicit boundaries, PRMs can be trained or reused for step-level verification, and a refiner can be constrained to produce a suffix ending in a known answer. In messy business tasks, those conveniences weaken.

A legal memo, market analysis, or customer-support escalation may not have a single ground-truth answer. A workflow plan may have multiple acceptable paths. A financial model may be “wrong” because of an assumption, not because a specific reasoning step is invalid. In these cases, a SCOPE-like system would need validators that can distinguish acceptable alternatives, not just exact-match correctness.

There is also a dependence chain:

  1. The PRM must localize the first error reliably.
  2. The step segmentation must be meaningful.
  3. The refiner must produce a correct suffix without rewriting the valid prefix.
  4. The training objective must avoid treating off-policy teacher tokens as if they came from the student.
  5. The domain must contain enough near-miss failures to make recycling worthwhile.

If any link is weak, the dividend shrinks. A bad verifier can preserve the wrong prefix. A poor refiner can insert polished nonsense. A vague task can make “first error” impossible to define. The paper’s ablation against naive PRM rewards is a useful warning here: adding more evaluators to a training loop does not guarantee better learning. It may simply add a more sophisticated way to optimize the wrong thing.

What Cognaptus infers for AI operations

The direct result of the paper is about RLVR for reasoning models. The business inference is broader but bounded: AI operations should treat failures as structured assets when the domain supports verification.

A practical enterprise version might not start with full RL training. It could begin with logging and diagnosis:

Operational layer SCOPE-inspired practice Immediate business use
Evaluation Store failed traces with intermediate steps, not only final labels. Identify recurring failure boundaries.
Debugging Use validators to mark the first invalid step. Separate prompt issues from reasoning-process issues.
Data creation Preserve correct prefixes and repair only invalid suffixes. Build higher-quality fine-tuning or review datasets.
Model improvement Train on mixed traces only when validation is reliable. Reduce wasted post-training data.
Governance Track near-miss failures separately from total failures. Understand whether the system is close to usable or fundamentally confused.

The near-miss metric is especially useful. A system with many near-misses may need repair and refinement. A system with mostly far-miss failures may need better retrieval, tools, domain knowledge, or a different model. Treating both as “wrong answer rate” hides the operational diagnosis.

This is where SCOPE’s paper is more useful than its benchmark headline. The benchmark says the method works in a controlled setting. The mechanism says how to think about AI training waste: not all failed outputs are equal, and the boundary between valid and invalid reasoning can be more valuable than the final score.

Conclusion: the useful part of failure is the part before it failed

SCOPE is a paper about RLVR, PRMs, and off-policy guidance. More importantly, it is a paper about granularity.

Outcome rewards are coarse. Whole-trajectory replacement is coarse. Naive dense PRM rewards are deceptively coarse because they turn diagnosis into optimization without respecting structure. SCOPE’s advantage comes from operating at the step boundary: preserve the student’s valid prefix, repair the first broken suffix, and train with an objective that recognizes the mixed origin of the resulting trajectory.

The reported gains are not absurdly large, which is a point in the paper’s favor. The evidence is strongest when read as a coherent mechanism: main benchmark improvements, ablations that punish the obvious shortcuts, diversity diagnostics that support the exploration claim, and cross-model tests suggesting stabilization beyond one backbone.

For businesses, the lesson is not “use SCOPE” in the narrow academic sense. The lesson is to stop treating failure as a scalar. In verifiable AI workflows, a failed trace may contain a correct plan, a correct calculation prefix, a valid code scaffold, or a usable chain of reasoning. The expensive part is knowing where it broke.

Once you know that, failure is no longer just a cost center. Occasionally, it pays dividends.

Cognaptus: Automate the Present, Incubate the Future.


  1. Yanwei Ren, Haotian Zhang, Likang Xiao, Xikai Zhang, Jiaxing Huang, Jiayan Qiu, Baosheng Yu, Quan Chen, and Liu Liu, “Recycling Failures: Salvaging Exploration in RLVR via Fine-Grained Off-Policy Guidance,” arXiv:2602.24110v1, 27 February 2026. ↩︎