arXiv AI

RACE: Calibrated Cumulative Scoring for Rollout-Free Robot Policy Checkpoint Selection

The paper introduces RACE, a rollout‑free metric for selecting robot policy checkpoints that uses held‑out successful trajectories to calibrate action deviations against state‑conditional thresholds. By aggregating these calibrated scores with a running product, RACE reduces the influence of later reference predictions when early deviations occur, and averages the cumulative scores over time and across trajectories to produce a checkpoint score. Experiments in simulation and on real robots show that RACE outperforms baseline methods and its rankings correlate with deployment success across various policy backbones and tasks.

arXiv Machine Learning
Oct 15

Efficient Test-Time Adaptation For Robot Policies

arXiv:2610.20318v1 Announce Type: cross Abstract: Reinforcement-learning policies for robot locomotion can fail at deployment when operating conditions shift (e.g., rough or slippery terrain, payload...

By Motasem Alfarra, Pietro Mazzaglia, Markus Peschl, Daniel Dijkman, Christos Louizos
Hugging Face Trending Papers
Aug 19

SCAPE: Scenario-Conditioned Simulation-Augmented Policy Evaluation

SCAPE is a scenario‑conditioned simulation‑augmented policy evaluation framework that predicts real‑world policy performance for specific scenarios using limited paired simulation‑and‑real samples and extensive simulation rollouts. It corrects sim‑to‑real bias in simulation labels before training the prediction model and calibrates prediction uncertainty via conformal prediction. Experiments on autonomous driving and quadruped velocity tracking show SCAPE reduces scenario‑level prediction error, improves testing sample efficiency, narrows calibrated prediction intervals, and generalizes better to out‑of‑distribution scenarios, enabling fine‑grained deployment strategies.

arXiv Machine Learning
Aug 19

Prism-GRPO: Faster VLA Policy Optimization via Splitting Same-outcome Groups

Prism‑GRPO enhances the GRPO reinforcement‑learning algorithm for vision‑language‑action policies by adding a weighted trajectory‑level execution‑quality score to binary success rewards. This approach splits groups with identical outcomes into a quality spectrum, preserving training signal while ensuring successes always outrank failures. Experiments on four RoboTwin tasks show Prism‑GRPO achieves higher success and quality at matched rollout budgets, reaching target success rates with up to 56% fewer rollouts and mitigating reward‑hacking behaviors that transfer to real‑robot deployment.

By Zeyun Deng, Yuzhe Lu, Yawei Wang, Linbo Liu, Qing Ping, Han Ding, Guande Wu, Panpan Xu, Jun Huan
arXiv AI
Oct 28

Rollback: Experience Backtracking in World Models for Policy Improvement

The paper introduces Rollback, a method that uses action‑conditioned world models to backtrack to critical decision points, branch into alternative actions, and compare outcomes to attribute success to individual decisions. By turning world models into counterfactual engines, Rollback provides fine‑grained, action‑level supervision without a separate value model and integrates distributed world‑model search with asynchronous real‑robot execution. Experiments on block extraction, ball tossing, and tabletop curling show that Rollback improves success rates by over 10% compared to the strongest baseline and surpasses human performance on two tasks within eight hours of training.

By Jiayi Luo, Yang Zhang, Liliang Chen, Nan Wang, Chen Gao, Boxiang Qiu, Zhuoxuan Li, Baorui Peng, Chuankang Li, Yuxiang Yan, Si Liu, Qingyun Sun, Shuicheng Yan, Maoqing Yao, Jianxin Li, Guanghui Ren
arXiv Machine Learning
Oct 16

Policy-Aligned Predictive Verification for Adaptive VLA Action-Chunk Execution

The paper introduces a policy‑aligned predictive verifier (PAV) that evaluates candidate action prefixes from vision‑language‑action (VLA) policies to determine how far to execute before re‑planning. PAV predicts the consequences of prefixes and checks their compatibility with successful task completion, using trajectory‑level survival supervision and a localization prior to learn local judgments. Experiments on LIBERO, RoboTwin 2.0, and real‑world manipulation demonstrate that PAV improves the trade‑off between success rate and query cost compared to existing adaptive methods.

By Minkyu Kim, Junhoo Lee, Seungyeon Kim, Suhyun Jeon, Baekseung Kim, Donghoon Han, Nojun Kwak
arXiv AI
Oct 28

Learning Quality-Controllable Robot Policies with Iterative Hindsight Relabeling

The paper introduces Quality-Controllable Policy (QCP), a robot policy that allows real‑time adjustment of quality attributes such as speed and smoothness during task execution. QCP employs an iterative hindsight relabeling loop, where online rollouts are collected under target quality labels, successful trajectories are added to the dataset, and trajectories are relabeled based on measured quality before fine‑tuning the policy. Experiments on Robomimic, RoboEval, and real‑world manipulation tasks show that QCP improves both task execution quality and success rates, enabling higher throughput in conveyor operations and better stability when carrying fragile objects.

By Sinjae Kang, Dong Kyu Shin, Jaehong Kim, Kamin Lee, Hyoeun Kim, Kaixin Wang, Li Zhao, Seonghyeon Ye, Kimin Lee
arXiv Machine Learning
Oct 9

Reliability-Aware Future Conditioning for Temporally Robust Robot Manipulation

The paper introduces Reliability‑Aware Future Conditioning (RAFC), a method that dynamically estimates how much to trust a generated future video clip and selects the most appropriate temporal hypothesis for robot manipulation tasks. By treating temporal misalignment as a control problem rather than a generation problem, RAFC improves success rates on the CALVIN benchmark and a Franka robot under various timing mismatches, outperforming static and uniform‑averaging baselines. The approach builds on Future‑Experience Conditioning (FEC) and learns solely from task reward without explicit alignment supervision.

By Mohammad Khoshnazar, Mohammad Dehghani Tezerjani, Zhiyuan Gao, Deyuan Qu, Max Gandyra, Yanxiang Zhan, Mehreen Naeem, Andrew Melnik, Jeroen Schafer, Qing Yang, Michael Beetz