Search arXiv⌕ Search

arXiv · 2610.04933

DiVeR: Decision-Critical Verifier Learning for VLA Test-Time Scaling

Abstract

Scaling robot data and model capacity has improved Vision-Language-Action (VLA) policies, but further progress is constrained by the high cost of robotic data. Verifier-guided test-time scaling offers an efficient alternative by sampling multiple action candidates and selecting the one most likely to lead to task success at inference time. Existing classification-based verifiers learn from trajectory-level outcomes but treat all visited states equally, even though their value for candidate discrimination can vary across a trajectory. At many states, plausible actions are similar and provide limited discrimination signal, while only a sparse set of decision-critical states admits meaningfully different actions that can substantially affect downstream outcomes. To address this, we propose DiVeR, which estimates decision criticality from the dispersion of sampled action representations. DiVeR then uses this signal to reweight verifier learning toward states where action selection is most consequential, without requiring step-level annotations or additional environment interaction. Across LIBERO, RoboCasa, and real-world experiments on a Franka Research 3 robot, DiVeR consistently improves task success through more effective verifier-guided action selection, while adding negligible verifier inference overhead.

Explore related subjects

Keep this discovery

Explore connections, maps & timelines

BibTeXRIS

Seongheon Park, Heecheol Kim, Shulin Tian, Lilika Makabe, Namiko Saito, Katsushi Ikeuchi, Sharon Li, Yasuyuki Matsushita. 2026-10-04. DiVeR: Decision-Critical Verifier Learning for VLA Test-Time Scaling. https://arxiv.org/abs/2610.04933

Cite the original work for its findings. Save a collection to share your selection of sources.

KEEP EXPLORING

Related papers

CARE: Consistent Action-Response Execution for Human-Guided Robot Transport

Human-guided collaborative transport becomes interaction-critical when the operator can continue along a route segment that is not executable by the robot--payload system. In this regime, operator motion is not an exogenous reference: it simultaneously communicates a persistent route tendency and adapts to the robot's realized progress. A common modular formulation predicts one operator future from observation history, scores multiple robot proposals against that shared forecast, and then modifies the selected command for local feasibility. This can compare candidates under responses they would not induce and can condition prediction on an action that is never executed. We formulate local control over executable-action-indexed joint human--robot transitions and instantiate it in Consistent Action--Response Execution (CARE). Each nominal proposal or bounded alternative is first mapped to an executable action; that same action conditions the route-aligned operator-response prediction, the matched robot--operator rollout, and a fixed interaction utility for candidate selection. Bounded reciprocal refinement handles transient route--feasibility mismatch, whereas persistent progress loss replaces the nominal proposal with a progress-oriented recovery proposal while retaining the same downstream executable-action-conditioned evaluation. Across training and held-out maps, CARE preserves near-saturated performance when the indicated route remains locally usable and achieves the highest observed success and service availability when the operator can continue but the robot must detour. It also yields lower jerk-proxy values and measured controller latency than dynamic-window and Timed Elastic Band baselines. Factorial ablations distinguish reciprocal refinement from progress recovery, delayed-response tests probe temporal mismatch, and an indoor deployment demonstrates physical executability.

cs.RO↗

VORL-EXPLORE: A Hybrid Learning Planning Approach to Multi-Robot Exploration in Dynamic Environments

Hierarchical multi-robot exploration decouples frontier allocation from local navigation, making systems brittle in dynamic environments. Without awareness of execution difficulty, allocators may send robots toward frontiers whose routes are congested or unsafe, causing bottlenecks, oscillatory replanning, and redundant coverage. We propose VORL-EXPLORE, a hybrid learning and planning framework that makes exploration execution-aware through execution fidelity, an estimate of local navigability and execution reliability. This fidelity score is used to penalize risky or crowded frontiers in a fidelity-coupled Voronoi allocation objective with inter-robot repulsion, and to arbitrate between global $A^*$ guidance and a reactive reinforcement learning policy during navigation. As a result, robots follow efficient global plans in reliable regions and rely more on safer local reactions in crowded or changing areas. The fidelity model is recalibrated using self-supervised pseudo-labels derived from recent progress and safety outcomes. Quantitative experiments on randomized dynamic grids and an ablation under severe traffic show higher success rates, shorter exploration lengths, and lower inter-robot coverage overlap. A Gazebo factory scenario is included as a deployment illustration. The source code is available at https://github.com/21ning/VORL-EXPLORE.

cs.RO↗

Factor Graph-Based Continuum Robot State Estimation with Magnus Expansion Priors

Reconstructing the shape of continuum manipulators from sparse, noisy sensor data is a challenging task, owing to the infinite-dimensional nature of such systems. Existing approaches broadly trade off between parametric methods that yield compact state representations but lack probabilistic structure, and Cosserat rod inference on factor graphs, which provides principled uncertainty quantification at the cost of a state dimension that grows with the spatial discretization. This letter combines the strengths of both these approaches by estimating the coefficients of a compact Geometric Variable Strain (GVS) parameterization within a factor graph framework. A novel kinematic factor, derived from the Magnus expansion of the strain field, encodes the closed-form rod geometry as a prior constraint linking the GVS strain coefficients to the backbone pose variables. The resulting formulation yields a compact state vector, is directly amenable to model-based control, and it retains the modularity, probabilistic treatment, and computational efficiency of factor graph inference. The proposed method is evaluated on both simulated and experimental data and compared against a Gaussian Process (GP) regression baseline, demonstrating increased accuracy in partial and sparse measurement scenarios while preserving computational efficiency.

cs.RO↗