Skip to content
Conference

Uncertainty-Guided Sparse Refinement for Action Chunking Transformer Policies

Jul 2026 · 2026 IEEE International Conference on Multimedia and Expo Workshops (ICMEW) · 1 citation · 29 references
Computer Science

TL;DR

Uncertainty-Guided Refinement (UGR), a sparse refinement framework for chunk-based visuomotor policies, which first predicts a full action chunk, estimates per-step temporal uncertainty from the coarse hidden states, and applies residual correction only to the most uncertain timesteps selected by a binary mask.

Abstract

Learning chunk-based visuomotor policies for long-horizon robot manipulation remains challenging. Recent action-chunking methods have shown promising performance by predicting temporally extended action sequences. However, their failures are often dominated by prediction errors at a small number of critical timesteps rather than uniformly poor predictions across the entire action chunk, making uniform refinement inefficient and insufficiently targeted. To address this bottleneck, we propose Uncertainty-Guided Refinement (UGR), a sparse refinement framework for chunk-based visuomotor policies. Specifically, UGR follows a coarse-to-refine design: it first predicts a full action chunk, estimates per-step temporal uncertainty from the coarse hidden states, and applies residual correction only to the most uncertain timesteps selected by a binary mask. The uncertainty branch is decoupled from the coarse action predictor, enabling clean attribution of the refinement gains to uncertainty-guided correction rather than additional predictor capacity. Extensive experiments on five dual-arm manipulation tasks from the RoboTwin benchmark show that UGR achieves the best success rate on four tasks, improves over the ACT baseline by up to 13% absolute, and outperforms both full-chunk and position-agnostic block refinement in ablation studies.

View source

Similar papers

Preprint Oct 2026

Refine Actions If Needed: Adaptive Action Chunk Refinement for Robot Manipulation

Computationally lightweight manipulation policies predict executable actions with low inference latency, but prediction errors can limit task success. Iterative generative policies can achieve higher task success rates, but repeated network evaluations increase inference latency. Refining action proposals from computat...

Han-Lin Liu, Zi-Chen Zhou, Jia-Cheng Zhang et al. · 0 citations
#machine learning Preprint Sep 2026

Action Chunking Proximal Policy Optimization with Feedback Correction

Action chunking provides temporal abstraction in reinforcement learning by selecting short action sequences instead of individual actions, but many existing approaches face two limitations in high-dimensional robotic control. First, many rely on value functions over action chunks, which can be difficult to learn as act...

Sang J. Hahn, Jonghyun Choi · 0 citations
Preprint Oct 2026

Predict in Chunks, Revise in Spans: History-conditioned Action Regeneration for Robotic Manipulation

Action chunking improves temporal coherence in visuomotor imitation learning by jointly predicting sequences of future actions. However, many existing policies regenerate entire action chunks even when errors are localized, potentially replacing otherwise valid predictions. We introduce Contextual Masked Action Policy...

Chen-Yang Wang, Yun-Tian Wang, Jia-Ying Tang et al. · 0 citations
#machine learning Preprint Sep 2026

Act More, Decide Less: Skill-Guided Adaptive Action Chunking for Long-Horizon LLM Agents

SPACE induces two-level programmatic skills from successful trajectories, where subskill boundaries serve as direct chunk-boundary supervision from trajectory-induced programmatic skills, and distilled into a primitive-chunk policy via hybrid on-/off-policy optimization.

Yan-Ting Yang, Can Jin, Jin-Man Zhao et al. · 3 citations
Preprint Oct 2026

Accelerating VLA Inference with Perturbation Informed Execution

Action-chunking vision-language-action (VLA) models predict sequences of future robot actions. Under fixed-horizon execution, the robot executes a fixedlength prefix of each predicted chunk before invoking the policy again, leaving the remaining predictions unused. For a given number of executed actions, short executio...

Jehun Lee, Ha-Jun Lee, Jimin Ryu et al. · 0 citations
#artificial intelligence Preprint Sep 2026

Staircase Policy: Streaming Inference for World-Action Models with Large Action Chunks

STAIRCASE POLICY is introduced, a streaming inference and training framework that turns a flow-matching VLA into a JEPA-style WAM and partitions a large action chunk into sub-chunks at staggered denoising stages, enabling long-horizon execution without repeated full policy inference.

Guoheng Sun, Chen Chen, Jin Wang et al. · 0 citations

We use cookies to run the site and, with your consent, for analytics and to show ads. See our Cookie Policy.