paper-with-me

홈 › Papers

Scaling Verification Can Be More Effective than Scaling Policy Learning for Vision-Language-Action Alignment

2026-02-12 · Jacky Kwok, Xilun Zhang, Mengdi Xu, Yuejiang Liu, Azalia Mirhoseini, Chelsea Finn, Marco Pavone arxiv

The long-standing vision of general-purpose robots hinges on their ability to understand and act upon natural language instructions. Vision-Language-Action (VLA) models have made remarkable progress toward this goal, yet their generated actions can still misalign with the given instructions. In this paper, we investigate test-time verification as a means to shrink the "intention-action gap." We first characterize the test-time scaling laws for embodied instruction following and demonstrate that jointly scaling the number of rephrased instructions and generated actions greatly increases test-time sample diversity, often recovering correct actions more efficiently than scaling each dimension independently. To capitalize on these scaling laws, we present CoVer, a contrastive verifier for vision-language-action alignment, and show that our architecture scales gracefully with additional computational resources and data. We then introduce CoVer-VLA, a hierarchical test-time verification pipeline using the trained verifier. At deployment, our framework precomputes a diverse set of rephrased instructions from a Vision-Language-Model (VLM), repeatedly generates action candidates for each instruction, and then uses the verifier to select the optimal high-level prompt and low-level action chunks. Compared to scaling policy pre-training on the same data, our verification approach yields 22% gains in-distribution and 13% out-of-distribution on the SIMPLER benchmark, with a further 45% improvement in real-world experiments. On the PolaRiS benchmark, CoVer-VLA achieves 14% gains in task progress and 9% in success rate.

📄 PDF Abstract BibTeX arXiv:2602.12281

Code (0)

등록된 구현이 없습니다.

Tasks

Instruction Following

Similar Papers 제목 키워드 기반

Multi-Agent Verification: Scaling Test-Time Compute with Multiple Verifiers

2025-02-27 · Shalev Lifshitz, Sheila A. McIlraith, Yilun Du

By utilizing more computational resources at test-time, large language models (LLMs) can improve without additional training. One common strategy uses verifiers to evaluate candidate outputs. In this work, we propose a n…

Pushing Test-Time Scaling Limits of Deep Search with Asymmetric Verification

2025-10-07 · Weihao Zeng, Keqing He, Chuqiao Kuang, Xiaoguang Li 외 arxiv

Test-time compute can be scaled both sequentially and in parallel. Sequential scaling involves lengthening the generation process, while parallel scaling involves verifying and selecting among multiple candidate outputs.…

Budget-aware Test-time Scaling via Discriminative Verification

2025-10-16 · Kyle Montgomery, Sijun Tan, Yuqi Chen, Siyuan Zhuang 외 arxiv

Test-time scaling is a powerful strategy for boosting the performance of large language models on complex reasoning tasks. While state-of-the-art approaches often employ generative verifiers to select the best solution f…

Variation in Verification: Understanding Verification Dynamics in Large Language Models

2025-09-22 · Yefan Zhou, Austin Xu, Yilun Zhou, Janvijay Singh 외 arxiv

Recent advances have shown that scaling test-time computation enables large language models (LLMs) to solve increasingly complex problems across diverse domains. One effective paradigm for test-time scaling (TTS) involve…

Mathematical Reasoning

Sample, Scrutinize and Scale: Effective Inference-Time Search by Scaling Verification

2025-02-03 · Eric Zhao, Pranjal Awasthi, Sreenivas Gollapudi

Sampling-based search, a simple paradigm for utilizing test-time compute, involves generating multiple candidate responses and selecting the best one -- typically by verifying each response for correctness. In this paper…

Attribute