Post-training of vision-language-action (VLA) models typically relies on expert demonstrations and policy interaction trajectories. However, in long-horizon manipulation, a single episode often spans hundreds of control steps and multiple phases, while success or failure is only revealed at episode termination. Policy improvement therefore requires step-level credit signals to distinguish behaviors that advance the task from those that stall or regress. We present PACE, a credit-assignment framework for post-training on long-horizon manipulation, centered on a phase-progress-aware critic. PACE consists of two key modules: (1) the Global-Local Cooperative Value-Correction Critic (GLC-Critic) aggregates visual and motion-difference features within local temporal windows to infer the phase and intra-phase progress of each step, and applies residual correction to a discretized remaining-cost distribution accordingly, enabling step-level credit assignment; (2) Progressive Policy Distillation (PPD) converts credit into positive and negative conditions via task-wise thresholds and trains a credit-conditioned action generation policy: it first protects the pretrained policy with high-credit positive samples, then incorporates all positive and negative credits to learn the quality boundary, and at inference amplifies high-credit behaviors through the difference between conditional outputs. Extensive simulation experiments and diverse real-world robotic-arm experiments demonstrate that PACE consistently achieves significant improvements over the strongest baseline.
Figures & tables
Figure 1: Raw and fused remaining-cost predictions on successful (top) and incomplete (bottom) trajectories.
Figure 2: Overview of PACE. Post-training trajectories supervise the phase–progress-aware GLC-Critic, which produces corrected remaining-cost estimates for credit relabeling. Progressive Policy Distillation then adapts the use of positive and negative credit as iterative data collection improves critic coverage, updating the VLA policy for simulation and real-robot deployment.
Figure 3: Temporal and phase–progress branches of the GLC-Critic. Local observations and motion differences produce the coordinates used for value correction.
Figure 4: Real-robot experimental platform with dual AgileX PiPER slave arms, bilateral master arms for teleoperation, and three camera views.
Method
Avg. SR (%) ↑
AvgT (steps) ↓
Held-out MAE ↓
Boundary MAE ↓
SFT (OpenVLA)
52.7±1.6
310.8±78.4
—
—
SFT (XR-0)
57.2±1.3
298.7±75.1
—
—
SFT ( π0.5 )
63.3±1.3
276.9±68.3
—
—
ReCAP
73.8±1.8
254.26±63.54
133.03
136.02
PACE
83.3±2.5
252.55±69.07
97.78
77.01
Table 1: Main LIBERO-Long results. Critic errors use inverse-mapped return units; Boundary MAE uses ±10 -step transition neighborhoods.
Figure 5: Task-wise LIBERO-Long SR (a; higher is better) and Boundary MAE (b; lower is better).
Critic Variant
SR (%) ↑
Held-out MAE ↓
Boundary MAE ↓
Raw Critic
73.8±1.8
133.03
136.02
w/o temporal aggregation
81.6±2.3
99.31
78.03
w/o motion differences
80.9±2.2
100.01
79.43
w/o phase head z
81.2±2.2
100.17
78.73
w/o progress head p
82.7±2.4
98.03
77.23
Full GLC-Critic
83.3±2.5
97.78
77.01
Table 2: GLC-Critic ablation under the protocol of Table 1 .
Update (shared init.)
PR-CFG SR (%) ↑
FACD SR (%) ↑
Simulation
Round 1 on Δ1 (base, 44.2 )
54.5±2.0∗
49.0±2.5
Round 2 on Δ2 (same R1 PR-CFG, 54.5 )
61.0±2.0
64.5±1.5∗
Real Robot
Round 1 on Δ1 (base, 16.4 )
32.9±1.9∗
22.2±2.3
Round 2 on Δ2 (same R1 PR-CFG, 32.9 )
49.6±2.1∗
41.3±0.7
Table 3: Controlled PPD ablation with shared initialization, data, critic predictions, and update budget. ∗ marks a significant paired two-sided Wilcoxon difference over task–evaluation blocks after Holm correction across the six rows.
Method
Task 1
Task 2
Task 3
Held-out MAE ↓
Boundary MAE ↓
SR (%) ↑
AvgT (s) ↓
SR (%) ↑
AvgT (s) ↓
SR (%) ↑
AvgT (s) ↓
SFT (OpenVLA)
40.7±1.2∗
89.7±1.7
35.3±4.6∗
84.8±3.2
16.7±3.1∗
90.4±3.5
—
—
SFT (XR-0)
38.0±2.0∗
83.8±10.9
36.0±3.5∗
82.9±6.6
30.7±5.0∗
77.1±6.1
—
—
SFT ( π0.5 )
54.7±2.3∗
78.2±3.6
51.3±2.3∗
76.7±3.1
47.3±4.6∗
74.9±4.5
—
—
ReCAP
62.7±3.1∗
72.5±4.3
70.7±3.1∗
76.9±3.9
66.0±6.0∗
79.5±3.3
68.17
58.73
PACE (ours)
84.7±4.2
53.0±9.8
83.3±2.3
58.9±16.6
77.3±1.2
64.3±11.5
18.89
4.12
Table 4: Task-wise real-robot results. AvgT is successful-trial duration in seconds. Tasks 1–3 are Table Wiping, Towel Folding, and Mug Placement and Knob Turning. For SR, ∗ indicates that PACE significantly outperforms the corresponding baseline on that task (two-sided Fisher exact test on 150 pooled trials per method, Holm-adjusted p≤0.04 ).
Figure 6: Real-robot task-wise SR over three repeated evaluations; higher is better.
Demonstration-conditioned policies provide a natural interface for specifying robot behavior, yet long-horizon manipulation remains difficult when visually similar states recur across different stages or when demonstrations and executions proceed at different speeds. We identify the resulting failure mode as stage confusion and introduce Progress-Aligned Context for Execution (PACE), a stateful method that continually reinterprets a complete demonstration according to realized execution progress. PACE compresses the demonstration into ordered multimodal prompt tokens and uses training-only dual-edge attention supervision to expose its latent stage structure. During execution, an episode-local fast-weight memory causally encodes realized action-observation transitions and modulates prompt cross-attention, producing a progress-aligned context for a unified diffusion action expert without test-time stage labels or stage-specific policies. PACE improves success from 88.9% to 94.0% on LIBERO-Gen Goal Chain, from 79.1% to 83.3% on Spatial Combination, and from 33.3% to 73.3% on the two-step Block Routing tasks. Failure analysis further indicates that structured demonstration alignment and causal execution memory jointly mitigate stage confusion.
Yenan Chen, Junjie Shi, Lu Chen +2
College of Control Science and Engineering, Zhejiang University, Hangzhou 310027, China
Recent vision-language-action and diffusion-based robot policies often use action chunking, where each policy query predicts a sequence of future actions and the robot executes an open-loop prefix before re-querying. While this interface improves local motion continuity, deployment still requires choosing the execution horizon: how much of each predicted chunk should be executed before acquiring a new observation. However, our experiments show that success is strongly task-dependent and non-monotonic with respect to the execution horizon, making a single constant horizon an unreliable deployment rule. We propose PACE (Phase-Aware Chunk Execution), a training-free test-time execution method that selects the execution horizon online from the predicted chunk itself. PACE exploits the phase-dependent kinematic structure of manipulation trajectories by identifying low-speed transition points in the predicted speed profile and using them as candidate replanning boundaries. Because PACE uses only the predicted action chunk, it is plug-and-play and requires no retraining or access to policy internals. We validate PACE through large-scale evaluations in both simulation and real-robot settings. On 50 RoboTwin2.0 tasks, PACE raises the average success rate from 57.8% to 64.2%. In real-robot experiments on bimanual ALOHA and single-arm Franka platforms, PACE improves the average task score from 60.7 to 77.7 and the average success rate from 50.7% to 70.4%. Ablations and rollout-level analyses show that PACE adapts execution horizons across manipulation phases, shortening near transitions while preserving longer execution during coherent motion.
Junnan Nie, Jiayi Li, Chenghao Liu +5
Peking University · Peking University. · JD Explore Academy. +1
Vision-language-action (VLA) models have shown promise in robotic manipulation, but imitation learning (IL) alone often struggles to master complex long-horizon skills. Reinforcement learning (RL) offers an effective avenue for further improving VLA policies. However, existing VLA-RL methods typically suffer from delayed and biased credit assignment due to trajectory-level sparse rewards, while imbalanced subtask mastery creates bottlenecks that limit overall performance. To address these challenges, we propose AtomicRL, an RL post-training framework that leverages atomic task structures for reliable credit assignment and adaptive exploration. AtomicRL introduces Semantic-Aware Policy Optimization (SAPO), which uses semantic-aware gating to constrain TD residuals from failed atomic subtasks from propagating across task boundaries, mitigating credit contamination while preserving intra-subtask credit assignment and value bootstrapping. In addition, Bottleneck-Adaptive Target Exploration (BATE) dynamically coordinates task sampling and local exploration incentives based on the mastery of individual atomic subtasks, directing learning toward the remaining bottlenecks. Finally, we develop a Real2Sim2Real pipeline that bridges online RL in simulation with real-world deployment, facilitating practical transfer to physical robots. On LIBERO-LONG, AtomicRL achieves absolute performance gains of 3.6% and 4.0% over PPO across two VLA architectures. On CALVIN ABC-D, it improves full-task performance by up to 9.5% over PPO. Combined with the Real2Sim2Real pipeline, AtomicRL further improves real-world task performance by an average of 21.3%. These results demonstrate that AtomicRL effectively improves the learning efficiency and manipulation performance of VLA policies on long-horizon tasks.
Likui Zhang, Zhe Zhu, Zhihao Zhan +7
Sun Yat-sen University · JD Explore Academy · The Hong Kong Polytechnic University