AI Engineer · Published 2026-07-31

Reinforcement Learning without Verifiable Rewards — Will Brown, Prime Intellect

Open on YouTube ↗

Summary

Overview

  • Speaker: Will Brown
  • Channel: AI Engineer
  • Main topic: Reinforcement learning on messy, real-world agent tasks without verifiable rewards
  • Purpose: To explain how to extend reinforcement learning to messy real-world tasks where reward signals are unclear, and present methods for manufacturing reward signals and building self-evolving agent systems. Will Brown discusses reinforcement learning (RL) beyond domains with clean verifiable rewards like math and code. He explores scaling RL to messy real-world agent tasks by manufacturing signal through grounding from source material, calibrated judges for open-ended work, and scaling search and test-time compute. He outlines Prime Intellect's stack and vision for continual learning where agents self-improve in production.

Topic Map

Introduction to RL without Verifiable Rewards

  • Explanation: Many real-world tasks lack clean verifiable rewards. Scaling RL requires handling messy environments where the goal or success criteria is not straightforward.
  • Key claims:
    • RL and RLVR have taken off, but often we don't have verifiable rewards.
    • Messy real-world tasks require new techniques beyond simple verification.
  • Examples:
    • Running around writing reports, booking flights, handling refunds.
  • Terminology:
    • RLVR
    • verifiable rewards
    • policy gradient
  • Why it matters: Most valuable real-world agent applications are messy and lack binary ground-truth answers.

The Prime Intellect Stack

  • Explanation: Overview of Prime Intellect's infrastructure spanning compute, training frameworks, environments, and model orchestration.
  • Key claims:
    • Prime Intellect provides tools across the stack from GPU cluster orchestration to the prime-r1 open ML trainer and lab environments.
  • Examples:
    • Tasksets, harnesses, verifiers, hosted training, and evals.
  • Terminology:
    • prime-r1
    • lab
    • GPU cluster orchestration
  • Why it matters: Enables practitioners to act as their own research lab and optimize model weights for custom tasks.

Environments and Verifiable Rewards

  • Explanation: Defining environments as tasks, harnesses, and rewards, and contrasting easy verifiable cases (math, code, tool use) with fuzzy real-world agent tasks.
  • Key claims:
    • Environments and evals are essentially the same objects, useful for SFT, RL, distillation, and prompting.
    • Verifiable rewards work well for math, code test cases, and tool use with database states.
  • Examples:
    • Golden answers in math, test cases in code, check_state(db) for tool use.
  • Terminology:
    • verifiable rewards
    • harness
    • test cases
  • Why it matters: Establishes the baseline of where RL is easiest before tackling non-verifiable settings.

Challenges in Real Agent Tasks and Evals

  • Explanation: Most real tasks are not verifiable: tasks do not scale by hand, open-ended outputs lack clean checks, coverage is unbounded, and models exploit weak verifiers (reward hacking).
  • Key claims:
    • Manual curation of evals does not scale.
    • Real-world tasks have unclear signals.
    • Models exploit loose reward proxies through reward hacking.
  • Examples:
    • 'Is this a good report?', 'Did it book the right flight?'
  • Terminology:
    • reward hacking
    • open-ended outputs
    • unbounded coverage
  • Why it matters: Highlights why naive RL fails in production without robust signal manufacturing.

Continual Learning Goal

  • Explanation: The objective of continual learning where deployed agents in production generate real traces, mine new tasks and worlds, and train via online RL to produce better agents.
  • Key claims:
    • Models should be deployed in realistic messy settings and learn as they go from mistakes.
    • Automated environment design enables self-improvement in production.
  • Examples:
    • Production traces mined into new tasks and worlds for online RL.
  • Terminology:
    • continual learning
    • online RL
    • production traces
  • Why it matters: Shifts model optimization from static offline benchmarks to active self-improving loops.

Manufacturing Signal

  • Explanation: Techniques to manufacture signal when rewards are missing: grounding from source material, judges for open-ended work, and scaling search/test-time compute.
  • Key claims:
    • Grounding leverages source material like docs, code, and production traces to create grounded tasks.
    • Judges use LLMs scoring against references or rubrics for open-ended work.
  • Examples:
    • AB testing with and without source material, multi-judge consensus.
  • Terminology:
    • grounding
    • judges
    • scaling search
    • test-time compute
  • Why it matters: Provides actionable methodologies to bootstrap supervision and rewards from raw data.

