JA EN
·★ MEMBER·PAPER·9 min read

Paper Walkthrough: Annotations as Rollouts — Dropping the Ground Truth Into the Group as a Ninth Answer

RL post-training for video MLLMs starves because sampled rollouts almost never contain the right answer. OraRL adds the annotation itself to the group as an extra rollout, then repairs the advantage inversion that naive mixing causes.

ModalityimageTaskgeneration

Annotations as Rollouts: Efficient and Scalable Reinforcement Learning for Video MLLMs

Primary source — what this article is built on

undefined2026-08-20undefined2026-08-27same month

Annotations as Rollouts: Efficient and Scalable Reinforcement Learning for Video MLLMsYunheng Li, Guohong Mu, Hao Li et al. · 2026-08-20 · v1arXiv:2608.20492Paper page·PDF
undefined

Multimodal large language models (MLLMs) have become a prevailing paradigm for unified video perception. However, post-training on large multi-task datasets remains challenging, as existing reinforcement learning methods sample on-policy groups with few high-quality rollouts even with costly chain-of-thought (CoT) generation. In this paper, we study the sample efficiency and scalability of RL post-training for video MLLMs and introduce OraRL. We identify an overlooked role for annotations: Beyond scoring rollouts, each can enter its on-policy group as an oracle rollout, a direct positive optimization target. Direct oracle integration, however, is nontrivial: a high-reward oracle raises the group baseline and inverts otherwise positive policy advantages, a failure we term advantage inversion. At the core of OraRL is a decoupled advantage estimator: policy rollouts determine an oracle-free baseline, while the oracle-policy gap modulates both a directional gain and a separate detached oracle advantage. Sign-balanced pruning improves efficiency: by retaining only the oracle and the strongest rollouts of each sign, OraRL requires just 2.2x the step time of SFT, less than half the 4.9x required by GRPO with CoT. OraRL scales with model size and data, surpassing its backbone from 0.8B to 9B and GRPO up to 100k prompts. Without chain-of-thought, Video-ORA-9B decodes in 130 ms instead of 4,780 ms. Compared with the respective prior best models, it raises temporal mIoU from 62.5 to 66.0, tracking AO from 73.0 to 78.2, segmentation from 64.3 to 70.4, and the three-benchmark spatial-intelligence macro average from 51.0 to 56.1; on VSI-Bench, it scores 73.1 against 55.0 for GPT-5 and 55.1 for Gemini-3-Pro.


The grader who never shows the answer key

Picture a grader who hands the same problem to a student (the model) eight times, scores all eight answer sheets, and returns them. The grader is holding the answer key the whole time — and never shows it. The student has to learn from nothing but "which of these eight is least bad."

For a multiple-choice question that still works, because the right answer shows up somewhere in the eight. But when the answer is "12.4 to 18.9 seconds into the video," all eight sheets miss. A batch containing nothing close to the right answer says very little about which direction to improve in.

This paper (arXiv:2608.20492) makes a one-line pivot: take the answer the grader is already holding, and drop it into the batch as a ninth answer sheet. The authors call the principle annotation-as-rollout, and the training recipe built around it OraRL.

GRPO, from the ground up

The reinforcement learning here sits in the PPO lineage covered in instruction tuning and RLHF: GRPO (Group Relative Policy Optimization). Three steps (§3.1).

  1. For one input (video plus instruction), sample nn outputs from the model. Each one is a rollout
  2. Score each rollout against the annotation to get a reward rir_i (say, how much the predicted interval overlaps the annotated one)
  3. Judge each rollout by whether it beat the group average

Step 3 is the trick that lets GRPO skip training a separate value function (critic).

AiGRPO=riμgrpσgrp+ϵ,μgrp=1nj=1nrjA_{i}^{\mathrm{GRPO}}=\frac{r_{i}-\mu_{\mathrm{grp}}}{\sigma_{\mathrm{grp}}+\epsilon},\qquad \mu_{\mathrm{grp}}=\frac{1}{n}\sum_{j=1}^{n}r_{j}
(1)

