Spatial Attention: Adapting Execution Horizons for Diffusion Policies via Observation Sensitivity

• URL: http://arxiv.org/abs/2607.04739v1
• Date: Mon, 06 Jul 2026 07:22:04 GMT
• Title: Spatial Attention: Adapting Execution Horizons for Diffusion Policies via Observation Sensitivity
• Abstract summary: We adaptively adjust the execution horizon of sampled action chunks, balancing responsiveness and computational efficiency.<n>We show that, under a fixed budget of chunk samplings, the execution horizon that minimizes the cumulative likelihood drop induced by disturbances decreases as Spatial Attention increases.
• Score: 26.591374083905336
• License: http://creativecommons.org/licenses/by/4.0/
• Abstract: Sampling action chunks via generative models has become a widely adopted methodology for robotic learning from demonstration. However, existing methods often struggle to balance responsiveness and computational cost because they execute each action chunk for a fixed execution horizon. In this paper, we adaptively adjust the execution horizon of sampled action chunks, balancing responsiveness and computational efficiency. We introduce Spatial Attention -- defined as the expected squared norm of the gradient of the action log-likelihood with respect to the observation -- which indicates the sensitivity of the policy's action distribution to variations in the observation. We show that, under a fixed budget of chunk samplings, the execution horizon that minimizes the cumulative likelihood drop induced by disturbances decreases as Spatial Attention increases. By forecasting future Spatial Attention values alongside the action chunk, our framework dynamically assigns shorter execution horizons to phases with high Spatial Attention, and longer horizons to phases with low Spatial Attention. Experiments on standard and perturbed tasks, in both simulation and on a real robot, show that our method significantly improves success rates over fixed-horizon baselines while maintaining the average execution horizon.

Related papers

• Knowing When to Stop: Adaptive Action Chunking via Internal Cross-Attention Dynamics in VLAs [4.792917095787488]
  Action chunking is a standard execution strategy in modern Vision-Language-Action (VLA) frameworks.<n>Short chunks require frequent inference, whereas long chunks can become misaligned with newly observed states.<n>We address this limitation with an adaptive action chunking approach based on internal cross-attention dynamics in the action expert.
  arXiv  Detail & Related papers  (2026-09-01T08:38:16Z)
• SegDiff: Segmented Trajectory Diffusion for Consistent and Adaptive Robot Manipulation [65.81476183180527]
  We introduce SegDiff, a closed-loop visuomotor policy that integrates the strengths of both paradigms.<n>SegDiff decomposes demonstrations into motion segments between keyposes and learns to predict the continuous trajectory from the current state to the next keypose.<n>SegDiff demonstrates significant performance gains over existing approaches across various simulated and real-world scenarios.
  arXiv  Detail & Related papers  (2026-07-13T02:48:03Z)
• Dynamic Execution Horizon Prediction for Chunk-based Robot Policies [29.482987292744568]
  Action chunking has become a standard design in modern robot policies, where the policy predicts a sequence of actions and executes a fixed number of them instead of acting one step at a time.<n>In practice, the execution horizon is typically chosen through empirical tuning and is highly task-dependent.<n>We propose Dynamic Execution Horizon Prediction (DEHP), an effective method that trains a lightweight execution-horizon prediction branch using online reinforcement learning.
  arXiv  Detail & Related papers  (2026-06-09T19:58:31Z)
• SAFE-Pruner: Semantic Attention-Guided Future-Aware Token Pruning for Efficient Vision-Language-Action Manipulation [71.91583446135651]
  We propose SAFE-Pruner, a plug-and-play pruning framework that incorporates attention cues of future layers into pruning decisions.<n>We show that our method achieves up to 1.89x speedup with a minimal degradation in success rate of less than 1.7%, while outperforming state-of-the-art methods by up to 1.9%.
  arXiv  Detail & Related papers  (2026-05-28T09:23:08Z)