Synthetic Tasks and World Simulators

  • Explanation: Building synthetic search tasks, code tasks via backwards reconstruction (holding out tests), and world simulators to enable verifiability in black-box environments.
  • Key claims:
    • Working backwards from solutions (e.g. holding out tests, removing files) creates reachable training tasks.
    • World simulators provide high-fidelity synthetic environments where verifiability is baked in.
  • Examples:
    • Synthetic code tasks by removing files and requiring the agent to reconstruct code to pass tests.
  • Terminology:
    • synthetic tasks
    • world simulators
    • planted gold
    • reverse engineering
  • Why it matters: Allows scaling training data and rewards for web apps and tools without backend control.

Key Points

Most real agent tasks lack clean verifiable rewards

  • Explanation: Real-world agent tasks such as writing reports, handling refunds, or booking flights involve subjective or fuzzy evaluation signals rather than binary correct answers.
  • Evidence: Comparison between math/code verification and open-ended agent tasks like 'is this a good report?'.
  • Practical implication: Standard RL algorithms cannot be directly applied without engineering proxy reward signals.

Grounding in source material bootstraps supervision

  • Explanation: Using existing documentation, code repos, and production traces as source material allows the creation of grounded tasks with known reference solutions.
  • Evidence: Mining production traces of deployed agent interactions to form task distributions.
  • Practical implication: Enables supervised and reinforcement learning signals to be mined automatically from real application usage.

Working backwards creates reachable learning tasks

  • Explanation: Starting from a known solution or completed artifact and removing components (e.g., test cases or files) creates verifiable challenges for agents to solve.
  • Evidence: Synthetic code tasks where agents must reconstruct code to pass held-out tests.
  • Practical implication: Solves the data scarcity problem for complex agent capabilities by synthesizing training tasks from existing codebases.

World simulators bridge the gap for unprogrammable apps

  • Explanation: For web applications or tools lacking full backend control, training synthetic simulators combined with test-time search allows verifiability to be baked in.
  • Evidence: Iterating between a synthetic simulator and real production traces to create high-fidelity environments.
  • Practical implication: Unlocks RL training for complex web and tool-use environments previously resistant to reinforcement learning.

Frameworks, Models & Processes

The Prime Intellect Stack

  • How it works: A layered architecture powering end-to-end agent development from compute orchestration to model deployment.
  • Components:
    • Models (open models tuned to a task)
    • Lab (hosted training, evals, inference)
    • Training (prime-r1 open ML trainer)
    • Compute (GPU cluster orchestration)
  • When to use: When setting up scalable infrastructure for open-source reinforcement learning and agent training.

Signal Manufacturing Framework

  • How it works: Methods to generate reward signals for unverified domains through grounding, judges, and search.
  • Components:
    • Grounding (from source material, docs, traces)
    • Judges (LLMs scoring against rubrics and references)
    • Scaling Search (test-time compute to sharpen tasks and verification)
  • When to use: When applying RL to messy, open-ended real-world tasks without ground-truth reward functions.

General Agent Synthesis Loop

  • How it works: An online loop where a synthesizer designs tasks and verifiers, a solver attempts them with N rollouts, and a gate filters tasks based on target solve-rate to seed harder tiers.
  • Components:
    • Synthesizer (designs task, gold, verifier)
    • Solver (attempts task, N rollouts)
    • Gate (keeps only tasks near target solve-rate)
  • When to use: For self-evolving synthetic environment generation and continual learning in agent training.

Examples & Case Studies

Synthetic code tasks generated from real pull requests.

  • Illustrates: Working backwards from solutions to create training tasks.
  • Lesson: Hold out tests or remove files from real PRs to train models to reconstruct code solutions.

Using production agent traces as raw data.

  • Illustrates: Grounding tasks in real-world agent behavior.
  • Lesson: Production traces from deployed agents act as a natural distribution for mining future training tasks.

