Demo2Reward
From Demonstrations to Rewards: Test-Time Prompt Optimization for VLM Reward Models
Abstract

Reinforcement learning relies on accurate reward functions, which are often hand-crafted or even unavailable in real-world applications, such as robotics. Recent work has explored the zero-shot reasoning capabilities of pre-trained Vision-Language Models (VLMs) as reward models. However, without careful prompt engineering, these approaches tend to produce suboptimal rewards, where false positive predictions can severely degrade downstream policy learning. In robotics, limited datasets comprising expert demonstrations are often collected to bootstrap policy learning. This scenario provides an opportunity to optimize a reward model prior to policy training. We propose Demo2Reward, a test-time adaptation technique to optimize the language instruction of a reward model based on a few demonstrations (3–10 trajectories) to reduce false positives while preserving true positives. Crucially, this requires no additional model training or computation resources during policy learning. We show that Demo2Reward consistently outperforms existing zero- and few-shot VLM reward models across a range of simulated robotic tasks and policy backbones. Finally, we demonstrate that Demo2Reward effectively transfers to a real-world robotic learning scenario, enabling policy learning without manually engineering a reward function.

Overview
How Demo2Reward Works
Demo2Reward overview
Before policy training, Demo2Reward optimizes a language instruction to improve a VLM's success predictions on a small set of demonstrations. During policy learning, the VLM then generates rewards from video observations and the optimized instruction.
Demo2Reward performs 10 independent optimization runs over a small set of demonstrations. A VLM refines the instruction used at inference time to reduce false positives while preserving true positives.
At run-time, the VLM is prompted with the optimized instruction to provide rewards. No additional training or fine-tuning is needed.
Reward Modelling
False Positive Rewards

A key failure mode of VLM reward models is false positive predictions: hallucinated rewards that falsely signal success. Such spurious rewards invite reward hacking: once a policy collects a false positive, it has no incentive to keep going and actually complete the task. Demo2Reward optimizes the prompt for a VLM success detector (VLM-SD), used as a zero-shot reward model in sparse-reward RL. During optimization, it primarily aims to suppress false positive predictions while granting a small bonus for every true positive it manages to preserve.

Default instructions

Optimized instructions

Reward Models

The resulting reward models are more cautious: they no longer overestimate the underlying binary rewards, predicting success only once the task is genuinely solved.

Drag the slider to scrub through the rollout
RL Results
Better Rewards, Better Policies

Improved reward functions translate directly into better policy performance. We verify this across simulation suites (Robomimic, MetaWorld) and a real robot, and across policy-learning backbones (IBRL, RLPD): training on Demo2Reward rewards consistently yields stronger policies than the baseline reward models.

Across all tasks and policy backbones (IBRL, RLPD) we considered, Demo2Reward consistently improves policy learning compared to zero-shot VLM success detection (VLM-SD), bringing performance closer to that of ground-truth rewards.
When used for RL, policies (IBRL) trained with Demo2Reward outperform those trained with other VLM-based reward models, whether zero-shot or demonstration-based.
We show that Demo2Reward scales to a real-world setup, enabling RL on a real robot without manually designing a reward function.
BibTeX
Reference
@article{gumbsch2026demo2reward,
      title={From Demonstrations to Rewards: Test-Time Prompt Optimization for VLM Reward Models},
      author={Gumbsch, Christian and Barcellona, Leonardo and Sch{\"u}nemann, Lennard and Karageorgis, Platon and Zadaianchuk, Andrii and Wang, Zehao and Zakharov, Sergey and Despinoy, Fabien and Aljundi, Rahaf and Gavves, Efstratios},
      journal={arXiv preprint arXiv:2606.00083},
      year={2026},
}