liveBook · Manning

Verifiable task

As explained in Reinforcement Learning from Human Feedback

A verifiable domain is a problem area in which candidate outputs can be objectively checked for correctness.

A verifiable task has an objectively checkable answer or output. Its evaluator can return a definitive score—typically positive reward for correctness and zero otherwise—without judging subjective qualities such as clarity or helpfulness. section 7.1

Verifiable tasks support reasoning-oriented model training by providing:

  • A scoring function that can replace a learned reward model in reinforcement learning from verifiable rewards (RLVR). section 7.1
  • Binary correctness signals suitable for policy-optimization methods such as PPO. section 7.3.1
  • Feedback derived from answer checking, code execution, or theorem-proving verification. section 7.3.1

Checking a mathematics answer

For “What is the sum of all prime numbers less than 20?”, a completion producing 77 receives reward 1 when the extracted answer equals 77; an incorrect answer receives 0. section 7.1

How Reinforcement Learning from Human Feedback covers it

How deep it goes
Defines binary verification and contrasts it with subjective reward evaluation, but does not detail verifier construction.
Examples
Uses prime-sum mathematics, GSM8K and MATH questions, executable code, and theorem-proving verification.
What you can do after
Apply it via RLVR by converting objectively checked completions into training rewards.
How it connects
Connects RLVR with RLHF, reward models, PPO, code execution, and theorem proving.

Related concepts

This explainer was generated by Manning's knowledge graph from the text of Reinforcement Learning from Human Feedback. The section links point to the parts of the book it draws on.