• MSACT: Multistage Spatial Alignment for Stable Low-Latency Fine Manipulation [4.439585594082787]
  Real-world fine manipulation, particularly in bimanual manipulation, requires low-latency control and stable visual localization.<n>Existing approaches make different trade-offs: action-chunking policies such as ACT enable low-latency execution and data efficiency but rely on dense visual features without explicit spatial consistency.<n>We introduce a multistage spatial attention module that extracts stable 2D attention points and jointly predicts future attention sequences with a temporal alignment loss.
  arXiv  Detail & Related papers  (2026-05-01T07:35:15Z)
• ProgressVLA: Progress-Guided Diffusion Policy for Vision-Language Robotic Manipulation [57.07494675832939]
  Most existing vision-language-action (VLA) models for robotic manipulation lack progress awareness.<n>In this work, we investigate the estimation and integration of task progress, proposing a novel model named textbf vla<n>Experiments on the CALVIN and LIBERO benchmarks, alongside real-world robot deployment, consistently demonstrate substantial improvements in success rates.
  arXiv  Detail & Related papers  (2026-03-29T12:38:11Z)
• SutureAgent: Learning Surgical Trajectories via Goal-conditioned Offline RL in Pixel Space [22.300952176139948]
  Predicting needle trajectories from endoscopic video is critical for robot-assisted suturing.<n>We formulate image-based needle trajectory prediction as a sequential decision-making problem.<n>SutureAgent encodes variable-length clips using an observation encoder to capture both local spatial cues and long-range temporal dynamics.
  arXiv  Detail & Related papers  (2026-03-19T01:36:07Z)
• VLA Knows Its Limits [27.43938890325202]
  We show that varying the execution horizon leads to substantial performance deviations.<n>We propose AutoHorizon, the first test-time method that dynamically estimates the execution horizon for each predicted action chunk.
  arXiv  Detail & Related papers  (2026-02-24T23:48:48Z)
• Steering Vision-Language-Action Models as Anti-Exploration: A Test-Time Scaling Approach [78.4812458793128]
  We propose textbfTACO, a test-time-scaling framework that applies a lightweight pseudo-count estimator as a high-fidelity verifier of action chunks.<n>Our method resembles the classical anti-exploration principle in offline reinforcement learning (RL), and being gradient-free, it incurs significant computational benefits.
  arXiv  Detail & Related papers  (2025-12-02T14:42:54Z)
• Continual Low-Rank Scaled Dot-product Attention [67.11704350478475]
  We introduce a new formulation of the Scaled-product Attention based on the Nystr"om approximation that is suitable for Continual Inference.<n>In experiments on Online Audio Classification and Online Action Detection tasks, the proposed Continual Scaled Dot-product Attention can lower the number of operations by up to three orders of magnitude.
  arXiv  Detail & Related papers  (2024-12-04T11:05:01Z)
• Dynamic Obstacle Avoidance through Uncertainty-Based Adaptive Planning with Diffusion [40.76697924496143]
  We propose an adaptive generative planning approach that adjusts replanning frequency based on the uncertainty of action predictions. Our method minimizes the need for frequent, computationally expensive, and redundant replanning while maintaining robust collision avoidance performance.
  arXiv  Detail & Related papers  (2024-09-25T14:03:58Z)
• Layout Sequence Prediction From Noisy Mobile Modality [53.49649231056857]
  Trajectory prediction plays a vital role in understanding pedestrian movement for applications such as autonomous driving and robotics. Current trajectory prediction models depend on long, complete, and accurately observed sequences from visual modalities. We propose LTrajDiff, a novel approach that treats objects obstructed or out of sight as equally important as those with fully visible trajectories.
  arXiv  Detail & Related papers  (2023-10-09T20:32:49Z)
• Adaptive Perturbation for Adversarial Attack [50.77612889697216]
  We propose a new gradient-based attack method for adversarial examples. We use the exact gradient direction with a scaling factor for generating adversarial perturbations. Our method exhibits higher transferability and outperforms the state-of-the-art methods.
  arXiv  Detail & Related papers  (2021-11-27T07:57:41Z)

This list is automatically generated from the titles and abstracts of the papers in this site.

This site does not guarantee the quality of this site (including all information) and is not responsible for any consequences.