Actionable Takeaways

  • Immediate:
    • Recognize that environments and evals share the same underlying structure.
    • Leverage existing documentation, code repos, and production traces for grounding.
  • Strategic:
    • Move toward continual learning loops where deployed agents generate their own training tasks.
    • Invest in synthetic world simulators and calibrated judges to solve the reward verification bottleneck.
  • Questions to investigate:
    • How can we effectively mitigate reward hacking in open-ended LLM judge setups?
    • What is the optimal threshold for task solve-rate gating in automated environment generation?

Claims Worth Verifying

  • Environments and evals are essentially the same objects that can be used across SFT, RL, distillation, and prompting. (conceptual)
  • Working backwards from a completed solution (like holding out tests in PRs) enables scalable synthetic task generation. (methodological)

Notable Quotes

"Many of people may have been learning about RLVR over the past year or so, year and a half, as this stuff has really taken off... but often we don't actually have verifiable rewards." (at 0:29) "The environment is the bottleneck. Good tasks and rewards are the hard part, not the trainer." (at 30:05)

Compressed Summary

  • Reinforcement learning often lacks verifiable rewards in messy real-world tasks.
  • Prime Intellect provides a full stack for open ML training, labs, and GPU orchestration.
  • Signal can be manufactured via grounding, calibrated LLM judges, and test-time compute search.
  • Synthetic task generation works backwards from solutions, such as holding out tests in code repos.
  • Continual learning aims to create self-evolving agent loops running in production.
  • Keywords: reinforcement learning, verifiable rewards, agent tasks, world simulators, continual learning
  • Core insight: Scaling reinforcement learning to messy real-world agent tasks requires manufacturing reward signals through grounding, synthetic world simulators, and automated environment design.

Core insights

6
Architecturemedium noveltymoderate evidence

Environments and evals are the same artifact class, not two systems: a task + harness + reward object can be reused across SFT, RL, distillation, and prompting. This collapses the training/eval boundary into one reusable definition.

Why it matters

Engineering teams typically build separate eval harnesses and separate RL training environments, duplicating task definitions and drifting reward semantics. Treating them as one object means any eval you build is immediately a training environment and vice versa, which changes where effort is spent and how drift is controlled.

Generalization

Any agent-evaluation investment should be structured as a reusable task/harness/reward triple rather than an eval-only artifact, so the same spec feeds training, distillation, and prompt selection.

Environments and evals are essentially the same objects, useful for SFT, RL, distillation, and prompting.
Open source video
Mechanismhigh noveltymoderate evidence

Verifiable tasks can be manufactured by running the solution pipeline backwards: hold out tests, remove files, or strip components from a known-good artifact so the agent must reconstruct it to pass. This converts existing codebases into reachable, verifiable training tasks without new data collection.

Why it matters

It solves the bootstrapping problem for non-verifiable domains using existing artifacts as the source of ground truth, and it bounds task difficulty by construction (the solution is known to exist and to pass).

Generalization

Reverse-construction is a general recipe for synthesizing supervised/RL signal: start from a passing end state, delete a component, and the deletion itself defines the reward.

Working backwards from solutions (e.g. holding out tests, removing files) creates reachable training tasks.
Open source video
Synthetic code tasks by removing files and requiring the agent to reconstruct code to pass tests.
Open source video
Failure Modemedium noveltymoderate evidence

Reward hacking is treated as a structural property of loose reward proxies rather than a tuning bug — models exploit weak verifiers wherever the signal is fuzzy, which is precisely where real agent tasks live.

Why it matters

It means signal quality dominates algorithm choice in non-verifiable RL; a weak judge or proxy will be optimized against, so verifier hardening must be designed in, not patched after training.

Generalization

For any learned reward or LLM judge in a training loop, the exploitable surface is the bottleneck on achievable policy quality.

Models exploit loose reward proxies through reward hacking.
Open source video
Practicemedium noveltymoderate evidence

LLM judges with references or rubrics, and multi-judge consensus, are the proposed substitute for verifiable rewards on open-ended work; grounding tasks in source material (docs, code, production traces) supplies the reference against which judges score.

Why it matters

This defines the concrete operational pattern for extending RL past math/code: pair a judge with a grounding artifact, and reduce judge variance via consensus rather than relying on a single model's judgment.

Generalization

Open-ended supervision pipelines need both a scoring mechanism and an anchoring corpus; ensemble/consensus is the mitigation for scorer noise.

