Skip to main content
The cookbook’s primary RL recipe is async_rl_loop. You provide dataset rows and a rollout function; the recipe overlaps rollout production with training submission. When a rollout finishes, the producer immediately tries to refill available capacity—even while forward/backward or optimizer work is running.
async_rl_loop is experimental. Its configuration and rollout protocol may change without backward-compatibility shims. This page describes the current Cookbook and its declared SDK dependencies; pin the Cookbook commit and SDK version for reproducible workloads.
For the shared serverless pool, use the experimental async_rl_loop_serverless adapter. It keeps this recipe’s rollout and scheduling contract but replaces dedicated resource lifecycle and hotloading with session-scoped snapshots. The two paths remain separate until they share one weight-publication contract. See Serverless Training for lifecycle and limits.

Responsibilities

Minimal setup

The DeepMath example expects rows with chat messages and ground_truth answers. Fork its adapter to supply another task and reward. For multi-turn harnesses, tools, sandboxes, and exact token ancestry, read Cookbook: Agentic Reinforcement Learning. Agentic RL changes the rollout adapter, not this async scheduling and training contract.

Rollout contract

The factory receives RolloutSetup once and returns an async function:
The recipe calls rollout_fn completions_per_prompt times for each dataset row. One call represents one trajectory and returns:
  • RolloutRun(segments=[...]) on success. A run contains one or more RolloutSample segments from the same trajectory.
  • None to drop that trajectory draw.
Each segment carries aligned tokens, logprobs, and loss_mask lists plus a scalar reward. Set the mask to 1 only for tokens that should contribute to training. All segments in one run must have the same reward.

Scheduling controls

These fields define the rollout/training pipeline: Admission is row-atomic: the scheduler submits a row only when both the staleness budget and concurrency budget can fit all of its completions. max_concurrency_rollout_sample counts active rollout_fn calls, not the individual inference requests that a multi-turn agent makes. The shared DeploymentSampler owns inference-request concurrency separately. max_head_offpolicy_versions=0 is fully on-policy: every optimizer batch trains groups from its current published policy version. Training submission can still overlap remaining rollouts from the same optimizer batch. The synchronous rl_loop collects the full batch before training it.

Runtime behavior

  1. The recipe syncs initial policy weights to the sampler.
  2. The producer submits complete rows while both admission budgets allow it.
  3. Every completed rollout retries refill. As soon as a complete group is ready, training submission can begin while rollouts continue. Each submission combines all groups currently ready in that batch, with no collection timer.
  4. Requests can remain pending together. One optimizer step follows only after every backward in the batch succeeds.
  5. The recipe waits for evaluation on the current sampler version before replacing that version, hotloads the updated weights, and publishes the next policy version. Publication reopens staleness capacity.
There is one sampler hotload per optimizer batch; async_rl_loop does not expose a weight-sync interval. The final partial optimizer batch is trained rather than discarded. Known transient rollout failures are dropped behind a bounded circuit breaker. Invalid rollout data, unexpected cancellation, and unknown errors remain fatal. A row may still train after recoverable failures when at least min_group_size runs survive.

Loss behavior

The reference loops use the trainer’s built-in clipped GRPO loss against the logprobs captured during rollout, with no reference-model KL penalty. Advantages are normalized within each prompt group. All backward requests accumulate into one optimizer update; gradients are normalized by the batch’s trainable-token count once. SFT, DPO, and ORPO retain controlled dataset batches. Fork the recipe to change the objective, anchor, or correction. See the custom-loss skill.

Evaluation

Pass evaluation_fn(step, rollout_fn) and evaluation_interval=N to main(). Evaluation runs at the initial or resumed step, at each interval, and once at the actual final step without duplicating a periodic evaluation at that step. It uses the same rollout object, sampler, max_completion_tokens, and resolved max_seq_len as training, but it does not enter training groups or mutate the optimizer. Evaluation is fail-open. It can overlap the next batch’s rollout and trainer work, but it must finish before that sampler version is replaced, so a slow evaluation can delay weight publication.

Interruptions and cleanup

The dedicated sync and async recipes and the serverless async adapter handle SIGINT and SIGTERM throughout setup, training, final saves, and cleanup. The first signal stops new work, waits for native calls already in progress, and unwinds cleanup according to the recipe’s resource settings. Rollout cleanup runs before sampler and service closure. A second signal exits immediately and may leave remote resources running. The recipes restore the caller’s signal handlers when they return. Interrupting a run does not guarantee a new final checkpoint. Set a positive dcp_save_interval to preserve resumable state during training; see Checkpointing.

Detailed reference

Keep implementation and tuning detail out of the recipe page:
  • Async RL skill reference — admission math, metrics, tuning, failure policy, and resume semantics
  • Agentic RL skill reference — multi-turn token ancestry, session/cache architectures, mismatch policies, and trace failures
  • Custom RL loss reference — fork the recipe deliberately when you need a trainer built-in or another research objective
  • Checkpointing — resumable checkpoints and final model promotion
  • Weight sync — how updated policy weights reach the sampler
  • rl_loop — simpler synchronous GRPO when rollout/training overlap is unnecessary

IGPO (Information Gain Policy Optimization)

IGPO prepares turn-level advantages through rl_loop.main(..., prepare_batch_fn=igpo.prepare_batch(gamma=...)). Answer scoring runs across the complete batch while advantage normalization remains group-local. Start with the multi-hop QA example.