VLA-ATTC: Adaptive Test-Time Compute for VLA Models with Relative Action Critic Model

arXiv cs.RO / 5/5/2026

📰 NewsDeveloper Stack & InfrastructureModels & Research

Key Points

  • The paper proposes VLA-ATTC, a framework that adds adaptive test-time compute to vision-language-action (VLA) models to enable more deliberative decisions when needed.
  • It uses an uncertainty-based “cognitive clutch” to switch from fast reflexive execution to a test-time compute (TTC) deliberation phase for complex or ambiguous situations.
  • During TTC, a new Relative Action Critic (RAC) model selects the best action among generated candidates using pairwise comparisons, reducing reliance on unstable absolute value estimation.
  • The work also introduces efficient sampling to reduce compute overhead and an automated data pipeline that generates preference pairs without manual annotation.
  • Experiments on the LIBERO-LONG benchmark show VLA-ATTC cuts the failure rate of the state-of-the-art PI0.5 model by more than 50%, and the authors plan to open-source code and weights.

Abstract

Vision-Language-Action (VLA) models have demonstrated remarkable capabilities and generalization in embodied manipulation. However, their decision-making relies on a fast, instinctive process that lacks deliberation. This strategy often leads to suboptimal or catastrophic actions when facing complex or ambiguous scenarios that require greater consideration. In this paper, we introduce \textbf{VLA-ATTC}, a framework that endows VLA models with adaptive test-time compute (TTC). VLA-ATTC employs an uncertainty-based ``cognitive clutch'' to dynamically transition from reflexive execution to a TTC deliberation phase when necessary. During TTC phase, a novel \textbf{Relative Action Critic} (RAC) model identifies the optimal action from generated candidates via pairwise comparisons. This relative mechanism replaces unstable absolute value estimation, significantly simplifying the learning objective. Furthermore, we introduce an efficient sampling strategy to amortize computational costs and an automated data pipeline that curates preference pairs without manual annotation. On the LIBERO-LONG benchmark, VLA-ATTC reduces the failure rate of the SOTA model PI0.5 by over 50\%. We will open-source all the code and weights.