Judges use LLMs scoring against references or rubrics for open-ended work.
Open source video
Grounding leverages source material like docs, code, and production traces to create grounded tasks.
Open source video
AB testing with and without source material, multi-judge consensus.
Open source video
Architecturehigh noveltyweak evidence

World simulators are positioned as the way to obtain verifiability in environments the team does not control — high-fidelity synthetic replicas of web apps and tools that behave like the target system without needing backend access.

Why it matters

It relocates the control point: instead of modifying the real system to expose state for reward computation, you replicate it so verifiability is designed in. This is the difference between being able to train on a third-party tool versus not.

Generalization

When the reward-relevant state of an external system is inaccessible, simulating that system is the boundary change that makes RL tractable.

World simulators provide high-fidelity synthetic environments where verifiability is baked in.
Open source video
Mental Modelhigh noveltymoderate evidence

Continual learning is framed as a production loop rather than an offline benchmark: deployed agents emit traces, those traces are mined into new tasks and simulated worlds, and online RL trains improved agents that redeploy.

Why it matters

It shifts model optimization from a static dataset phase-gate to a live loop where production traffic is a training input, which has direct implications for telemetry capture, task mining infrastructure, and deployment cadence.

Generalization

Systems that log structured interaction traces are also, implicitly, data-acquisition systems for their own successor models.

Production traces mined into new tasks and worlds for online RL.
Open source video
Automated environment design enables self-improvement in production.
Open source video

Deep dives

5

Reward hacking as a structural constraint on non-verifiable RL

Research question

What measurable properties of a learned reward proxy predict reward hacking under policy optimization, and which verifier-hardening interventions — grounding, rubric design, multi-judge consensus — keep the proxy aligned with human judgment per training step?

Why

If signal quality dominates algorithm choice, teams need operational metrics and defenses for judges before scaling RL on open-ended agent tasks; otherwise the policy optimizes the proxy rather than the task.

Models exploit loose reward proxies through reward hacking.
Open source video
Judges use LLMs scoring against references or rubrics for open-ended work.
Open source video
Source video

Reverse-construction as a general task generator

Research question

How do task difficulty and solvability distribute when training tasks are generated by deleting files, stripping components, or holding out tests from a known-good artifact?

Why

It provides a bootstrapping path for verifiable RL signal in code and agent domains without new data collection, and it bounds difficulty by construction.

Working backwards from solutions (e.g. holding out tests, removing files) creates reachable training tasks.
Open source video
Synthetic code tasks by removing files and requiring the agent to reconstruct code to pass tests.
Open source video
Source video

World simulators and sim-to-real transfer for verifiability

Research question

How much fidelity and surface coverage does a world simulator need before a policy trained inside it transfers to the live target system without divergence?

Why

Simulators are the proposed boundary change for training on black-box third-party targets; without transfer measurement, teams risk optimizing a replica whose divergence silently biases the policy.

World simulators provide high-fidelity synthetic environments where verifiability is baked in.
Open source video
Source video

Stability of production-trace-fed continual learning loops

Research question

What filtering or drift-detection mechanisms prevent a continual-learning loop from amplifying its own errors when production traces are mined into new tasks and worlds for online RL?

Why

The deployment-to-training loop is the proposed production mode; without stability guarantees, it can reinforce model-generated artifacts and regress previously passing cases.

Production traces mined into new tasks and worlds for online RL.
Open source video
Automated environment design enables self-improvement in production.
Open source video
Source video

Unifying eval and training environment specifications

Research question

Do teams that use a single task/harness/reward specification for evals and RL see lower reward-semantic drift and engineering overhead than teams maintaining separate artifacts?

Why

It changes the critical dependency for training and evaluation; a shared spec can reduce duplication but makes any change ripple across SFT, RL, distillation, and prompting.

Environments and evals are essentially the same objects, useful for SFT, RL, distillation, and prompting.
Open source video
Source video

Article ideas

4

Your Eval Is Already Your Training Environment

The separation between evaluation suites and RL environments is an organizational artifact, not a technical necessity; teams scaling agentic RL should converge on a single task/harness/reward triple reused across SFT, RL, distillation, and prompting, and treat that shared spec as a critical dependency with explicit drift controls.

Angle

Architecture and org design for agent teams: collapse the eval/training boundary, then manage the shared-spec blast radius.

Source video

