liveBook · Manning

Verifiable reward

A verifiable reward is a reward signal whose correctness can be determined by an objective criterion or procedure.

How 2 Manning books explain it

Reinforcement Learning from Human Feedback

A verifiable reward is a reward signal whose correctness can be checked objectively by a procedure or criterion.

How it is used
Trains reasoning-oriented models on tasks whose completions can receive definitive correctness scores.
How deep it goes
Defines verifier-scored rewards and illustrates extraction plus binary scoring, while deferring detailed optimizer implementation.
Examples
Uses a prime-number summation checked by extracted answer, alongside coding, mathematics, and theorem-proving feedback signals.
What you can do after
Apply it via a verifier that extracts a completion outcome and assigns correctness-based reward.

Read how Reinforcement Learning from Human Feedback explains verifiable reward →

Build a Reasoning Model (From Scratch)

A reward signal that can be automatically checked against a correct answer or objective criterion.

How it is used
Evaluates math answers and supplies deterministic rewards for reinforcement-learning updates.
How deep it goes
Defines binary verification and the training loop, while deferring secure code-execution environments.
Examples
Uses calculator-like math checking, reference answers, binary correctness labels, and required boxed output.
What you can do after
Build a deterministic verifier that converts correct, extractable answers into training rewards.

Read how Build a Reasoning Model (From Scratch) explains verifiable reward →

Related concepts

These guides are generated from the text of Manning books by Manning's knowledge graph and link to the sections they draw on. The full books are available on liveBook and at manning.com.