arXiv AI By Roko Parac, Christos Ziakas, Leo Ardon, Alessandra Russo

RM-VLM: From Natural-Language Task Descriptions to Vision-Grounded Reward Machines

Read the original on arXiv AI →

RM‑VLM introduces a method to generate reward machines (RMs) from natural‑language task descriptions using a large language model, and employs a vision‑language model as the labeling function to ground RM propositions over image observations. This approach eliminates the need for manually engineered labeling functions, enabling RM‑guided policy learning across diverse domains. Experiments on grid‑world navigation, robotic manipulation, and 3D object collection demonstrate that RM‑VLM consistently outperforms existing VLM‑based reward methods in task success rates.

Machine-generated by The Flow from the publisher's headline and feed description — not written or checked by a human. The full article lives at arXiv AI.

arXiv AI
Jun 2

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

arXiv:2606. 00083v1 Announce Type: cross Abstract: Reinforcement learning relies on accurate reward functions, which are often hand-crafted or even unavailable in real-world applications, such as robotics.

By Christian Gumbsch, Leonardo Barcellona, Lennard Sch\"unemann, Platon Karageorgis, Andrii Zadaianchuk, Zehao Wang, Sergey Zakharov, Fabien Despinoy, Rahaf Aljundi, Efstratios Gavves
arXiv AI
Jul 24

TOPReward: Token Probabilities as Hidden Zero-Shot Rewards for Robotics

arXiv:2602. 19313v2 Announce Type: replace-cross Abstract: General-purpose robot learning requires dense, instruction-conditioned feedback that can distinguish meaningful task progress from stalled, failed, or partially completed behavior.

By Shirui Chen, Cole Harrison, Ying-Chun Lee, Angela Jin Yang, Zhongzheng Ren, Lillian J. Ratliff, Jiafei Duan, Dieter Fox, Ranjay Krishna
Hugging Face Trending Papers
4d ago

D&A: Decoupling Description and Assessment Enables VLMs as Zero-Shot Robotic Reward Models

The paper introduces D&A (Describe & Assess), a prompt‑based method that separates vision‑language model progress estimation into a textual description of scene dynamics and a rubric‑based assessment. By requiring the model to explicitly define absolute success before scoring, D&A reduces confirmation bias and provides fine‑grained, partial progress metrics that accurately penalize failures and interpolate successes. The approach generalizes across tasks, embodiments, and benchmarks, matching or surpassing post‑trained reward models while enabling efficient downstream reinforcement learning.

arXiv Computation and Language
2d ago

D&A: Decoupling Description and Assessment Enables VLMs as Zero-Shot Robotic Reward Models

The paper introduces D&A (Describe & Assess), a prompt-based method that separates progress estimation into a textual description of scene dynamics and a subsequent assessment using explicit rubrics. By requiring Vision‑Language Models to generate an explicit definition of absolute success before scoring, D&A anchors evaluations to an external criterion, reducing confirmation bias and providing fine‑grained, partial progress metrics. Empirical results show that D&A matches or surpasses post‑trained reward models across tasks, embodiments, and benchmarks, and its reward estimates support efficient downstream reinforcement learning.

By Marius Memmel, Shawn Yin, Urvi Rutia, Angad Wadhwa, Eldon Li, Gavin Angeloff, Ankit Goyal, Jesse Zhang, Dieter Fox, Fabio Ramos, Anqi Li, Abhishek Gupta
arXiv Machine Learning
Oct 7

Generalizable Dense Reward for Long-Horizon Robotic Tasks

arXiv:2604.00055v2 Announce Type: replace-cross Abstract: Existing robotic foundation policies are trained primarily via large-scale imitation learning. While such models demonstrate strong capabilit...

By Silong Yong, Stephen Sheng, Carl Qi, Xiaojie Wang, Evan Sheehan, Anurag Shivaprasad, Yaqi Xie, Katia Sycara, Yesh Dattatreya
arXiv AI
Sep 28

Stepwise Intrinsic Rewards for Reasoning in Large Language Models

The paper introduces Stepwise Marginal Information Gain (MIG), an intrinsic process reward that evaluates how each reasoning step of a large language model (LLM) or vision-language model (VLM) improves the likelihood of the reference answer. MIG rewards only new likelihood maxima, preventing duplicate credit, and is combined with outcome, format, and self‑distillation objectives to guide training. Experiments on eight benchmarks show that this method outperforms outcome‑only reinforcement learning and improves accuracy by up to 4.8 points over binary‑reward training, including a 12.6‑point gain on MathVerse and a 12.9‑point advantage on vision‑language transfer at 7B parameters.

By Xiangwei Wang, Wei Wang, Ken Chen, Nanduni Nimalsiri, Sachith Seneviratne, Saman Halgamuge