SITCOM: Scaling Inference-Time COMpute for VLAs

Fuente: arXiv
Salvato in:
Dettagli Bibliografici
Autori principali: Saxena, Ayudh, Shah, Harsh, Routray, Sandeep, Shah, Rishi Rajesh, Pahwa, Esha
Natura: Preprint
Pubblicazione: 2025
Soggetti:
Accesso online:
Tags: Aggiungi Tag
Nessun Tag, puoi essere il primo ad aggiungerne!!
_version_ 1866911192120819712
author Saxena, Ayudh
Shah, Harsh
Routray, Sandeep
Shah, Rishi Rajesh
Pahwa, Esha
author_facet Saxena, Ayudh
Shah, Harsh
Routray, Sandeep
Shah, Rishi Rajesh
Pahwa, Esha
contents Learning robust robotic control policies remains a major challenge due to the high cost of collecting labeled data, limited generalization to unseen environments, and difficulties in planning over long horizons. While Vision-Language-Action (VLA) models offer a promising solution by grounding natural language instructions into single-step control commands, they often lack mechanisms for lookahead and struggle with compounding errors in dynamic tasks. In this project, we introduce Scaling Inference-Time COMpute for VLAs (SITCOM), a framework that augments any pretrained VLA with model-based rollouts and reward-based trajectory selection, inspired by Model Predictive Control algorithm. SITCOM leverages a learned dynamics model to simulate multi-step action rollouts to select the best candidate plan for real-world execution, transforming one-shot VLAs into robust long-horizon planners. We develop an efficient transformer-based dynamics model trained on large-scale BridgeV2 data and fine-tuned on SIMPLER environments to bridge the Real2Sim gap, and score candidate rollouts using rewards from simulator. Through comprehensive evaluation across multiple tasks and settings in the SIMPLER environment, we demonstrate that SITCOM when combined with a good reward function can significantly improve task completion rate from 48% to 72% using trained dynamics model.
format Preprint
id arxiv_https___arxiv_org_abs_2510_04041
institution arXiv
publishDate 2025
record_format arxiv
spellingShingle SITCOM: Scaling Inference-Time COMpute for VLAs
Saxena, Ayudh
Shah, Harsh
Routray, Sandeep
Shah, Rishi Rajesh
Pahwa, Esha
Robotics
Learning robust robotic control policies remains a major challenge due to the high cost of collecting labeled data, limited generalization to unseen environments, and difficulties in planning over long horizons. While Vision-Language-Action (VLA) models offer a promising solution by grounding natural language instructions into single-step control commands, they often lack mechanisms for lookahead and struggle with compounding errors in dynamic tasks. In this project, we introduce Scaling Inference-Time COMpute for VLAs (SITCOM), a framework that augments any pretrained VLA with model-based rollouts and reward-based trajectory selection, inspired by Model Predictive Control algorithm. SITCOM leverages a learned dynamics model to simulate multi-step action rollouts to select the best candidate plan for real-world execution, transforming one-shot VLAs into robust long-horizon planners. We develop an efficient transformer-based dynamics model trained on large-scale BridgeV2 data and fine-tuned on SIMPLER environments to bridge the Real2Sim gap, and score candidate rollouts using rewards from simulator. Through comprehensive evaluation across multiple tasks and settings in the SIMPLER environment, we demonstrate that SITCOM when combined with a good reward function can significantly improve task completion rate from 48% to 72% using trained dynamics model.
title SITCOM: Scaling Inference-Time COMpute for VLAs
topic Robotics
url https://arxiv.org/abs/2510.04041