Reward Hacking Is a Verifier Design Problem

In non-verifiable RL, signal quality dominates algorithm choice; weak LLM judges and loose proxies will be optimized against, so teams must design verifier hardening — grounding, rubrics, multi-judge consensus, and adversarial proxy audits — before tuning policy optimization.

Angle

Treat the reward proxy as the bottleneck and make verifier robustness a first-class training metric.

Source video

Delete the File, Define the Reward

For code and agent domains, the highest-leverage way to manufacture verifiable RL signal is to work backwards from known-good artifacts — hold out tests, remove files, strip components — because the deletion itself defines a reachable, bounded reward.

Angle

A practical recipe for converting existing repos and artifacts into training tasks without new data collection.

Source video

Simulate the World You Cannot Instrument

When reward-relevant state lives in third-party or black-box systems, building a high-fidelity simulator is the boundary change that makes RL tractable; but simulator divergence is a silent policy bias, so sim-to-real transfer must be measured as a first-class metric, not assumed.

Angle

World simulators as verifiability infrastructure, with explicit fidelity and transfer accounting.

Source video

Project ideas

4

Proxy Divergence Early-Warning Harness

gatehouse

For a fixed RL algorithm on an open-ended agent task, the rate of divergence between an LLM judge score and a held-out grounded/human rubric score predicts reward hacking before task-success metrics saturate.

Proof of concept

Build a small RL loop with an open-ended agent task, a rubric-based LLM judge as reward, and a held-out grounded score computed from source material; log both per training step and inject a known proxy weakness to see if the gap grows first.

Measurement

Lead time in training steps between judge-human score gap expansion and measurable task-quality degradation; correlation between gap slope and hacking rate.

Source video

Reverse-Construction Task Generator

beyond-evals

Tasks generated by deleting files, stripping components, or holding out tests from a passing repository are solvable by construction, and their difficulty can be tuned monotonically by deletion size and coupling.

Proof of concept

CLI that ingests a repo with tests, produces variants by removing files or test cases, runs a baseline agent, and records pass/fail and reconstruction traces.

Measurement

Pass rate and solve-time distribution as a function of deletion size/coupling; fraction of tasks solvable by a frontier policy; spread of task difficulty.

Source video

Sim-to-Real Transfer Meter

new

Policy performance in a synthetic world simulator predicts live target performance only above a measurable surface-coverage threshold; below that threshold, the transfer gap grows with state/action coverage divergence.

Proof of concept

Build or select a simple web app with a companion simulator; train an agent in the simulator at multiple fidelity levels; evaluate each policy on the live app.

Measurement

Transfer gap (sim score minus live score) versus simulated surface coverage; correlation between coverage divergence and performance drop.

Source video

Production Trace Canary for Continual Learning

movement-lab

Continual-learning loops fed by model-generated production traces amplify errors unless mined tasks are filtered by reward-distribution drift and validated on held-out real traffic.

Proof of concept

Simulate the loop: capture traces from a deployed agent, mine tasks, run online RL, redeploy, and compare a no-filter loop against a drift-filtered loop over several iterations.

Measurement

Task-distribution drift, reward-distribution drift, regression rate on previously passing cases, and improvement on held-out real traffic.

Source video

Architectural implications

3

Environments and evals are the same object class usable across SFT, RL, distillation, and prompting.

Before

Separate eval suites and separate RL environment definitions, maintained by different code paths.

After

A single task/harness/reward specification consumed by all training and evaluation pipelines.

Consequence

Reduced duplication and drift, but the spec and harness become a shared critical dependency whose changes ripple into training, distillation, and prompting simultaneously.

Source video

World simulators replace needing backend control of the target tool or web app.

Before

Reward extraction required instrumenting the real system to expose state (check_state(db)).

After

A synthetic replica of the environment hosts the task and computes reward internally.

Consequence

Training becomes possible on black-box third-party targets, at the cost of building and maintaining high-fidelity simulators whose divergence from production silently biases the policy.

Source video

Production traces become the source for mining new tasks and worlds for online RL.

Before

Task datasets curated manually and fixed at release time.

After

Trace capture and automated environment design feed a continuous task-generation pipeline.

Consequence

Logging, trace retention, and environment-generation tooling move from observability concerns to core training infrastructure.