AiA_i is the advantage: the coefficient deciding whether that rollout gets pushed up or down in probability. μgrp\mu_{\mathrm{grp}} is the mean reward inside the group, σgrp\sigma_{\mathrm{grp}} its spread, and ϵ\epsilon a small constant guarding against division by zero. Written out in words: "solve the same problem eight times, and praise only the answers that beat the average." Positive AiA_i means push up, negative means push down.

FIG 1Every rollout is a roll of the dice on this distribution. The paper samples at temperature 1.0 with top-p 0.85 (Tab. 17). Lower the temperature and the distribution sharpens — the eight rollouts crowd together, the spread of rewards inside the group shrinks, and there is less to learn from comparing them

Video tasks rarely produce a positive anchor

Now the video-specific problem. Unified video perception (see the video understanding landscape) deals in continuous, structured answers: time intervals, boxes, segmentation masks, tracking trajectories. Unlike multiple choice, sampling almost never lands on one exactly.

As the paper puts it, in existing methods the annotation serves only as a scoring reference, so many groups get updated with no reliable positive anchor (§1). Measured: on temporal grounding, sparse rewards leave 17.5% of groups without a single positive rollout (§4.10).

The intuition "just let it reason longer with chain-of-thought" does not survive contact with the numbers. GRPO with CoT averages 58.5 across three temporal-grounding datasets versus 58.7 without it — statistically a wash — while step time climbs from 93.9 s to 135.6 s (+44.4%). Worse, even before RL, adding CoT drops the raw backbone average by 3.9 points (§4.7). Thinking longer does not make you hit a target you were never going to hit.

Making the annotation the ninth rollout

The core of OraRL is almost anticlimactically simple (§3.2). Define a transform TtaskT_{\mathrm{task}} that rewrites the annotation yy into the model's own response format, then append it to the group as an oracle rollout.

ogt=Ttask(y),Oaug=Oop{ogt},Oaug=n+1o_{\mathrm{gt}}=T_{\mathrm{task}}(y),\quad \mathcal{O}_{\mathrm{aug}}=\mathcal{O}_{\mathrm{op}}\cup\{o_{\mathrm{gt}}\},\quad |\mathcal{O}_{\mathrm{aug}}|=n+1

ogto_{\mathrm{gt}} is the ground truth written out as if the model had produced it, Oop\mathcal{O}_{\mathrm{op}} is the model's own nn rollouts, and Oaug\mathcal{O}_{\mathrm{aug}} is the combined set of n+1n+1. Put in words, this is an addition, not a replacement: all eight on-policy rollouts survive, so exploration is untouched and only the positive anchor is added. What goes inside ogto_{\mathrm{gt}} varies by task — an answer choice, a time interval, a box, a box trajectory — but one update rule covers all of them (§3.3). Unlike knowledge distillation, which imitates a teacher model's output, this oracle is the annotation that shipped with the dataset, so no teacher is required (§2).

Normalize all nine together, though, and performance drops below plain GRPO. Under the shared three-task protocol, GRPO's average of 60.3 falls to 55.4 with naive ground-truth injection — tracking alone loses 11.9 points (§4.9). The cause is grade-school arithmetic.

What's behind this

§

Members-only from here

371 walkthroughs, 26 textbook chapters, 48 student units and 6 close readings — all included for $4.99/mo, with three new explainers every day. Cancel any time; access runs to the end of the period.

Already a member? Sign in to keep reading

References

  1. Yunheng Li, Guohong Mu, Hao Li, Shengsheng Qian et al.. (2026-08-20) Annotations as Rollouts: Efficient and Scalable Reinforcement Learning for Video MLLMs. arXiv:2608.20492Paper page·PDF

This article is written from the source paper above. Where they differ, the original is authoritative.

Comments

Sign in to comment