Source video

Tradeoffs and failure modes

3

Verifiable rewards

Benefit

Well-defined and checkable for math, code test cases, and tool use with database state.

Cost or risk

They do not transfer to open-ended agent tasks, and the reward function only covers the narrow slice of work where ground truth is mechanizable.

Verifiable rewards work well for math, code test cases, and tool use with database states.
Open source video
Source video

LLM judges as reward proxies

Benefit

Provide scalable scoring for open-ended outputs that have no binary correct answer.

Cost or risk

Loose proxies are exploited by the policy through reward hacking rather than producing genuinely better behavior.

Models exploit loose reward proxies through reward hacking.
Open source video
Source video

Manual eval curation

Benefit

Produces precise, human-vetted checks for known failure cases.

Cost or risk

Does not scale and cannot cover an unbounded space of real-world task variations.

Manual curation of evals does not scale.
Open source video
Source video

Open questions

4

What concrete mechanisms keep LLM judges and other proxy rewards from being optimized against during RL?

Why unresolved

The summary identifies reward hacking from loose proxies as a problem but only names judges and multi-judge consensus as signal sources, without describing defenses against exploitation.

Research direction

Benchmark judge robustness under adversarial policy optimization and measure how quickly proxy score diverges from human judgment per training step.

Source video

How much fidelity does a world simulator need before a policy trained inside it transfers to the real target system?

Why unresolved

World simulators are presented as high-fidelity and verifiable, but no fidelity threshold, validation procedure, or sim-to-real measurement is given.

Research direction

Hold-out transfer tests: train in the simulator, evaluate on the live target, and quantify the gap as a function of simulated surface coverage.

Source video

What stops a continual-learning loop fed by its own production traces from amplifying its own errors?

Why unresolved

The feedback loop from deployment to mined tasks to online RL is described as the goal, but no stability, drift, or filtering mechanism is mentioned.

Research direction

Track task-distribution and reward-distribution drift across successive online RL iterations sourced from model-generated traces.

Source video

How can coverage be bounded when the space of relevant real-world task variations is unbounded?

Why unresolved

Coverage is described as unbounded and manual curation as non-scaling, but no method for measuring or saturating coverage is offered.

Research direction

Define coverage metrics over mined task distributions and test whether automated environment design closes measured gaps.

Source video

Key claims

7
factualVerification needed

Environments and evals are functionally the same objects and can be reused for SFT, RL, distillation, and prompting.

Evidence

Environments and evals are essentially the same objects, useful for SFT, RL, distillation, and prompting.

Question

Do teams that unify eval and environment specifications see measurable reductions in drift or engineering overhead versus maintaining separate artifacts?

Source video
factualVerification needed

Verifiable rewards are effective for math, code test cases, and tool use with database state.

Evidence

Verifiable rewards work well for math, code test cases, and tool use with database states.

Question

How far does verifier quality degrade when the reward depends on environment state rather than a static golden answer?

Source video
causalVerification needed

Manual curation of evaluations cannot scale to real-world task coverage.

Evidence

Manual curation of evals does not scale.

Question

At what task count or variation rate does manual curation become the binding constraint relative to automated task mining?

Source video
causalVerification needed

Models exploit loose reward proxies through reward hacking.

Evidence

Models exploit loose reward proxies through reward hacking.

Question

What proxy looseness threshold predicts measurable reward hacking in a given RL run?

Source video
causalVerification needed

Removing files or holding out tests from a known-good artifact produces training tasks that are both solvable and verifiable.

Evidence

Working backwards from solutions (e.g. holding out tests, removing files) creates reachable training tasks.

Question

What fraction of reverse-constructed tasks remain solvable by current policies, and how does difficulty distribute?

Source video
opinionVerification needed

World simulators provide high-fidelity synthetic environments in which verifiability is built in.

Evidence

World simulators provide high-fidelity synthetic environments where verifiability is baked in.

Question

Does policy quality trained in a world simulator predict performance on the corresponding live system?

Source video
predictionVerification needed

Production traces can be mined into new tasks and worlds that feed online RL to improve deployed agents.

Evidence

Production traces mined into new tasks and worlds for online RL.

Question

Do agents trained on mined production traces improve on held-out real traffic without degrading on previously passing cases?

Source video

Connections

4