Literature
Display
← All papers

EqC: Equilibrium Energy Control for Introspective Lifelong Robot Learning

Haodong Yang · Runhan Huang · Bowen Zhang · Iofai Lei · Zunzhe Zhang · Xiangcheng Zhang · Shaoting Zhu · Linzhan Mou · Yicheng Liu · Hang Zhao

Preprint posted · arXiv (preprint) ↗

Robotics20 min text · CondensedOriginal paper ↗
Contents

Overview

Explicit-energy action refinement, a trajectory-consistency warning score, and intervention-driven retraining. All original figures, tables, displayed mathematics, algorithms and references are retained. Source code.

Original PDF composite: g1
Figure 1: Overview of Equilibrium Energy Control (EqC). Top: EqC generates actions through energy-based refinement, while the geometry of the refinement path reveals when autonomous execution is weakly supported. Energy-Gated DAgger uses this signal to trigger expert takeover and subsequent policy improvement. Bottom: In real-world deployment, persistent UΔ​EU_{\Delta E} alarms prompt timely assistance before failure, progressively converting assisted interventions into fully autonomous execution through lifelong learning.

At a glance

EqC learns a scalar landscape whose action gradients refine a noisy action chunk. Comparing energy progress along that refinement path with the training bridge produces a warning signal; persistent alarms request expert recovery, and accumulated recoveries retrain the policy. Simulation and small real-robot studies report better control and failure discrimination. The theory establishes properties of the learned landscape, not action correctness or guaranteed failure detection; long-term transfer remains open.

1 Introduction

A deployed policy needs both useful actions and a way to request help when execution becomes unreliable. EqC connects these functions through one conditional energy model: optimize actions, inspect the optimization path, and collect recovery demonstrations where that path is inconsistent. Unlike a static action generator, its deployment loop includes targeted data acquisition and repeated offline updates. “Competence expansion” refers to improved autonomy on the tested tasks after those updates, not unrestricted self-improvement.

2 Related Work

The approach joins generative control, energy-based inference and robot-gated imitation learning. Its distinguishing mechanism is the finite change in explicit energy along the same path used to produce actions.

Generative models for robotics.

Diffusion and flow-matching policies refine noisy action candidates iteratively. EqC retains that computational pattern while replacing an unconstrained denoising/velocity field with the gradient of a scalar energy. It builds on architectures such as π0 and diffusion transformers rather than introducing a new perception backbone.

Energy-based models for robotics.

Earlier energy policies optimize observation–action compatibility, and Equilibrium Matching and GeCO use stationary refinement with implicit energy structure. EqC makes the deployed scalar explicit, so its change along a path can be measured. This differs from using only the terminal energy as confidence.

Failure detection and competence-aware autonomy.

DAgger aggregates on-policy expert corrections; robot-gated variants decide when to ask for them. Diff-DAgger uses denoising/flow loss as a warning signal. EqC instead compares observed energy progress with a bridge-derived reference and requires persistent violations before takeover.

3 EqC for Introspective Lifelong Robot Learning

The formulation separates learning a stationary energy gradient, reading its refinement geometry, and using that signal in a recovery-and-retraining loop.

3.1 Overview

Given observation, instruction and robot state, the energy ranks candidate action chunks. Gradient ascent generates a chunk; path consistency measures agreement with the learned bridge relation; an alarm gate determines whether to execute the prefix or request recovery.

3.2 Equilibrium Energy Control

Interpolate from Gaussian noise ε to demonstration a using xₜ=ε+t(a−ε), with t=0 at noise and t=1 at data. Train ∇ₓE to match c(t)(a−ε), normalized by active action dimension. At deployment the field receives x and condition z but no bridge time: initialize noise, take K ascent steps, execute a short prefix and replan. Smoothness and sufficiently small steps imply increasing learned energy, without guaranteeing task success.

Equations 1–2
d:=a−ε,xt:=ε+t​d,C⁡(t):=∫t1c⁡(s)​𝑑s.d:=a-\varepsilon,\qquad x_{t}:=\varepsilon+td,\qquad C(t):=\int_{t}^{1}c(s)\,\mathrm{d}s. (1)
ℒgrad=𝔼(a,z),ε,t​[1D​‖∇xEθ​(xt,z)−c⁡(t)​d‖22].\mathcal{L}_{\mathrm{grad}}=\mathbb{E}_{(a,z),\varepsilon,t}\left[\frac{1}{D}\left\|\nabla_{x}E_{\theta}(x_{t},z)-c(t)d\right\|_{2}^{2}\right]. (2)

Architecture compatibility.

The implementation forms E(x,z)=〈x,f(x,z)〉 over active action coordinates and differentiates the entire scalar, including f’s dependence on x. Training therefore requires higher-order differentiation. DiT and VLA models share this scalar interface; π0 retains its multimodal prefix/action expert and padding mask while fixing model time to zero.

3.3 Introspection from Energy Geometry

Perfect bridge-gradient matching implies E(a)−E(xₜ)=‖a−ε‖²C(t). At inference, use the predicted endpoint as a self-anchor, project iterates onto the initial-noise-to-endpoint chord, normalize energy-to-go by a floored squared chord length, and average absolute deviations from C. The signal needs no test-time expert or auxiliary uncertainty model. Main Equation 4 averages k=0,…,K−1, whereas Appendix Equation 62 uses k=1,…,K; both originals are retained, and the paper does not reconcile that indexing difference. Self-consistency alone can miss a confidently wrong trajectory.

Equations 3–4
Eθ​(a,z)−Eθ​(xt,z)=‖d‖22​C​(t).E_{\theta}(a,z)-E_{\theta}(x_{t},z)=\|d\|_{2}^{2}C(t). (3)
τk\displaystyle\tau_{k} :=clip⁡(⟨x(k)−x(0),v⟩Dv,0,1),\displaystyle:=\operatorname{clip}\!\left(\frac{\langle x^{(k)}-x^{(0)},v\rangle}{D_{v}},0,1\right), (4)
rkΔ​E\displaystyle r_{k}^{\Delta E} :=Eθ​(x^,z)−Eθ​(x(k),z)Dv−C⁡(τk),\displaystyle:=\frac{E_{\theta}(\hat{x},z)-E_{\theta}(x^{(k)},z)}{D_{v}}-C(\tau_{k}),
UΔ​E​(z)\displaystyle U_{\Delta E}(z) :=1K​∑k=0K−1|rkΔ​E​(z)|.\displaystyle:=\frac{1}{K}\sum_{k=0}^{K-1}\left|r_{k}^{\Delta E}(z)\right|.

3.4 Energy-Gated DAgger for Lifelong Robot Learning

Before each action prefix, compare the score with a threshold. After m consecutive exceedances, pause autonomous execution, obtain an expert recovery and save it. Subsequent rounds train on the cumulative demonstration set. Persistence rejects isolated spikes, but thresholds, window size and expert availability remain parts of the operating protocol.

Algorithm 1 Energy-Gated DAgger with EqC
1: Initial demonstrations 𝒟 0 \mathcal{D}_{0} , threshold γ \gamma , persistence m m , rounds R R 2: θ 0 ← TrainEqC ​ ( 𝒟 0 ) \theta_{0}\leftarrow\textsc{TrainEqC}(\mathcal{D}_{0}) 3: for r = 0 , … , R − 1 r=0,\ldots,R-1 do 4: 𝒬 r ← ∅ \mathcal{Q}_{r}\leftarrow\varnothing , h ← 0 h\leftarrow 0 5: for each replan j j in deployment round r r do 6: z j ← Observe z_{j}\leftarrow\textsc{Observe} 7: ( x ^ j , 𝒳 j ) ← EnergyRefine ​ ( E θ r , z j ) (\hat{x}_{j},\mathcal{X}_{j})\leftarrow\textsc{EnergyRefine}(E_{\theta_{r}},z_{j}) 8: u j ← EnergyConsistency ​ ( 𝒳 j ) u_{j}\leftarrow\textsc{EnergyConsistency}(\mathcal{X}_{j}) 9: h ← ( h + 1 ) 1 [ u j > γ ] h\leftarrow(h+1)\,\mathbf{1}[u_{j}>\gamma] 10: if h = m h=m then 11: ξ j ⋆ ← ExpertRecover ​ ( z j ) \xi_{j}^{\star}\leftarrow\textsc{ExpertRecover}(z_{j}) 12: 𝒬 r ← 𝒬 r ∪ { ξ j ⋆ } \mathcal{Q}_{r}\leftarrow\mathcal{Q}_{r}\cup\{\xi_{j}^{\star}\} , h ← 0 h\leftarrow 0 13: else 14: ExecutePrefix ​ ( x ^ j ) \textsc{ExecutePrefix}(\hat{x}_{j}) 15: end if 16: end for 17: 𝒟 r + 1 ← 𝒟 r ∪ 𝒬 r \mathcal{D}_{r+1}\leftarrow\mathcal{D}_{r}\cup\mathcal{Q}_{r} 18: θ r + 1 ← TrainEqC ​ ( 𝒟 r + 1 ) \theta_{r+1}\leftarrow\textsc{TrainEqC}(\mathcal{D}_{r+1}) 19: end for 20: return E θ R E_{\theta_{R}}

4 Why EqC Fits Generative Robot Policies

The argument for explicit energy combines a favorable conditional action-generation setting with bounds on representation and optimization. These are sufficient conditions and structural properties, not a universal superiority result.

A favorable generation regime.

Rich observations and instructions may narrow valid actions; control needs one successful action and replans after a short prefix. Smaller outputs and concentrated conditional targets may therefore make stationary optimization practical. This motivation does not establish that all robotics tasks have low action ambiguity or recoverable bridge progress.

Approximation and optimization.

A radial witness bounds the excess risk of stationary energy gradients relative to a time-conditioned regressor by action dispersion, uncertainty in recovering bridge scale, and neural approximation error. Separate results give monotone ascent under local smoothness and stable steps, and decompose the warning residual into chord-wise field mismatch, off-chord motion and normalization effects. None proves that a low residual means a safe or correct action.

Equation 5
REqCΘ−Rtc⋆≤(σact+σscale+δΘ)2.R_{\mathrm{EqC}}^{\Theta}-R_{\mathrm{tc}}^{\star}\leq\left(\sigma_{\mathrm{act}}+\sigma_{\mathrm{scale}}+\delta_{\Theta}\right)^{2}. (5)

5 Experiments

Evaluation covers action generation, rollout-level failure detection, and repeated recovery-data collection. Published benchmark baselines, independent reproductions, calibrated operating metrics and qualitative examples are distinguished below.

5.1 Simulated and Real-World Benchmarks

Control comparisons use common task-success definitions within each benchmark. The real-robot results cover three manipulation tasks on one bimanual platform.

5.1.1 Setup

DiT comparisons share architecture, demonstrations and action interface; VLA comparisons retain the underlying multimodal backbone within each pair. Benchmarks include LIBERO, five RoboTwin tasks, five standardized VLABench tracks and seven LIBERO-Plus perturbation families. These controlled comparisons do not make data budgets identical across unrelated published methods.

5.1.2 Diffusion Transformer

EqC averages 93.95±0.66% across four DiT training seeds on LIBERO, rounded to 94.0% in the main table. The main table mixes this mean with published baseline values. Independent matched reproductions in Appendix A give rectified flow 89.12±0.80% and GeCO 92.30±1.02%; these are the more direct multi-seed comparison.

Table 1: Success rates (%) on LIBERO with the DiT policy and VLABench with VLA policies.

(a) LIBERO–DiT

Method Goal Spatial Object Long Avg.
Diffusion Policy 82.9 91.4 88.9 82.7 86.5
Rectified Flow 92.4 94.6 97.0 76.0 90.0
GeCO 95.2 95.8 99.0 83.8 93.5
EqC (ours) 95.6 96.4 98.1 85.5 94.0

(b) VLABench–VLA

Method T1 T2 T3 T4 T6 Avg.
π0.5\pi_{0.5} 40.6 22.6 18.0 16.1 25.6 24.5
π0.5\pi_{0.5} + EqC (ours) 44.3 21.3 18.5 15.4 36.0 27.1
π0\pi_{0} 47.0 21.2 29.1 17.3 32.2 29.4
π0\pi_{0} + GeCO 61.0 22.0 34.0 20.0 45.0 36.0
π0\pi_{0} + EqC (ours) 64.4 29.0 28.6 15.8 45.6 36.7

5.1.3 Vision-Language-Action Policies

The VLA variant evaluates the π0 action expert at model time zero, scalarizes its features with the action, and trains the resulting gradient. Active-coordinate masking prevents padded embodiment dimensions from entering the energy objective. Improvements are measured after benchmark-specific fine-tuning, except the direct LIBERO-to-LIBERO-Plus transfer.

Table 2: VLA policy success rates (%) on RoboTwin 2.0 (Easy / Hard) and LIBERO-Plus.

(a) RoboTwin 2.0 (Easy / Hard)

Method Bottle Hammer Rank Alarm Bell Avg.
π0\pi_{0} 90 / 56 43 / 21 7 / 1 63 / 11 44 / 3 49 / 18
π0\pi_{0} + GeCO 88 / 66 52 / 36 0 / 0 72 / 16 42 / 21 50 / 28
π0\pi_{0} + EqC (ours) 100 / 76 76 / 27 6 / 0 83 / 32 49 / 30 63 / 33

(b) LIBERO-Plus

Method Orig Cam Rob Lang Light Back Noise Lay Avg.
OpenVLA 76.5 0.8 3.5 23.0 8.1 34.8 15.2 28.5 15.6
π0\pi_{0} 94.2 15.8 6.6 61.0 79.6 78.5 79.4 70.4 53.6
π0\pi_{0} + EqC (ours) 94.3 61.7 39.0 54.8 84.6 83.0 74.3 73.1 65.8

RoboTwin 2.0.

Across five RoboTwin tasks and 100 episodes per task/setting, π0 improves from 49% Easy / 18% Hard to 63% / 33% with EqC, versus 50% / 28% with GeCO. Gains vary by task; the experiment covers this selected subset rather than the entire benchmark.

VLABench.

VLABench averages increase from 29.4% to 36.7% for π0 and from 24.5% to 27.1% for π0.5 across T1–T4 and T6. T5 is excluded because the official cross-task setting has no fixed standardized split. The two backbone configurations also use different training batch sizes.

LIBERO-Plus.

Direct evaluation of the LIBERO-trained policy on LIBERO-Plus raises the aggregate from 53.6% to 65.8%. Camera-shift success rises from 15.8% to 61.7%, and robot-initialization success from 6.6% to 39.0%. Improvements are not uniform across every perturbation; language and sensor-noise success, for example, are lower in the displayed table.

5.1.4 Real-World Experiments

With 20 trials per task on two Galaxea A1Z arms, EqC improves flower insertion from 45% to 80%, towel folding from 80% to 95%, and sweeping from 65% to 100%, giving 63.3%→91.7% average success. Average inference latency increases from 432.4 to 543.9 ms (about 26%). These are finite task-level success counts, without a reported multi-seed physical control comparison.

Figure 2: Real-world bimanual execution. Top (1–3): Flower Insertion. Middle (1–3): Towel Folding. Bottom (1–3): Debris Sweeping.
Figure 2: Real-world bimanual execution. Top (1–3): Flower Insertion. Middle (1–3): Towel Folding. Bottom (1–3): Debris Sweeping.
Table 3: Control and competence-awareness evaluation. (a) Success and latency on three real-world bimanual tasks (20 trials each). (b) Failure detection on pooled LIBERO and LIBERO-Plus rollouts. “EqC+Diff-DAgger” denotes the Diff-DAgger flow-loss detector applied to the EqC backbone; EqC uses path-wise energy consistency.

(a) Real-world bimanual manipulation

Success (%) Latency (ms)
Method Flower Towel Sweep. Avg. Flower Towel Sweep. Avg.
Galaxea G0.5 45.0 80.0 65.0 63.3 421.9 435.6 439.6 432.4
Galaxea G0.5 + EqC (ours) 80.0 95.0 100.0 91.7 526.4 556.5 548.7 543.9

(b) Online competence awareness

Method AUROC TPR/FPR Acc. (%) Saved (%)
Diff-DAgger 0.8430 61.3/10.2 82.2 33.3
EqC+Diff-DAgger 0.8888 72.8/8.8 85.5 42.1
EqC (ours) 0.9244 77.9/8.5 87.5 45.5

5.2 Competence Awareness

Competence awareness is evaluated against final rollout success/failure, so an unusual but successful scene is a negative example. The warning score is an empirical failure predictor, not an observation-novelty classifier.

5.2.1 Setup

A rollout alarms when its score stays above threshold for m replans. Failed rollouts are positives, successful ones negatives. Detection timing uses the fraction of the capped horizon remaining at the alarm; this estimates avoided remaining inference, not measured recovery time or prevented damage.

5.2.2 Simulated Rollout Analysis

At the main operating point, EqC reports AUROC 0.9244 versus 0.8430 for Diff-DAgger and 0.8888 for the hybrid. TPR/FPR are 77.9%/8.5%, versus 61.3%/10.2% and 72.8%/8.8%; accuracy is 87.5% and remaining-horizon saving 45.5%. Thresholds/windows use 10% calibration and 90% test data. Appendix B clarifies that AUROC is descriptive over all labeled rollouts, whereas threshold-dependent metrics use the held-out test split.

5.2.3 Real-World Rollout Analysis

A Round-3 block-stacking checkpoint yields 25 successful and 25 failed real rollouts under nominal configurations. Three-step-smoothed EqC curves separate outcomes earlier than Diff-DAgger in Figure 3. This deliberately balanced, small analysis supports qualitative discrimination; it does not estimate natural failure prevalence or a deployment-wide false-alarm guarantee.

Original figure
(a) EqC (ours)
Original figure
(b) Diff-DAgger (baseline)
Figure 3: Real-world failure detection (mean ±1​std\pm 1\,\text{std}, n=25n=25). (a) EqC cleanly separates success and failure early for timely intervention, whereas (b) Diff-DAgger exhibits heavy overlap.

5.3 Energy-Gated DAgger for Lifelong Learning

The physical learning study compares intervention triggers under matched seed data, six recovery demonstrations per round and repeated training. Expert recovery remains an external source of task competence.

5.3.1 Experimental Setup and Protocol

Block stacking and garment folding start with 18 demonstrations each. A fixed γ=0.2 plus persistence triggers recovery; stacking runs five collection rounds and garment folding two. After each round the cumulative data retrain the policy, and 20 fully autonomous trials measure the resulting checkpoint.

5.3.2 Progressive Performance

The PDF Figure 4 and Table 17 are used here: the HTML plot asset contains inconsistent lower curves, so the PDF composite is restored. Across three complete runs, stacking reaches 96.7±2.9% after 30 recoveries, versus 80.0% for G0.5+Diff-DAgger and 58.3% for human-triggered intervention. Garment folding reaches 98.3±2.9% after 12 recoveries, versus 81.7% and 55.0%. The matching budgets support the tested trigger comparison; they do not establish universal superiority to skilled human supervision. Separate single-run studies examine cross-task recovery and a prepared robot-agent expert.

Figure 4: Real-world lifelong learning evaluation with Energy-Gated DAgger. Top: Quantitative success curves across deployment rounds (averaged over 3 independent runs, with 20 autonomous evaluation trials per checkpoint per run). Bottom: Qualitative rollouts: early drift triggers UΔ​EU_{\Delta E} alarms (red banners) for expert recovery; fine-tuned policies achieve autonomous execution (Rows 3–4). Across both (a) Hierarchical Block Stacking and (b) Garment Folding, EqC achieves 96.7% and 98.3% mean success rates, respectively, decisively outperforming Diff-DAgger and human intervention.
Figure 4: Real-world lifelong learning evaluation with Energy-Gated DAgger. Top: Quantitative success curves across deployment rounds (averaged over 3 independent runs, with 20 autonomous evaluation trials per checkpoint per run). Bottom: Qualitative rollouts: early drift triggers U Δ ​ E U_{\Delta E} alarms (red banners) for expert recovery; fine-tuned policies achieve autonomous execution (Rows 3–4).
Across both (a) Hierarchical Block Stacking and (b) Garment Folding , EqC achieves 96.7% and 98.3% mean success rates, respectively, decisively outperforming Diff-DAgger and human intervention.

6 Limitations and Scope

Scope is continuous action chunks with stationary refinement. Hybrid, memory-based and hierarchical policies, calibration transfer, repeated aggregation over long deployments and new embodiments remain untested. Wrong but internally coherent paths can evade the score; expert recovery and repeated offline training are still required.

7 Conclusion

EqC connects action generation and help requests through explicit energy geometry. The reported control and intervention gains support this design on the evaluated manipulation settings. Proposed extensions to locomotion, navigation and driving are future applications, not experiments in this paper.

AI use statement

The authors disclose generative-AI assistance with manuscript wording, scientific figures and code, and state that they reviewed the resulting material and take responsibility for it.

Reproducibility statement

The appendices retain mathematical derivations, model settings, calibration protocols, physical-task definitions and baseline details. Code is linked in Appendix I; the note does not independently reproduce training or robot experiments.

Appendix A Evaluation Details

The implementation appendix specifies benchmark coverage, rollout budgets, shared action interfaces and the distinction between published and independently reproduced baselines.

Table 4: Evaluation coverage and rollout budgets.
Benchmark Coverage Episodes
LIBERO–DiT 4 suites; 40 tasks 50/task
LIBERO–VLA 4 suites; 40 tasks 50/task
RoboTwin 2.0 5 tasks; Easy and Hard 100/task/setting
VLABench Tracks 1, 2, 3, 4, and 6; 50 tasks 50/task
LIBERO-Plus 7 perturbation families 10030 total

A.1 Implementation Protocol

Use noise-to-data time, fix model time at zero and sum energy independently per sample over active dimensions. Training keeps the higher-order graph; inference detaches actions between ascent steps. The reported schedule is c(t)=min{4,20(1−t)}, with its remaining integral evaluated analytically; other schedules require the theory’s stated conditions.

A.2 Benchmarks

Table 4 gives exact coverage and episode budgets. Success criteria come from the benchmark or, for real tasks, the explicit completion rules in Appendix D.

LIBERO.

LIBERO has four suites of ten tasks: Goal, Spatial, Object and Long. DiT and VLA evaluations use 50 episodes per task. The suites vary goal semantics, spatial relations, object categories and multi-stage composition.

RoboTwin 2.0.

RoboTwin covers Adjust Bottle, Beat Block Hammer, Blocks Ranking by Size, Click Alarmclock and Click Bell. Each task has a dedicated fine-tuned policy and 100 evaluation episodes in each Easy/Hard setting; Hard adds domain randomization.

VLABench.

VLABench uses 50 episodes per task over 50 tasks across T1–T4 and T6: task learning, object/category generalization, commonsense, instruction semantics and appearance shifts. The open T5 cross-task track is omitted instead of defining a new private split.

LIBERO-Plus.

LIBERO-Plus tests camera, robot initialization, language, illumination, background, sensor noise and object-layout changes while preserving task semantics. The evaluation budget totals 10,030 episodes, using the LIBERO-trained checkpoint without adaptation.

A.3 DiT Details

DiT encodes vision with DINOv2-base and instructions with T5-base, observes one time step, predicts 16 actions of seven dimensions and executes the first eight. The optimized chunk therefore has 112 active coordinates.

Training.

DiT trains 70,000 steps with batch 256, mixed bf16, AdamW, 5,000 warmup steps, peak learning rate 10⁻⁴ and weight decay 10⁻⁴. These settings define the matched objective comparisons.

A.4 Multi-Seed DiT Results

Four EqC seeds yield suite means 95.60, 96.35, 98.10 and 85.50%, and overall 93.95±0.66%. Long remains the weakest suite. Table 6’s independent rectified-flow and GeCO reproductions are separate from the published baselines in the main table; the latter are not presented as newly rerun.

Table 5: Detailed EqC success rates (%) across multiple training seeds on LIBERO.
Seed Goal Spatial Object Long Avg.
0 95.6 97.2 98.6 85.4 94.3
1 96.0 97.0 98.4 87.0 94.7
2 95.0 96.0 97.6 85.4 93.5
3 95.8 95.2 97.8 84.2 93.3
Mean ±\pm sample s.d. 95.60±0.4395.60\pm 0.43 96.35±0.9396.35\pm 0.93 98.10±0.4898.10\pm 0.48 85.50±1.1585.50\pm 1.15 93.95±0.6693.95\pm 0.66
Table 6: Overall LIBERO success across multiple training seeds.
Method Mean (%) Sample s.d. (%)
Fixed RF, 20 steps 89.12 0.80
GeCO 92.30 1.02
EqC (ours) 93.95 0.66

A.5 VLA Training Details

OpenPI π0/π0.5 checkpoints are fine-tuned with AdamW, gradient norm clipping at 1, cosine decay, 10,000 warmup steps and peak learning rate 5×10⁻⁵. Training lasts 50,000 steps for LIBERO and 30,000 for RoboTwin/VLABench.

RoboTwin 2.0.

Each RoboTwin task uses batch 32, three RGB cameras and proprioception. The action chunk spans 50 steps and 14 active coordinates per step, totaling 700 optimized dimensions.

LIBERO and LIBERO-Plus.

LIBERO π0 uses the physical-intelligence/libero dataset, batch 32 and 50,000 steps. Its checkpoint transfers directly to all seven LIBERO-Plus perturbation suites, with no benchmark-specific fine-tuning.

VLABench.

VLABench uses the released primitive fine-tuning dataset for 30,000 steps. Batch sizes are 256 for π0 and 32 for π0.5, so their absolute results are not a batch-matched comparison between backbones.

A.6 Supplementary LIBERO Results for VLA Policies

The supplementary VLA LIBERO result averages 94.3%, versus π0 at 94.2% and π0+GeCO at 93.9%. EqC gains on Long but has lower Goal success than GeCO. The small aggregate advantage here complements, rather than matches the size of, gains on robustness benchmarks.

Table 7: LIBERO success rates (%) with the VLA backbone.
Method Goal Spatial Object Long Avg.
π0\pi_{0} + FAST (Pertsch et al., 2025) 88.6 96.4 96.8 60.2 85.5
π0\pi_{0} 95.8 96.8 98.8 85.2 94.2
π0\pi_{0} + GeCO 96.4 96.8 97.0 85.4 93.9
π0\pi_{0} + EqC (ours) 94.6 97.6 98.8 86.2 94.3

Appendix B Competence Awareness Details

The detector appendix defines rollout-level labels, calibration, baseline scoring, alternative operating points and computation costs. It separates held-out operational estimates from full-data descriptive/oracle analyses.

B.1 Task Definition: Online Failure Detection

Labels reflect final task outcome: unfamiliar success is negative and nominal failure positive. This makes the detector relevant to intervention decisions, but retrospective success labels do not by themselves identify the precise last recoverable instant.

B.2 Simulation Failure Detection Protocol

Whole rollouts are assigned to disjoint 10% calibration and 90% test splits, stratified by original LIBERO plus seven perturbation families. Checkpoints are fixed before calibration. Choose persistence and threshold by approximately 10% calibration FPR or by Youden’s J; freeze them for test metrics. AUROC is separately swept over all labeled rollouts. The comparison shares initial-instance split membership, while policies can generate different trajectories and outcomes. Time saved is 100(1−alarm step/capped horizon), an inference-horizon proxy.

B.3 Real-World Failure Detection Protocol

Real-world detection uses the intermediate stacking checkpoint trained on 36 cumulative demonstrations. Fifty nominal-layout rollouts are selected as 25 successes and 25 failures. A three-step moving average precedes the persistence gate; this differs from treating each raw replanning sample as an independent test example.

B.4 Composition of the Calibration Split

The 1,203-rollout calibration set is stratified across eight dataset variants, with 200 original-LIBERO cases and 108–160 per perturbation family. Suite shares happen to be roughly 25% after random within-family sampling; suites are not separately stratified. Different policies may have different outcome labels for corresponding instances.

Table 8: Detailed composition of the shared 10%10\% calibration split (1,2031{,}203 total rollouts).
(a) Breakdown by Perturbation Variant
Dataset Count Ratio (%)
Original LIBERO 200 16.63
Camera 160 13.30
Noise 160 13.30
Robot 155 12.88
Language 154 12.80
Layout 152 12.64
Light 114 9.48
Background 108 8.98
(b) Breakdown by Benchmark Suite
Suite Count Ratio (%)
LIBERO-Goal 307 25.52
LIBERO-Object 302 25.10
LIBERO-Spatial 299 24.85
LIBERO-10 295 24.52

B.5 Diff-DAgger Baseline Implementation Adapted for π 0

Diff-DAgger first generates an action chunk, treats it as a pseudo-label, then samples fresh noise and Beta(1.5,1) bridge times to measure normalized flow error. It masks padded dimensions and averages M Monte Carlo evaluations; default M=10, versus K=10 EqC refinements in this simulation comparison. These are re-noising/time samples, although later prose calls them dropout samples. The π0 bridge convention in this baseline is reversed relative to EqC’s noise-to-data notation.

Equations 6–12
a^=Sθ​(o,ϵ0),\hat{a}=S_{\theta}(o,\epsilon_{0}), (6)
tq∼Beta⁡(1.5,1),ϵq∼𝒩⁡(0,I).t_{q}\sim\operatorname{Beta}(1.5,1),\qquad\epsilon_{q}\sim\mathcal{N}(0,I). (7)
xtq=tq​ϵq+(1−tq)​a^,x_{t_{q}}=t_{q}\epsilon_{q}+(1-t_{q})\hat{a}, (8)
utq=ϵq−a^.u_{t_{q}}=\epsilon_{q}-\hat{a}. (9)
vθ​(xtq,tq,o).v_{\theta}(x_{t_{q}},t_{q},o). (10)
ℓq=1H​Dact​∑h=1H∑d=1Dactmd​[vθ​(xtq,tq,o)h,d−utq,h,d]2,\ell_{q}=\frac{1}{HD_{\mathrm{act}}}\sum_{h=1}^{H}\sum_{d=1}^{D_{\mathrm{act}}}m_{d}\left[v_{\theta}(x_{t_{q}},t_{q},o)_{h,d}-u_{t_{q},h,d}\right]^{2}, (11)
ℒflow=1M​∑q=1Mℓq.\mathcal{L}_{\mathrm{flow}}=\frac{1}{M}\sum_{q=1}^{M}\ell_{q}. (12)

B.6 Detailed Results

Across m=3–13, EqC’s all-rollout AUROC rises from 0.8877 to 0.9300, ahead of the compared signals. Calibrated FPR is not an exact test guarantee: held-out values vary. Larger persistence generally trades timing for discrimination, and EqC does not win every time-saving cell. Tables 11–12 optimize thresholds on the full evaluation set; their “theoretical upper bound” is an empirical oracle analysis, not a mathematical bound or held-out operating result. Increasing Diff-DAgger samples does not close the observed gap. Per-replan JAX latency is 108.86 ms for EqC, 79.44 ms for M=10 Diff-DAgger and 171.03 ms for the hybrid; EqC is not universally fastest.

Table 9: Sensitivity analysis of detection window size mm under two distinct threshold calibration strategies on the 90% test split.
(a) FPR-Constrained Calibration (Target FPR≈10%\text{FPR}\approx 10\% on calibration split)
Diff-DAgger EqC + Diff-DAgger EqC (ours)
mm AUROC TPR / FPR (%) Acc (%) AUROC TPR / FPR (%) Acc (%) AUROC TPR / FPR (%) Acc (%)
3 0.8296 58.1 / 9.1 82.1 0.8778 71.9 / 9.9 84.8 0.8877 69.5 / 9.1 84.6
4 0.8307 56.3 / 8.3 82.2 0.8774 70.4 / 8.8 85.1 0.8947 70.8 / 8.9 85.1
5 0.8310 57.1 / 8.6 82.2 0.8802 70.9 / 9.3 84.9 0.9005 70.7 / 7.9 85.8
6 0.8328 55.7 / 8.1 82.2 0.8810 71.2 / 9.2 85.1 0.9070 74.7 / 9.0 86.2
7 0.8343 58.3 / 9.2 82.1 0.8818 71.7 / 8.9 85.4 0.9117 74.8 / 9.1 86.1
8 0.8345 59.8 / 9.9 82.0 0.8829 72.4 / 9.5 85.2 0.9147 76.1 / 9.3 86.3
9 0.8352 61.5 / 11.0 81.6 0.8849 73.5 / 9.8 85.3 0.9183 76.7 / 8.9 86.9
10 0.8391 60.3 / 10.1 82.0 0.8862 72.5 / 9.1 85.5 0.9222 77.7 / 8.9 87.1
11 0.8430 61.3 / 10.2 82.2 0.8888 72.8 / 8.8 85.8 0.9244 77.9 / 8.5 87.5
12 0.8517 62.3 / 9.2 83.2 0.8936 74.6 / 10.4 85.2 0.9274 78.4 / 8.4 87.6
13 0.8576 63.8 / 9.9 83.1 0.8978 74.0 / 9.2 85.9 0.9300 78.9 / 9.0 87.4
(b) Youden’s JJ Index Calibration (Maximizing J=TPR−FPRJ=\text{TPR}-\text{FPR} on calibration split)
Diff-DAgger EqC + Diff-DAgger EqC (ours)
mm AUROC TPR / FPR (%) Acc (%) AUROC TPR / FPR (%) Acc (%) AUROC TPR / FPR (%) Acc (%)
3 0.8296 73.9 / 20.8 77.8 0.8778 78.3 / 16.9 81.7 0.8877 78.1 / 14.9 83.0
4 0.8307 65.2 / 13.3 80.9 0.8774 80.6 / 19.5 80.5 0.8947 82.4 / 20.0 80.7
5 0.8310 76.0 / 24.4 75.7 0.8802 79.2 / 16.8 82.0 0.9005 82.1 / 17.5 82.4
6 0.8328 73.0 / 19.9 78.2 0.8810 80.0 / 18.1 81.4 0.9070 79.4 / 13.0 84.7
7 0.8343 75.0 / 23.2 76.3 0.8818 78.6 / 15.9 82.5 0.9117 85.3 / 20.2 81.4
8 0.8345 70.4 / 18.9 78.2 0.8829 76.9 / 13.7 83.6 0.9147 81.9 / 14.5 84.4
9 0.8352 65.5 / 14.5 80.2 0.8849 73.8 / 10.1 85.2 0.9183 83.8 / 15.5 84.3
10 0.8391 71.3 / 17.6 79.4 0.8862 80.8 / 18.0 81.7 0.9222 84.0 / 14.7 85.0
11 0.8430 70.3 / 16.4 80.1 0.8888 78.1 / 14.2 83.6 0.9244 82.1 / 11.8 86.4
12 0.8517 65.1 / 11.0 82.6 0.8936 77.5 / 12.7 84.4 0.9274 87.5 / 18.3 83.4
13 0.8576 69.0 / 13.6 81.7 0.8978 74.6 / 9.6 85.8 0.9300 85.5 / 14.5 85.5
Table 10: Evaluation of early intervention capability (Time Saved %) on the 90% test split. The operational decision thresholds are calibrated using the 10% calibration split under FPR-Constrained and Youden’s JJ index strategies.
FPR-Constrained Calibration Youden’s JJ Index Calibration
mm Diff-DAgger EqC + Diff EqC (ours) Diff-DAgger EqC + Diff EqC (ours)
3 33.6 44.5 45.2 47.9 51.8 53.7
4 31.8 42.5 45.3 39.2 53.8 57.4
5 32.1 42.7 44.5 49.4 51.8 55.5
6 30.6 42.6 46.7 45.2 52.2 51.5
7 32.0 42.8 46.6 47.0 50.2 57.1
8 32.5 43.0 46.3 42.4 47.9 52.2
9 33.9 43.5 46.2 37.4 43.8 53.7
10 32.7 42.4 46.0 41.8 51.0 53.0
11 33.3 42.1 45.5 40.4 47.9 49.8
12 33.3 43.8 45.3 35.4 46.4 54.8
13 34.3 42.4 45.3 38.6 42.9 51.5
Table 11: Evaluation of the theoretical upper bound of online failure detection across window sizes m∈{3,…,13}m\in\{3,\ldots,13\} under Youden’s optimal thresholding strategy (Best Youden). Top: Comparison among the baseline Diff-DAgger, the EqC + Diff-DAgger hybrid, and our proposed EqC; EqC and Diff-DAgger use their default K=10K=10 and M=10M=10 samples, respectively. Bottom: Performance of Diff-DAgger when scaling M∈{16,32,64,128}M\in\{16,32,64,128\}. TPR and FPR are reported as percentages at Youden’s optimal threshold.
(a) Primary Method Comparison Diff-DAgger (baseline) EqC + Diff-DAgger EqC (ours) m m AUROC TPR / FPR (%) Acc (%) AUROC TPR / FPR (%) Acc (%) AUROC TPR / FPR (%) Acc (%) 3 0.8296 72.9 / 19.4 78.5 0.8778 73.8 / 11.5 84.2 0.8877 78.0 / 15.0 82.9 4 0.8307 72.3 / 18.9 78.7 0.8774 76.7 / 14.8 82.7 0.8947 79.2 / 15.3 83.0 5 0.8310 67.8 / 15.1 80.3 0.8802 75.7 / 13.4 83.4 0.9005 81.1 / 15.9 83.2 6 0.8328 74.0 / 20.6 78.0 0.8810 75.4 / 12.6 83.9 0.9070 79.2 / 12.7 84.9 7 0.8343 69.5 / 16.0 80.1 0.8818 76.3 / 13.5 83.5 0.9117 78.2 / 11.7 85.3 8 0.8345 69.1 / 16.5 79.7 0.8829 76.6 / 13.3 83.7 0.9147 82.2 / 14.8 84.3 9 0.8352 72.1 / 19.5 78.2 0.8849 76.5 / 12.9 84.0 0.9183 83.0 / 14.4 84.8 10 0.8391 71.7 / 17.6 79.6 0.8862 78.2 / 14.1 83.6 0.9222 81.1 / 11.5 86.3 11 0.8430 71.8 / 16.9 80.1 0.8888 78.9 / 14.9 83.2 0.9244 82.7 / 12.5 86.1 12 0.8517 73.6 / 17.5 80.1 0.8936 79.1 / 14.3 83.8 0.9274 82.3 / 11.9 86.4 13 0.8576 75.9 / 19.2 79.5 0.8978 77.1 / 11.8 85.0 0.9300 86.6 / 15.4 85.2 (b) Diff-DAgger Scaling Across M M Diff-DAgger ( M = 16 M=16 ) Diff-DAgger ( M = 32 M=32 ) Diff-DAgger ( M = 64 M=64 ) Diff-DAgger ( M = 128 M=128 ) m m AUROC TPR / FPR (%) AUROC TPR / FPR (%) AUROC TPR / FPR (%) AUROC TPR / FPR (%) 3 0.8266 68.0 / 14.6 0.8302 74.5 / 21.1 0.8342 71.6 / 16.2 0.8264 71.3 / 18.2 4 0.8255 69.3 / 16.8 0.8263 70.2 / 17.1 0.8315 72.4 / 18.1 0.8216 68.3 / 16.3 5 0.8280 71.6 / 18.5 0.8250 67.9 / 15.4 0.8294 71.8 / 17.9 0.8210 69.6 / 18.1 6 0.8270 67.2 / 14.6 0.8261 70.9 / 18.8 0.8295 68.9 / 15.4 0.8218 67.4 / 16.1 7 0.8289 68.9 / 15.8 0.8295 71.0 / 18.0 0.8289 68.8 / 15.7 0.8210 65.5 / 13.8 8 0.8298 69.8 / 16.7 0.8297 69.2 / 17.2 0.8311 69.8 / 16.7 0.8209 66.1 / 14.3 9 0.8304 69.6 / 16.2 0.8306 67.9 / 15.2 0.8281 69.9 / 17.0 0.8203 67.9 / 15.8 10 0.8316 70.9 / 17.1 0.8313 69.2 / 16.3 0.8292 69.2 / 16.4 0.8219 68.0 / 16.2 11 0.8338 68.8 / 14.7 0.8355 67.5 / 14.2 0.8334 70.3 / 17.1 0.8248 67.7 / 15.5 12 0.8389 72.1 / 18.1 0.8414 73.8 / 19.8 0.8406 70.1 / 16.0 0.8317 65.6 / 12.6 13 0.8437 70.8 / 15.8 0.8470 70.7 / 15.8 0.8481 70.6 / 15.9 0.8385 72.6 / 19.0
Table 12: Breakdown of theoretically optimal inference time saved (%) across LIBERO and LIBERO-Plus suites under representative evaluation setups. Orig. corresponds to the LIBERO tasks, while the remaining seven columns represent environmental perturbation variants in LIBERO-Plus. Diff-DAgger uses M=10M=10 unless otherwise specified.
Method Orig. Camera Robot Lang. Light Backgr. Noise Layout W. Avg.
Diff-DAgger (m=4m=4) 27.7 50.5 50.1 46.4 30.0 34.0 44.1 47.9 46.1
Diff-DAgger (m=11m=11) 26.5 44.2 46.0 39.9 32.5 32.3 37.3 44.9 41.5
Diff-DAgger (m=13m=13) 28.9 47.2 48.6 44.1 33.8 34.5 43.1 46.1 44.6
Diff-DAgger (M=16,m=4M=16,m=4) 27.0 45.0 47.5 44.1 33.8 28.0 39.0 44.0 42.7
Diff-DAgger (M=16,m=11M=16,m=11) 23.5 41.3 42.4 37.4 28.5 30.2 35.1 40.6 38.4
Diff-DAgger (M=16,m=13M=16,m=13) 25.9 42.8 43.5 39.0 30.7 30.5 37.1 41.8 39.8
Diff-DAgger (M=32,m=4M=32,m=4) 28.1 48.5 48.3 42.8 34.9 34.4 38.5 45.6 43.9
Diff-DAgger (M=32,m=11M=32,m=11) 28.3 40.4 42.9 34.8 31.1 28.7 36.1 38.9 38.0
Diff-DAgger (M=32,m=13M=32,m=13) 28.6 42.9 44.1 37.4 32.3 31.3 38.6 40.6 40.0
EqC + Diff-DAgger (m=4m=4) 30.7 50.3 51.8 56.9 44.1 27.0 44.5 48.9 49.1
EqC + Diff-DAgger (m=11m=11) 30.3 51.4 50.8 53.7 42.6 29.1 46.3 48.3 48.5
EqC + Diff-DAgger (m=13m=13) 26.8 48.4 47.0 50.2 40.8 26.4 43.5 45.2 45.3
EqC (ours)(m=4m=4) 26.7 54.8 57.3 70.7 41.7 29.0 40.1 55.4 54.0
EqC (ours)(m=11m=11) 24.7 53.4 55.3 60.8 39.7 30.2 41.5 47.8 50.5
EqC (ours)(m=13m=13) 26.7 56.4 58.2 61.0 40.3 32.2 46.1 49.5 52.8
Table 13: Comparison of per-replan inference latency (ms) across methods. The latency includes both model action generation and failure-detection signal computation (evaluated at batch size = 1 after JAX warm-up). The optimization step budget KK for EqC is set to 10.
Method Mean Latency (ms)
Diff-DAgger (M=10M=10) 79.44
Diff-DAgger (M=16M=16) 91.43
Diff-DAgger (M=32M=32) 122.11
EqC + Diff-DAgger (M=10M=10) 171.03
EqC (ours) 108.86

B.7 Extended Studies

Terminal energy gives weak discrimination (AUROC about 0.52–0.65); final gradient norm improves it to about 0.87, while full-path consistency reaches 0.93. Energy differences cancel arbitrary additive condition offsets that can affect absolute energy. These ablations support using trajectory geometry, without establishing complete detection of all failure mechanisms.

Table 14: Ablation analysis comparing single-point energy signals against full path-wise EqC across window sizes mm under two calibration strategies on the 90% test split.
(a) FPR-Constrained Calibration (Target FPR≈10%\text{FPR}\approx 10\% on calibration split)
Terminal Energy Last-step Gradient Norm EqC (ours)
mm AUROC TPR / FPR (%) Acc (%) AUROC TPR / FPR (%) Acc (%) AUROC TPR / FPR (%) Acc (%)
3 0.5237 17.1 / 10.0 68.4 0.8734 68.0 / 9.3 84.0 0.8877 69.5 / 9.1 84.6
4 0.5404 19.3 / 10.1 68.9 0.8707 67.1 / 9.1 83.9 0.8947 70.8 / 8.9 85.1
5 0.5604 23.1 / 10.3 69.9 0.8713 65.5 / 8.7 83.6 0.9005 70.7 / 7.9 85.8
6 0.5754 26.0 / 10.8 70.5 0.8724 65.7 / 9.4 83.2 0.9070 74.7 / 9.0 86.2
7 0.5861 26.8 / 10.2 71.1 0.8737 66.0 / 9.3 83.3 0.9117 74.8 / 9.1 86.1
8 0.5974 28.7 / 9.8 71.9 0.8737 66.2 / 9.5 83.3 0.9147 76.1 / 9.3 86.3
9 0.6082 29.9 / 9.4 72.6 0.8744 64.7 / 9.0 83.2 0.9183 76.7 / 8.9 86.9
10 0.6214 32.5 / 10.0 72.9 0.8758 64.2 / 8.5 83.4 0.9222 77.7 / 8.9 87.1
11 0.6309 33.1 / 9.6 73.4 0.8769 65.4 / 9.3 83.1 0.9244 77.9 / 8.5 87.5
12 0.6410 33.8 / 9.6 73.6 0.8766 64.1 / 8.8 83.1 0.9274 78.4 / 8.4 87.6
13 0.6489 34.9 / 9.7 73.8 0.8766 64.6 / 8.8 83.3 0.9300 78.9 / 9.0 87.4
(b) Youden’s JJ Index Calibration (Maximizing J=TPR−FPRJ=\text{TPR}-\text{FPR} on calibration split)
Terminal Energy Last-step Gradient Norm EqC (ours)
mm AUROC TPR / FPR (%) Acc (%) AUROC TPR / FPR (%) Acc (%) AUROC TPR / FPR (%) Acc (%)
3 0.5237 21.6 / 13.2 67.5 0.8734 67.6 / 9.0 84.0 0.8877 78.1 / 14.9 83.0
4 0.5404 22.5 / 12.4 68.3 0.8707 67.7 / 9.5 83.8 0.8947 82.4 / 20.0 80.7
5 0.5604 42.5 / 32.8 59.9 0.8713 64.3 / 7.8 83.9 0.9005 82.1 / 17.5 82.4
6 0.5754 24.0 / 9.0 71.1 0.8724 72.1 / 14.1 81.8 0.9070 79.4 / 13.0 84.7
7 0.5861 28.3 / 11.5 70.6 0.8737 68.6 / 11.0 83.0 0.9117 85.3 / 20.2 81.4
8 0.5974 34.5 / 17.4 68.4 0.8737 65.3 / 9.1 83.3 0.9147 81.9 / 14.5 84.4
9 0.6082 36.7 / 16.1 69.9 0.8744 76.0 / 16.4 81.4 0.9183 83.8 / 15.5 84.3
10 0.6214 33.6 / 11.0 72.5 0.8758 75.8 / 16.3 81.4 0.9222 84.0 / 14.7 85.0
11 0.6309 48.1 / 25.6 66.6 0.8769 72.5 / 13.4 82.4 0.9244 82.1 / 11.8 86.4
12 0.6410 49.7 / 24.0 68.2 0.8766 80.7 / 21.6 79.1 0.9274 87.5 / 18.3 83.4
13 0.6489 44.4 / 18.1 70.8 0.8766 80.4 / 20.9 79.5 0.9300 85.5 / 14.5 85.5

Appendix C Theory: Assumptions and Guarantees

The theory develops a bridge identity, a stationary radial approximation witness, monotone ascent and a decomposition of the self-consistency score. Every displayed derivation is retained; the edited explanation emphasizes assumptions and what each result actually establishes.

C.1 Problem Setup

Draw expert action/condition and independent Gaussian noise; interpolate on a straight bridge and target c(t)(a−ε), with continuous nonnegative c and c(1)=0. A stationary scalar energy supplies the field through its action gradient. The finite energy target is the integral of that field along the bridge; deployed ascent starts from fresh noise.

Equations 13–17
(A,Z)∼pdata(A,Z)\sim p_{\mathrm{data}}
ε∼𝒩⁡(0,ID)\varepsilon\sim\mathcal{N}(0,I_{D})
d:=a−ε,xt:=ε+t​d,t∈[0,1].d:=a-\varepsilon,\qquad x_{t}:=\varepsilon+td,\qquad t\in[0,1]. (13)
c:[0,1]→ℝ≥0c:[0,1]\to\mathbb{R}_{\geq 0}
C⁡(t):=∫t1c⁡(s)​𝑑s.C(t):=\int_{t}^{1}c(s)\,ds. (14)
Eθ:ℝD×𝒵→ℝ.E_{\theta}:\mathbb{R}^{D}\times\mathcal{Z}\to\mathbb{R}.
gθ​(x,z):=∇xEθ​(x,z).g_{\theta}(x,z):=\nabla_{x}E_{\theta}(x,z). (15)
c⁡(t)​d.c(t)d.
ℒgrad​(θ):=𝔼(A,Z),ε,T​[1D​‖∇xEθ​(XT,Z)−c⁡(T)​(A−ε)‖22],\mathcal{L}_{\mathrm{grad}}(\theta):=\mathbb{E}_{(A,Z),\varepsilon,T}\left[\frac{1}{D}\left\|\nabla_{x}E_{\theta}(X_{T},Z)-c(T)(A-\varepsilon)\right\|_{2}^{2}\right], (16)
T∼Uniform⁡[0,1],XT:=ε+T⁡(A−ε).T\sim\mathrm{Uniform}[0,1],\qquad X_{T}:=\varepsilon+T(A-\varepsilon).
∫t1(c⁡(s)​d)⊤​d​𝑑s=‖d‖22​C​(t).\int_{t}^{1}(c(s)d)^{\top}d\,ds=\|d\|_{2}^{2}C(t).
x(0)∼𝒩⁡(0,ID)x^{(0)}\sim\mathcal{N}(0,I_{D})
x(k+1)=x(k)+ηk∇xEθ(x(k),z),k=0,…,K−1.x^{(k+1)}=x^{(k)}+\eta_{k}\nabla_{x}E_{\theta}(x^{(k)},z),\qquad k=0,\ldots,K-1. (17)
x^:=x(K).\hat{x}:=x^{(K)}.

C.2 From Local Gradient Matching to Path Consistency

The fundamental theorem of calculus makes energy inconsistency exactly the integral of local gradient error projected onto the demonstration displacement. Cauchy–Schwarz then bounds it by displacement length, remaining bridge length and accumulated squared field error. Small training field error therefore controls this bridge relation, but a small integral can still hide cancelling local errors.

Equations 18–21
eθ​(s):=∇xEθ​(xs,z)−c⁡(s)​d.e_{\theta}(s):=\nabla_{x}E_{\theta}(x_{s},z)-c(s)d. (18)
{xs:s∈[t,1]}.\{x_{s}:s\in[t,1]\}.
Eθ​(a,z)−Eθ​(xt,z)−‖d‖22​C​(t)=∫t1eθ​(s)⊤​d​𝑑s.E_{\theta}(a,z)-E_{\theta}(x_{t},z)-\|d\|_{2}^{2}C(t)=\int_{t}^{1}e_{\theta}(s)^{\top}d\,ds. (19)
xs=ε+s​d,x_{s}=\varepsilon+sd,
d​xsd​s=d.\frac{dx_{s}}{ds}=d.
dd​s​Eθ​(xs,z)=∇xEθ​(xs,z)⊤​d.\frac{d}{ds}E_{\theta}(x_{s},z)=\nabla_{x}E_{\theta}(x_{s},z)^{\top}d. (20)
∇xEθ​(xs,z)=c⁡(s)​d+eθ​(s).\nabla_{x}E_{\theta}(x_{s},z)=c(s)d+e_{\theta}(s).
dd​s​Eθ​(xs,z)=c⁡(s)​‖d‖22+eθ​(s)⊤​d.\frac{d}{ds}E_{\theta}(x_{s},z)=c(s)\|d\|_{2}^{2}+e_{\theta}(s)^{\top}d.
Eθ​(x1,z)−Eθ​(xt,z)\displaystyle E_{\theta}(x_{1},z)-E_{\theta}(x_{t},z) =∫t1c⁡(s)​‖d‖22​𝑑s+∫t1eθ​(s)⊤​d​𝑑s\displaystyle=\int_{t}^{1}c(s)\|d\|_{2}^{2}\,ds+\int_{t}^{1}e_{\theta}(s)^{\top}d\,ds
=‖d‖22​C​(t)+∫t1eθ​(s)⊤​d​𝑑s.\displaystyle=\|d\|_{2}^{2}C(t)+\int_{t}^{1}e_{\theta}(s)^{\top}d\,ds.
|Eθ​(a,z)−Eθ​(xt,z)−‖d‖22​C​(t)|≤‖d‖2​1−t​(∫t1‖eθ​(s)‖22​𝑑s)1/2.\left|E_{\theta}(a,z)-E_{\theta}(x_{t},z)-\|d\|_{2}^{2}C(t)\right|\leq\|d\|_{2}\sqrt{1-t}\left(\int_{t}^{1}\|e_{\theta}(s)\|_{2}^{2}\,ds\right)^{1/2}. (21)
|Eθ​(a,z)−Eθ​(xt,z)−‖d‖22​C​(t)|=|∫t1eθ​(s)⊤​d​𝑑s|.\left|E_{\theta}(a,z)-E_{\theta}(x_{t},z)-\|d\|_{2}^{2}C(t)\right|=\left|\int_{t}^{1}e_{\theta}(s)^{\top}d\,ds\right|.
|eθ​(s)⊤​d|≤‖eθ​(s)‖2​‖d‖2.|e_{\theta}(s)^{\top}d|\leq\|e_{\theta}(s)\|_{2}\|d\|_{2}.
|∫t1eθ​(s)⊤​d​𝑑s|\displaystyle\left|\int_{t}^{1}e_{\theta}(s)^{\top}d\,ds\right| ≤‖d‖2​∫t1‖eθ​(s)‖2​𝑑s\displaystyle\leq\|d\|_{2}\int_{t}^{1}\|e_{\theta}(s)\|_{2}\,ds
≤‖d‖2​(∫t11​𝑑s)1/2​(∫t1‖eθ​(s)‖22​𝑑s)1/2\displaystyle\leq\|d\|_{2}\left(\int_{t}^{1}1\,ds\right)^{1/2}\left(\int_{t}^{1}\|e_{\theta}(s)\|_{2}^{2}\,ds\right)^{1/2}
=‖d‖2​1−t​(∫t1‖eθ​(s)‖22​𝑑s)1/2.\displaystyle=\|d\|_{2}\sqrt{1-t}\left(\int_{t}^{1}\|e_{\theta}(s)\|_{2}^{2}\,ds\right)^{1/2}.

C.3 Stationary Representation of the Bridge Target

Write the bridge coefficient as α(T)=c(T)/(1−T), and compare actions with their condition-dependent mean. A radial scale λ(radius,z) approximates α without receiving time. Conditional expectation minimizes its weighted squared error; integrating −rλ(r) constructs a conservative witness. Orthogonality, Jensen and Minkowski yield excess risk bounded by the squared sum of action dispersion, scale-recovery error and energy-class approximation error. Exact representation requires concentrated conditional actions, zero residual scale uncertainty and a class containing the witness. This sufficient single-basin construction neither diagnoses those conditions empirically nor excludes multimodal energies.

Equations 22–48
X:=ε+T⁡(A−ε),Y:=c⁡(T)​(A−ε).X:=\varepsilon+T(A-\varepsilon),\qquad Y:=c(T)(A-\varepsilon).
α⁡(T):=c⁡(T)1−T.\alpha(T):=\frac{c(T)}{1-T}. (22)
A−X=A−ε−T⁡(A−ε)=(1−T)​(A−ε),A-X=A-\varepsilon-T(A-\varepsilon)=(1-T)(A-\varepsilon),
Y=α⁡(T)​(A−X)almost surely.Y=\alpha(T)(A-X)\qquad\text{almost surely}. (23)
𝔼​‖A‖22<∞,\mathbb{E}\|A\|_{2}^{2}<\infty,
a⋆​(Z):=𝔼​[A∣Z].a_{\star}(Z):=\mathbb{E}[A\mid Z]. (24)
RX:=‖X−a⋆​(Z)‖2.R_{X}:=\|X-a_{\star}(Z)\|_{2}. (25)
λ:𝒵×[0,∞)→[0,∞),\lambda:\mathcal{Z}\times[0,\infty)\to[0,\infty),
λz​(r):=λ⁡(z,r),\lambda_{z}(r):=\lambda(z,r),
σact2\displaystyle\sigma_{\mathrm{act}}^{2} :=1D​𝔼​[α​(T)2​‖A−a⋆​(Z)‖22],\displaystyle:=\frac{1}{D}\mathbb{E}\left[\alpha(T)^{2}\|A-a_{\star}(Z)\|_{2}^{2}\right], (26)
σscale2​(λ)\displaystyle\sigma_{\mathrm{scale}}^{2}(\lambda) :=1D​𝔼​[(α⁡(T)−λZ​(RX))2​RX2].\displaystyle:=\frac{1}{D}\mathbb{E}\left[\bigl(\alpha(T)-\lambda_{Z}(R_{X})\bigr)^{2}R_{X}^{2}\right]. (27)
D​σact2=𝔼⁡[α​(T)2]​𝔼​‖A−a⋆​(Z)‖22D\sigma_{\mathrm{act}}^{2}=\mathbb{E}[\alpha(T)^{2}]\,\mathbb{E}\|A-a_{\star}(Z)\|_{2}^{2} (28)
𝔼⁡[(α⁡(T)−λZ​(RX))2​RX2]\mathbb{E}\left[\bigl(\alpha(T)-\lambda_{Z}(R_{X})\bigr)^{2}R_{X}^{2}\right]
λz⋆(r):=𝔼[α(T)∣RX=r,Z=z].\lambda_{z}^{\star}(r):=\mathbb{E}\left[\alpha(T)\mid R_{X}=r,Z=z\right]. (29)
𝔼[(α(T)−ℓ)2RX2∣RX=r,Z=z]\displaystyle\mathbb{E}\left[\bigl(\alpha(T)-\ell\bigr)^{2}R_{X}^{2}\mid R_{X}=r,Z=z\right]
=r2𝔼[(α(T)−ℓ)2∣RX=r,Z=z].\displaystyle\hskip 56.9055pt=r^{2}\mathbb{E}\left[\bigl(\alpha(T)-\ell\bigr)^{2}\mid R_{X}=r,Z=z\right].
ℓ=𝔼[α(T)∣RX=r,Z=z].\ell=\mathbb{E}\left[\alpha(T)\mid R_{X}=r,Z=z\right].
Eλ(x,z):=−∫0‖x−a⋆​(z)‖2sλz(s)ds.E_{\lambda}(x,z):=-\int_{0}^{\|x-a_{\star}(z)\|_{2}}s\lambda_{z}(s)\,ds. (30)
∇xEλ​(x,z)=λz​(‖x−a⋆​(z)‖2)​(a⋆​(z)−x).\nabla_{x}E_{\lambda}(x,z)=\lambda_{z}(\|x-a_{\star}(z)\|_{2})\bigl(a_{\star}(z)-x\bigr). (31)
r⁡(x):=‖x−a⋆​(z)‖2.r(x):=\|x-a_{\star}(z)\|_{2}.
∇xEλ​(x,z)\displaystyle\nabla_{x}E_{\lambda}(x,z) =−r⁡(x)​λz​(r⁡(x))​∇xr​(x)\displaystyle=-r(x)\lambda_{z}(r(x))\nabla_{x}r(x)
=−r⁡(x)​λz​(r⁡(x))​x−a⋆​(z)r⁡(x)\displaystyle=-r(x)\lambda_{z}(r(x))\frac{x-a_{\star}(z)}{r(x)}
=λz​(r⁡(x))​(a⋆​(z)−x).\displaystyle=\lambda_{z}(r(x))(a_{\star}(z)-x).
|Eλ​(a⋆​(z)+h,z)−Eλ​(a⋆​(z),z)|\displaystyle\left|E_{\lambda}(a_{\star}(z)+h,z)-E_{\lambda}(a_{\star}(z),z)\right| =|∫0‖h‖2s​λz​(s)​𝑑s|\displaystyle=\left|\int_{0}^{\|h\|_{2}}s\lambda_{z}(s)\,ds\right|
≤M2​‖h‖22\displaystyle\leq\frac{M}{2}\|h\|_{2}^{2}
=o⁡(‖h‖2).\displaystyle=o(\|h\|_{2}).
∇xEλ​(a⋆​(z),z)=0,\nabla_{x}E_{\lambda}(a_{\star}(z),z)=0,
gλ​(x,z):=∇xEλ​(x,z)g_{\lambda}(x,z):=\nabla_{x}E_{\lambda}(x,z)
h:ℝD×[0,1]×𝒵→ℝD,h:\mathbb{R}^{D}\times[0,1]\times\mathcal{Z}\to\mathbb{R}^{D},
R⁡(h):=1D​𝔼​[‖Y−h⁡(X,T,Z)‖22].R(h):=\frac{1}{D}\mathbb{E}\left[\|Y-h(X,T,Z)\|_{2}^{2}\right]. (32)
mtc(X,T,Z):=𝔼[Y∣X,T,Z],m_{\mathrm{tc}}(X,T,Z):=\mathbb{E}[Y\mid X,T,Z], (33)
Rtc⋆:=R⁡(mtc).R_{\mathrm{tc}}^{\star}:=R(m_{\mathrm{tc}}). (34)
Rst⋆:=infh:h=h⁡(X,Z)1D𝔼[∥Y−h(X,Z)∥22].R_{\mathrm{st}}^{\star}:=\inf_{h:\,h=h(X,Z)}\frac{1}{D}\mathbb{E}\left[\|Y-h(X,Z)\|_{2}^{2}\right]. (35)
ℰΘ:={Eθ:θ∈Θ},\mathcal{E}_{\Theta}:=\{E_{\theta}:\theta\in\Theta\},
REqCΘ:=infθ∈Θ1D​𝔼​[‖Y−∇xEθ​(X,Z)‖22].R_{\mathrm{EqC}}^{\Theta}:=\inf_{\theta\in\Theta}\frac{1}{D}\mathbb{E}\left[\|Y-\nabla_{x}E_{\theta}(X,Z)\|_{2}^{2}\right]. (36)
δΘ​(λ):=infθ∈Θ(1D​𝔼​[‖∇xEθ​(X,Z)−gλ​(X,Z)‖22])1/2.\delta_{\Theta}(\lambda):=\inf_{\theta\in\Theta}\left(\frac{1}{D}\mathbb{E}\left[\left\|\nabla_{x}E_{\theta}(X,Z)-g_{\lambda}(X,Z)\right\|_{2}^{2}\right]\right)^{1/2}. (37)
σact<∞,σscale​(λ)<∞,δΘ​(λ)<∞.\sigma_{\mathrm{act}}<\infty,\qquad\sigma_{\mathrm{scale}}(\lambda)<\infty,\qquad\delta_{\Theta}(\lambda)<\infty.
0≤REqCΘ−Rst⋆≤REqCΘ−Rtc⋆≤(σact+σscale​(λ)+δΘ​(λ))2.0\leq R_{\mathrm{EqC}}^{\Theta}-R_{\mathrm{st}}^{\star}\leq R_{\mathrm{EqC}}^{\Theta}-R_{\mathrm{tc}}^{\star}\leq\left(\sigma_{\mathrm{act}}+\sigma_{\mathrm{scale}}(\lambda)+\delta_{\Theta}(\lambda)\right)^{2}. (38)
‖W‖LD2:=(1D​𝔼​‖W‖22)1/2.\|W\|_{L_{D}^{2}}:=\left(\frac{1}{D}\mathbb{E}\|W\|_{2}^{2}\right)^{1/2}.
R⁡(h)−Rtc⋆=‖h−mtc‖LD22.R(h)-R_{\mathrm{tc}}^{\star}=\|h-m_{\mathrm{tc}}\|_{L_{D}^{2}}^{2}. (39)
‖Y−h‖LD22\displaystyle\|Y-h\|_{L_{D}^{2}}^{2} =‖Y−mtc+mtc−h‖LD22\displaystyle=\|Y-m_{\mathrm{tc}}+m_{\mathrm{tc}}-h\|_{L_{D}^{2}}^{2}
=‖Y−mtc‖LD22+‖mtc−h‖LD22,\displaystyle=\|Y-m_{\mathrm{tc}}\|_{L_{D}^{2}}^{2}+\|m_{\mathrm{tc}}-h\|_{L_{D}^{2}}^{2},
𝔼⁡[(Y−mtc)⊤​(mtc−h)]=0.\mathbb{E}\left[(Y-m_{\mathrm{tc}})^{\top}(m_{\mathrm{tc}}-h)\right]=0.
‖mtc−gλ‖LD2\displaystyle\|m_{\mathrm{tc}}-g_{\lambda}\|_{L_{D}^{2}} =‖𝔼[Y−gλ(X,Z)∣X,T,Z]‖LD2\displaystyle=\left\|\mathbb{E}\left[Y-g_{\lambda}(X,Z)\mid X,T,Z\right]\right\|_{L_{D}^{2}}
≤‖Y−gλ​(X,Z)‖LD2,\displaystyle\leq\|Y-g_{\lambda}(X,Z)\|_{L_{D}^{2}}, (40)
Y−gλ​(X,Z)\displaystyle Y-g_{\lambda}(X,Z) =α⁡(T)​(A−X)−λZ​(RX)​(a⋆​(Z)−X)\displaystyle=\alpha(T)(A-X)-\lambda_{Z}(R_{X})(a_{\star}(Z)-X)
=α⁡(T)​(A−a⋆​(Z))+(α⁡(T)−λZ​(RX))​(a⋆​(Z)−X).\displaystyle=\alpha(T)(A-a_{\star}(Z))+\bigl(\alpha(T)-\lambda_{Z}(R_{X})\bigr)(a_{\star}(Z)-X). (41)
‖Y−gλ​(X,Z)‖LD2\displaystyle\|Y-g_{\lambda}(X,Z)\|_{L_{D}^{2}} ≤‖α⁡(T)​(A−a⋆​(Z))‖LD2\displaystyle\leq\left\|\alpha(T)(A-a_{\star}(Z))\right\|_{L_{D}^{2}}
+‖(α⁡(T)−λZ​(RX))​(a⋆​(Z)−X)‖LD2\displaystyle\quad+\left\|\bigl(\alpha(T)-\lambda_{Z}(R_{X})\bigr)(a_{\star}(Z)-X)\right\|_{L_{D}^{2}}
=σact+σscale​(λ),\displaystyle=\sigma_{\mathrm{act}}+\sigma_{\mathrm{scale}}(\lambda),
‖a⋆​(Z)−X‖2=RX.\|a_{\star}(Z)-X\|_{2}=R_{X}.
‖mtc−gλ‖LD2≤σact+σscale​(λ).\|m_{\mathrm{tc}}-g_{\lambda}\|_{L_{D}^{2}}\leq\sigma_{\mathrm{act}}+\sigma_{\mathrm{scale}}(\lambda). (42)
‖mtc−∇xEθ‖LD2\displaystyle\|m_{\mathrm{tc}}-\nabla_{x}E_{\theta}\|_{L_{D}^{2}} ≤‖mtc−gλ‖LD2+‖gλ−∇xEθ‖LD2\displaystyle\leq\|m_{\mathrm{tc}}-g_{\lambda}\|_{L_{D}^{2}}+\|g_{\lambda}-\nabla_{x}E_{\theta}\|_{L_{D}^{2}}
≤σact+σscale​(λ)+‖gλ−∇xEθ‖LD2.\displaystyle\leq\sigma_{\mathrm{act}}+\sigma_{\mathrm{scale}}(\lambda)+\|g_{\lambda}-\nabla_{x}E_{\theta}\|_{L_{D}^{2}}.
infθ∈Θ‖mtc−∇xEθ‖LD2≤σact+σscale​(λ)+δΘ​(λ).\inf_{\theta\in\Theta}\|m_{\mathrm{tc}}-\nabla_{x}E_{\theta}\|_{L_{D}^{2}}\leq\sigma_{\mathrm{act}}+\sigma_{\mathrm{scale}}(\lambda)+\delta_{\Theta}(\lambda).
REqCΘ−Rtc⋆=infθ∈Θ‖mtc−∇xEθ‖LD22.R_{\mathrm{EqC}}^{\Theta}-R_{\mathrm{tc}}^{\star}=\inf_{\theta\in\Theta}\|m_{\mathrm{tc}}-\nabla_{x}E_{\theta}\|_{L_{D}^{2}}^{2}.
REqCΘ−Rtc⋆≤(σact+σscale​(λ)+δΘ​(λ))2.R_{\mathrm{EqC}}^{\Theta}-R_{\mathrm{tc}}^{\star}\leq\left(\sigma_{\mathrm{act}}+\sigma_{\mathrm{scale}}(\lambda)+\delta_{\Theta}(\lambda)\right)^{2}.
Rst⋆≤REqCΘ.R_{\mathrm{st}}^{\star}\leq R_{\mathrm{EqC}}^{\Theta}.
Rtc⋆≤Rst⋆.R_{\mathrm{tc}}^{\star}\leq R_{\mathrm{st}}^{\star}.
A=a⋆​(Z)\displaystyle A=a_{\star}(Z) almost surely,\displaystyle\text{almost surely}, (43)
Var⁡(α⁡(T)∣RX,Z)=0\displaystyle\operatorname{Var}\!\left(\alpha(T)\mid R_{X},Z\right)=0 almost surely.\displaystyle\text{almost surely}. (44)
λz(r):=𝔼[α(T)∣RX=r,Z=z]\lambda_{z}(r):=\mathbb{E}\left[\alpha(T)\mid R_{X}=r,Z=z\right]
∇xEθ⋆​(x,z)=λz​(‖x−a⋆​(z)‖2)​(a⋆​(z)−x)\nabla_{x}E_{\theta_{\star}}(x,z)=\lambda_{z}(\|x-a_{\star}(z)\|_{2})\bigl(a_{\star}(z)-x\bigr) (45)
∇xEθ⋆​(X,Z)=Yalmost surely.\nabla_{x}E_{\theta_{\star}}(X,Z)=Y\qquad\text{almost surely}. (46)
REqCΘ=Rst⋆=Rtc⋆=0.R_{\mathrm{EqC}}^{\Theta}=R_{\mathrm{st}}^{\star}=R_{\mathrm{tc}}^{\star}=0. (47)
α(T)=𝔼[α(T)∣RX,Z]=λZ(RX)almost surely.\alpha(T)=\mathbb{E}\left[\alpha(T)\mid R_{X},Z\right]=\lambda_{Z}(R_{X})\qquad\text{almost surely}.
Y\displaystyle Y =α​(T)​(A−X)\displaystyle=\alpha(T)(A-X)
=λZ​(RX)​(a⋆​(Z)−X).\displaystyle=\lambda_{Z}(R_{X})(a_{\star}(Z)-X).
λZ​(RX)​(a⋆​(Z)−X)=∇xEθ⋆​(X,Z).\lambda_{Z}(R_{X})(a_{\star}(Z)-X)=\nabla_{x}E_{\theta_{\star}}(X,Z).
Y=∇xEθ⋆​(X,Z)Y=\nabla_{x}E_{\theta_{\star}}(X,Z)
RX=(1−T)​‖ε−a⋆​(Z)‖2.R_{X}=(1-T)\|\varepsilon-a_{\star}(Z)\|_{2}. (48)

C.4 Monotone Energy Ascent

If the gradient is locally L-Lipschitz along each update segment and 0<η<2/L, exact ascent increases E by at least η(1−Lη/2)‖∇E‖². Summing gives a bound on the smallest observed gradient norm; a bounded-above energy supplies a finite-step stationarity estimate. The guarantee concerns the learned scalar and assumed step sizes, not global optimization, task reward, or physical stability.

Equations 49–55
‖∇xEθ​(x,z)−∇xEθ​(y,z)‖2≤L​‖x−y‖2\left\|\nabla_{x}E_{\theta}(x,z)-\nabla_{x}E_{\theta}(y,z)\right\|_{2}\leq L\|x-y\|_{2} (49)
[x(k),x(k+1)]:={x(k)+s⁡(x(k+1)−x(k)):s∈[0,1]}.[x^{(k)},x^{(k+1)}]:=\left\{x^{(k)}+s(x^{(k+1)}-x^{(k)}):s\in[0,1]\right\}.
x(k+1)=x(k)+ηk​∇xEθ​(x(k),z)x^{(k+1)}=x^{(k)}+\eta_{k}\nabla_{x}E_{\theta}(x^{(k)},z)
0<ηk<2L.0<\eta_{k}<\frac{2}{L}. (50)
Eθ​(x(k+1),z)−Eθ​(x(k),z)≥wk​‖∇xEθ​(x(k),z)‖22,E_{\theta}(x^{(k+1)},z)-E_{\theta}(x^{(k)},z)\geq w_{k}\left\|\nabla_{x}E_{\theta}(x^{(k)},z)\right\|_{2}^{2}, (51)
wk:=ηk​(1−L​ηk2)>0.w_{k}:=\eta_{k}\left(1-\frac{L\eta_{k}}{2}\right)>0. (52)
Eθ​(x(k+1),z)≥Eθ​(x(k),z),E_{\theta}(x^{(k+1)},z)\geq E_{\theta}(x^{(k)},z),
∇xEθ​(x(k),z)≠0.\nabla_{x}E_{\theta}(x^{(k)},z)\neq 0.
gk:=∇xEθ​(x(k),z).g_{k}:=\nabla_{x}E_{\theta}(x^{(k)},z).
x(k+1)=x(k)+ηk​gk.x^{(k+1)}=x^{(k)}+\eta_{k}g_{k}.
qk​(s):=x(k)+s​ηk​gk,s∈[0,1].q_{k}(s):=x^{(k)}+s\eta_{k}g_{k},\qquad s\in[0,1].
Eθ​(x(k+1),z)−Eθ​(x(k),z)\displaystyle E_{\theta}(x^{(k+1)},z)-E_{\theta}(x^{(k)},z) =∫01∇xEθ​(qk​(s),z)⊤​(ηk​gk)​𝑑s\displaystyle=\int_{0}^{1}\nabla_{x}E_{\theta}(q_{k}(s),z)^{\top}(\eta_{k}g_{k})\,ds
=ηk​‖gk‖22+ηk​∫01(∇xEθ​(qk​(s),z)−gk)⊤​gk​𝑑s.\displaystyle=\eta_{k}\|g_{k}\|_{2}^{2}+\eta_{k}\int_{0}^{1}\left(\nabla_{x}E_{\theta}(q_{k}(s),z)-g_{k}\right)^{\top}g_{k}\,ds. (53)
(∇xEθ​(qk​(s),z)−gk)⊤​gk\displaystyle\left(\nabla_{x}E_{\theta}(q_{k}(s),z)-g_{k}\right)^{\top}g_{k} ≥−‖∇xEθ​(qk​(s),z)−gk‖2​‖gk‖2\displaystyle\geq-\left\|\nabla_{x}E_{\theta}(q_{k}(s),z)-g_{k}\right\|_{2}\|g_{k}\|_{2}
≥−L​‖qk​(s)−x(k)‖2​‖gk‖2\displaystyle\geq-L\|q_{k}(s)-x^{(k)}\|_{2}\|g_{k}\|_{2}
=−L​s​ηk​‖gk‖22.\displaystyle=-Ls\eta_{k}\|g_{k}\|_{2}^{2}.
Eθ​(x(k+1),z)−Eθ​(x(k),z)\displaystyle E_{\theta}(x^{(k+1)},z)-E_{\theta}(x^{(k)},z) ≥ηk​‖gk‖22−L​ηk2​‖gk‖22​∫01s​𝑑s\displaystyle\geq\eta_{k}\|g_{k}\|_{2}^{2}-L\eta_{k}^{2}\|g_{k}\|_{2}^{2}\int_{0}^{1}s\,ds
=ηk​(1−L​ηk2)​‖gk‖22\displaystyle=\eta_{k}\left(1-\frac{L\eta_{k}}{2}\right)\|g_{k}\|_{2}^{2}
=wk​‖gk‖22.\displaystyle=w_{k}\|g_{k}\|_{2}^{2}.
min0≤k<K⁡‖∇xEθ​(x(k),z)‖22≤Eθ​(x(K),z)−Eθ​(x(0),z)∑k=0K−1wk.\min_{0\leq k<K}\left\|\nabla_{x}E_{\theta}(x^{(k)},z)\right\|_{2}^{2}\leq\frac{E_{\theta}(x^{(K)},z)-E_{\theta}(x^{(0)},z)}{\sum_{k=0}^{K-1}w_{k}}. (54)
Eθ​(x(k),z)≤Esupfor ​k=0,…,K,E_{\theta}(x^{(k)},z)\leq E_{\sup}\qquad\text{for }k=0,\ldots,K,
min0≤k<K⁡‖∇xEθ​(x(k),z)‖22≤Esup−Eθ​(x(0),z)∑k=0K−1wk.\min_{0\leq k<K}\left\|\nabla_{x}E_{\theta}(x^{(k)},z)\right\|_{2}^{2}\leq\frac{E_{\sup}-E_{\theta}(x^{(0)},z)}{\sum_{k=0}^{K-1}w_{k}}. (55)
Eθ​(x(K),z)−Eθ​(x(0),z)\displaystyle E_{\theta}(x^{(K)},z)-E_{\theta}(x^{(0)},z) =∑k=0K−1(Eθ​(x(k+1),z)−Eθ​(x(k),z))\displaystyle=\sum_{k=0}^{K-1}\left(E_{\theta}(x^{(k+1)},z)-E_{\theta}(x^{(k)},z)\right)
≥∑k=0K−1wk​‖∇xEθ​(x(k),z)‖22\displaystyle\geq\sum_{k=0}^{K-1}w_{k}\left\|\nabla_{x}E_{\theta}(x^{(k)},z)\right\|_{2}^{2}
≥(min0≤k<K⁡‖∇xEθ​(x(k),z)‖22)​∑k=0K−1wk.\displaystyle\geq\left(\min_{0\leq k<K}\left\|\nabla_{x}E_{\theta}(x^{(k)},z)\right\|_{2}^{2}\right)\sum_{k=0}^{K-1}w_{k}.
Eθ​(x(K),z)≤Esup.E_{\theta}(x^{(K)},z)\leq E_{\sup}.

C.5 Energy Consistency as a Path-Wise Mismatch Certificate

Project each iterate onto the initial-to-final chord. The residual decomposes into integrated longitudinal field mismatch, an energy difference from off-chord motion, and a correction from flooring the squared chord norm. A bound on off-chord gradients sandwiches the observed score around mean integrated mismatch with explicit correction terms. When the floor is inactive and all iterates lie on the chord, equality gives the clean mismatch interpretation. Absolute averaging prevents cancellation between iterates, but not within each remaining-work integral; endpoint self-anchoring can still validate an incorrect path.

Equations 56–73
x^:=x(K),v:=x^−x(0).\hat{x}:=x^{(K)},\qquad v:=\hat{x}-x^{(0)}.
Dv:=max⁡(‖v‖22,δ),γv:=‖v‖22Dv.D_{v}:=\max(\|v\|_{2}^{2},\delta),\qquad\gamma_{v}:=\frac{\|v\|_{2}^{2}}{D_{v}}. (56)
clip⁡(u,0,1):=min⁡{1,max⁡{0,u}}.\operatorname{clip}(u,0,1):=\min\{1,\max\{0,u\}\}.
τk:=clip⁡(⟨x(k)−x(0),v⟩Dv,0,1).\tau_{k}:=\operatorname{clip}\left(\frac{\langle x^{(k)}-x^{(0)},v\rangle}{D_{v}},0,1\right). (57)
x¯(k):=x(0)+τk​v,\bar{x}^{(k)}:=x^{(0)}+\tau_{k}v, (58)
hk:=x(k)−x¯(k).h_{k}:=x^{(k)}-\bar{x}^{(k)}. (59)
ev​(s):=∇xEθ​(x(0)+s​v,z)−c⁡(s)​v,s∈[0,1].e_{v}(s):=\nabla_{x}E_{\theta}(x^{(0)}+sv,z)-c(s)v,\qquad s\in[0,1]. (60)
rkΔ​E:=Eθ​(x^,z)−Eθ​(x(k),z)Dv−C⁡(τk),r_{k}^{\Delta E}:=\frac{E_{\theta}(\hat{x},z)-E_{\theta}(x^{(k)},z)}{D_{v}}-C(\tau_{k}), (61)
UΔ​E:=1K​∑k=1K|rkΔ​E|.U_{\Delta E}:=\frac{1}{K}\sum_{k=1}^{K}|r_{k}^{\Delta E}|. (62)
{x(0)+s​v:s∈[0,1]}.\{x^{(0)}+sv:s\in[0,1]\}.
rkΔ​E=1Dv​∫τk1ev​(s)⊤​v​𝑑s+Eθ​(x¯(k),z)−Eθ​(x(k),z)Dv+(γv−1)​C​(τk).r_{k}^{\Delta E}=\frac{1}{D_{v}}\int_{\tau_{k}}^{1}e_{v}(s)^{\top}v\,ds+\frac{E_{\theta}(\bar{x}^{(k)},z)-E_{\theta}(x^{(k)},z)}{D_{v}}+(\gamma_{v}-1)C(\tau_{k}). (63)
q⁡(s):=x(0)+s​v.q(s):=x^{(0)}+sv.
q⁡(τk)=x¯(k),q⁡(1)=x^,d​q​(s)d​s=v,q(\tau_{k})=\bar{x}^{(k)},\qquad q(1)=\hat{x},\qquad\frac{dq(s)}{ds}=v,
Eθ​(x^,z)−Eθ​(x¯(k),z)\displaystyle E_{\theta}(\hat{x},z)-E_{\theta}(\bar{x}^{(k)},z) =∫τk1∇xEθ​(q⁡(s),z)⊤​v​𝑑s\displaystyle=\int_{\tau_{k}}^{1}\nabla_{x}E_{\theta}(q(s),z)^{\top}v\,ds
=∫τk1(c⁡(s)​v+ev​(s))⊤​v​𝑑s\displaystyle=\int_{\tau_{k}}^{1}\bigl(c(s)v+e_{v}(s)\bigr)^{\top}v\,ds
=‖v‖22​∫τk1c⁡(s)​𝑑s+∫τk1ev​(s)⊤​v​𝑑s\displaystyle=\|v\|_{2}^{2}\int_{\tau_{k}}^{1}c(s)\,ds+\int_{\tau_{k}}^{1}e_{v}(s)^{\top}v\,ds
=‖v‖22​C​(τk)+∫τk1ev​(s)⊤​v​𝑑s.\displaystyle=\|v\|_{2}^{2}C(\tau_{k})+\int_{\tau_{k}}^{1}e_{v}(s)^{\top}v\,ds.
Eθ​(x¯(k),z)−Eθ​(x(k),z)E_{\theta}(\bar{x}^{(k)},z)-E_{\theta}(x^{(k)},z)
Eθ​(x^,z)−Eθ​(x(k),z)\displaystyle E_{\theta}(\hat{x},z)-E_{\theta}(x^{(k)},z) =‖v‖22​C​(τk)+∫τk1ev​(s)⊤​v​𝑑s\displaystyle=\|v\|_{2}^{2}C(\tau_{k})+\int_{\tau_{k}}^{1}e_{v}(s)^{\top}v\,ds
+Eθ​(x¯(k),z)−Eθ​(x(k),z).\displaystyle\quad+E_{\theta}(\bar{x}^{(k)},z)-E_{\theta}(x^{(k)},z).
rkΔ​E\displaystyle r_{k}^{\Delta E} =1Dv​∫τk1ev​(s)⊤​v​𝑑s\displaystyle=\frac{1}{D_{v}}\int_{\tau_{k}}^{1}e_{v}(s)^{\top}v\,ds
+Eθ​(x¯(k),z)−Eθ​(x(k),z)Dv\displaystyle\quad+\frac{E_{\theta}(\bar{x}^{(k)},z)-E_{\theta}(x^{(k)},z)}{D_{v}}
+(‖v‖22Dv−1)​C​(τk).\displaystyle\quad+\left(\frac{\|v\|_{2}^{2}}{D_{v}}-1\right)C(\tau_{k}).
γv=‖v‖22Dv\gamma_{v}=\frac{\|v\|_{2}^{2}}{D_{v}}
AK:=1K​Dv​∑k=1K|∫τk1ev​(s)⊤​v​𝑑s|.A_{K}:=\frac{1}{KD_{v}}\sum_{k=1}^{K}\left|\int_{\tau_{k}}^{1}e_{v}(s)^{\top}v\,ds\right|. (64)
‖∇xEθ​(y,z)‖2≤G\|\nabla_{x}E_{\theta}(y,z)\|_{2}\leq G
[x(k),x¯(k)],k=1,…,K.[x^{(k)},\bar{x}^{(k)}],\qquad k=1,\ldots,K.
BK:=GK​Dv​∑k=1K‖hk‖2+|γv−1|K​∑k=1K|C⁡(τk)|.B_{K}:=\frac{G}{KD_{v}}\sum_{k=1}^{K}\|h_{k}\|_{2}+\frac{|\gamma_{v}-1|}{K}\sum_{k=1}^{K}|C(\tau_{k})|. (65)
[AK−BK]+≤UΔ​E≤AK+BK,[A_{K}-B_{K}]_{+}\leq U_{\Delta E}\leq A_{K}+B_{K}, (66)
[q]+:=max⁡(q,0).[q]_{+}:=\max(q,0).
AK≤‖v‖2K​Dv​∫01NK​(s)​‖ev​(s)‖2​𝑑s,A_{K}\leq\frac{\|v\|_{2}}{KD_{v}}\int_{0}^{1}N_{K}(s)\|e_{v}(s)\|_{2}\,ds, (67)
NK(s):=∑k=1K𝟏{τk≤s}.N_{K}(s):=\sum_{k=1}^{K}\mathbf{1}\{\tau_{k}\leq s\}. (68)
ak\displaystyle a_{k} :=1Dv​∫τk1ev​(s)⊤​v​𝑑s,\displaystyle:=\frac{1}{D_{v}}\int_{\tau_{k}}^{1}e_{v}(s)^{\top}v\,ds,
bk\displaystyle b_{k} :=Eθ​(x¯(k),z)−Eθ​(x(k),z)Dv,\displaystyle:=\frac{E_{\theta}(\bar{x}^{(k)},z)-E_{\theta}(x^{(k)},z)}{D_{v}},
qk\displaystyle q_{k} :=(γv−1)​C​(τk).\displaystyle:=(\gamma_{v}-1)C(\tau_{k}).
rkΔ​E=ak+bk+qk.r_{k}^{\Delta E}=a_{k}+b_{k}+q_{k}.
|ak|−|bk|−|qk|≤|rkΔ​E|≤|ak|+|bk|+|qk|.|a_{k}|-|b_{k}|-|q_{k}|\leq|r_{k}^{\Delta E}|\leq|a_{k}|+|b_{k}|+|q_{k}|. (69)
|Eθ​(x¯(k),z)−Eθ​(x(k),z)|\displaystyle\left|E_{\theta}(\bar{x}^{(k)},z)-E_{\theta}(x^{(k)},z)\right|
≤supy∈[x(k),x¯(k)]‖∇xEθ​(y,z)‖2​‖x¯(k)−x(k)‖2\displaystyle\quad\leq\sup_{y\in[x^{(k)},\bar{x}^{(k)}]}\|\nabla_{x}E_{\theta}(y,z)\|_{2}\,\|\bar{x}^{(k)}-x^{(k)}\|_{2}
≤G​‖hk‖2.\displaystyle\quad\leq G\|h_{k}\|_{2}.
|bk|≤GDv​‖hk‖2,|qk|=|γv−1|​|C⁡(τk)|.|b_{k}|\leq\frac{G}{D_{v}}\|h_{k}\|_{2},\qquad|q_{k}|=|\gamma_{v}-1|\,|C(\tau_{k})|.
AK−BK≤UΔ​E≤AK+BK.A_{K}-B_{K}\leq U_{\Delta E}\leq A_{K}+B_{K}.
|ev​(s)⊤​v|≤‖ev​(s)‖2​‖v‖2.|e_{v}(s)^{\top}v|\leq\|e_{v}(s)\|_{2}\|v\|_{2}.
AK\displaystyle A_{K} ≤‖v‖2K​Dv​∑k=1K∫τk1‖ev​(s)‖2​𝑑s\displaystyle\leq\frac{\|v\|_{2}}{KD_{v}}\sum_{k=1}^{K}\int_{\tau_{k}}^{1}\|e_{v}(s)\|_{2}\,ds
=‖v‖2K​Dv∫01(∑k=1K𝟏{τk≤s})∥ev(s)∥2ds\displaystyle=\frac{\|v\|_{2}}{KD_{v}}\int_{0}^{1}\left(\sum_{k=1}^{K}\mathbf{1}\{\tau_{k}\leq s\}\right)\|e_{v}(s)\|_{2}\,ds
=‖v‖2K​Dv​∫01NK​(s)​‖ev​(s)‖2​𝑑s.\displaystyle=\frac{\|v\|_{2}}{KD_{v}}\int_{0}^{1}N_{K}(s)\|e_{v}(s)\|_{2}\,ds.
Dv=‖v‖22,D_{v}=\|v\|_{2}^{2}, (70)
x(k)=x¯(k),k=1,…,K.x^{(k)}=\bar{x}^{(k)},\qquad k=1,\ldots,K. (71)
UΔ​E=1K​‖v‖22​∑k=1K|∫τk1ev​(s)⊤​v​𝑑s|.U_{\Delta E}=\frac{1}{K\|v\|_{2}^{2}}\sum_{k=1}^{K}\left|\int_{\tau_{k}}^{1}e_{v}(s)^{\top}v\,ds\right|. (72)
1K​‖v‖22​|∫01NK​(s)​ev​(s)⊤​v​𝑑s|≤UΔ​E≤1K​‖v‖2​∫01NK​(s)​‖ev​(s)‖2​𝑑s.\frac{1}{K\|v\|_{2}^{2}}\left|\int_{0}^{1}N_{K}(s)e_{v}(s)^{\top}v\,ds\right|\leq U_{\Delta E}\leq\frac{1}{K\|v\|_{2}}\int_{0}^{1}N_{K}(s)\|e_{v}(s)\|_{2}\,ds. (73)
γv=1.\gamma_{v}=1.
Eθ​(x¯(k),z)−Eθ​(x(k),z)=0.E_{\theta}(\bar{x}^{(k)},z)-E_{\theta}(x^{(k)},z)=0.
rkΔ​E=1‖v‖22​∫τk1ev​(s)⊤​v​𝑑s.r_{k}^{\Delta E}=\frac{1}{\|v\|_{2}^{2}}\int_{\tau_{k}}^{1}e_{v}(s)^{\top}v\,ds.
∫01NK​(s)​ev​(s)⊤​v​𝑑s\displaystyle\int_{0}^{1}N_{K}(s)e_{v}(s)^{\top}v\,ds =∫01∑k=1K𝟏{τk≤s}ev(s)⊤vds\displaystyle=\int_{0}^{1}\sum_{k=1}^{K}\mathbf{1}\{\tau_{k}\leq s\}e_{v}(s)^{\top}v\,ds
=∑k=1K∫τk1ev​(s)⊤​v​𝑑s.\displaystyle=\sum_{k=1}^{K}\int_{\tau_{k}}^{1}e_{v}(s)^{\top}v\,ds.
|∫01NK​(s)​ev​(s)⊤​v​𝑑s|≤∑k=1K|∫τk1ev​(s)⊤​v​𝑑s|.\left|\int_{0}^{1}N_{K}(s)e_{v}(s)^{\top}v\,ds\right|\leq\sum_{k=1}^{K}\left|\int_{\tau_{k}}^{1}e_{v}(s)^{\top}v\,ds\right|.
UΔ​E\displaystyle U_{\Delta E} =1K​‖v‖22​∑k=1K|∫τk1ev​(s)⊤​v​𝑑s|\displaystyle=\frac{1}{K\|v\|_{2}^{2}}\sum_{k=1}^{K}\left|\int_{\tau_{k}}^{1}e_{v}(s)^{\top}v\,ds\right|
≤1K​‖v‖2​∑k=1K∫τk1‖ev​(s)‖2​𝑑s\displaystyle\leq\frac{1}{K\|v\|_{2}}\sum_{k=1}^{K}\int_{\tau_{k}}^{1}\|e_{v}(s)\|_{2}\,ds
=1K​‖v‖2​∫01NK​(s)​‖ev​(s)‖2​𝑑s.\displaystyle=\frac{1}{K\|v\|_{2}}\int_{0}^{1}N_{K}(s)\|e_{v}(s)\|_{2}\,ds.

C.6 Scope of the auxiliary analysis

The paper explicitly limits the claims: conditional concentration is motivated, not measured or proved; the radial witness supplies an existence upper bound; energy ascent is not action correctness; and coherent wrong trajectories can have small scores. Short chords activate the normalization correction. These limits prevent interpreting the score as a calibrated probability or safety certificate.

Appendix D Real-Robot Experimental Setup and Evaluation Protocol

Physical evaluation uses one bimanual Galaxea setup, explicit completion criteria and matched collection schedules for intervention comparisons. Task definitions and budgets are retained in full original tables.

D.1 Platform and Hardware Architecture

Two six-axis A1Z arms with parallel grippers provide 14 active control channels. Three synchronized RGB cameras and 14-dimensional proprioception condition G0.5. Control runs at 15 Hz with 32-step action chunks. The platform-specific demonstration and inference settings constrain transfer claims.

D.2 Task Specifications and Success Criteria

Six tasks separate initial control evaluation, failure detection, lifelong learning and cross-task transfer. Success requires completion and stable release, not merely reaching an intermediate visual state.

Benchmark 1: Flower Insertion.

Flower insertion requires grasping/reorienting a flexible stem, aligning it with the vase opening, fully inserting it and releasing without tipping or disturbing the upright vase.

Benchmark 2: Towel Folding.

Towel folding requires lateral folding, reorientation, longitudinal folding and release. Both folds must leave roughly a quarter-size footprint with aligned edges, stable after release without unfolding or flipping.

Benchmark 3: Debris Sweeping.

Sweeping requires coordinated brush/dustpan use, collection of all scraps, transport and dumping into an upright bin. Dropped tools, residual debris or a tipped bin fail the task.

Benchmark 4: Hierarchical Block Stacking.

Block stacking fixes green as the base, places blue above it and red on top, then requires three seconds of unsupported stability. Nominal layouts span all six collinear color orders; disordered layouts vary 2D position and orientation. The paper mentions perturbed setups for initial failure but also nominal layouts in intervention-baseline/evaluation descriptions, so the exact layout mixture is not completely clear from the prose.

Benchmark 5: Garment Folding.

Garment folding folds both sleeves inward, folds the lower portion, makes a lateral fold and smooths the result. All stages must complete with a compact aligned shape and clean disengagement, without dragging or unfolding.

Benchmark 6: Hierarchical Cup Stacking (Cross-Task Shift).

Cup stacking introduces tapered cups with different contact geometry. Blue is placed upside down on a fixed green base, then orange above it; the final assembly must remain upright for three seconds after release. All six initial color orders are included.

D.3 Training Configurations and Computational Overhead

Physical policies start from G0.5 and use AdamW/cosine decay. Deployment takes only three ascent steps with sizes 0.12, 0.10 and 0.05, rather than the ten-step simulation detection setting. Table 15 lists batch 16, peak learning rate 8×10⁻⁵ and two epochs per lifelong update. Fixed schedules were tested empirically; the experiment does not measure a local Lipschitz bound proving each step meets the theorem.

Table 15: Unified training and inference hyperparameters for real-robot experiments.
Hyperparameter Value
Base VLA Backbone Galaxea G0.5
Optimizer AdamW
Batch Size 16
Peak Learning Rate 8×10−58\times 10^{-5}
Warmup Schedule Linear warmup (500 steps)
Decay Schedule Cosine decay (warmup_constant_cosine)
Action Chunk Horizon (TaT_{a}) 32
Control Frequency 15 Hz
EqC Refinement Steps (KK) 3
EqC Step Sizes (ηk\eta_{k}) [0.12,0.10,0.05][0.12,0.10,0.05]
Training Epochs (Flower Insertion) 6 epochs (82 demonstrations)
Training Epochs (Towel Folding) 4 epochs (36 demonstrations)
Training Epochs (Debris Sweeping) 4 epochs (142 demonstrations)
Training Epochs (Lifelong Learning) 2 epochs per update session

Wall-Clock Fine-Tuning Overhead.

Explicit-energy training takes 14.58 versus 11.58 minutes for flowers, 49.42 versus 40.48 for towels, and 135.47 versus 115.30 for sweeping: +25.9%, +22.1% and +17.5%. These task-specific timings include higher-order gradient costs and depend on the reported training hardware.

Table 16: Wall-clock fine-tuning time across real-robot tasks.
Method Time (min) Overhead
Flower Insertion  
Galaxea G0.5 11.58 —
Galaxea G0.5 + EqC (ours) 14.58 +25.9%
Towel Folding  
Galaxea G0.5 40.48 —
Galaxea G0.5 + EqC (ours) 49.42 +22.1%
Debris Sweeping  
Galaxea G0.5 115.30 —
Galaxea G0.5 + EqC (ours) 135.47 +17.5%

D.4 Energy-Gated DAgger Protocol

Each round collects six recoveries, appends them to all historical demonstrations, and independently retrains from the same initial checkpoint. Thus the learning loop is deployment followed by offline retraining, not continuous parameter updates during robot execution.

Initial Demonstration Dataset ( 𝒟 0 ).

Stacking starts with 18 nominal collinear demonstrations, three per color order; garment folding starts with 18 ordinary demonstrations. Initial autonomous success is 0% for stacking and 30% for garments in the reported evaluation.

Human Intervention Baseline.

Human-triggered DAgger uses experienced teleoperators, identical initial data and the same six-recovery-per-round budget: five stacking rounds or two garment rounds. Matching the collection and update schedules isolates the tested intervention strategy more closely than comparing arbitrary demonstration counts, while operator judgment and recovery quality remain part of the experiment.

Galaxea G0.5 + Diff-DAgger Baseline.

The automated G0.5+Diff-DAgger baseline uses ten re-noising samples per replan and persistent threshold crossings. It shares seed data, recovery budgets and fine-tuning settings, but its underlying policy objective and warning signal differ from EqC.

Active Deployment and Intervention Mechanism.

During a collection round, repeated score exceedances halt prefix execution and an expert completes the task from that state. Exactly six such recovery episodes are saved. This presumes an available expert and a recoverable intervention state; the detector does not itself synthesize a guaranteed recovery.

Iterative Fine-Tuning.

Cumulative data grow from 18 to 48 stacking episodes or 18 to 30 garment episodes. Each update restarts from the same initial checkpoint and trains two epochs on the accumulated set. Three independent end-to-end runs each receive 20 autonomous evaluation trials per checkpoint; Table 17 retains every run and mean/sample deviation.

Table 17: Detailed progressive success rates (%) across 3 independent lifelong learning runs on the physical Galaxea bimanual workstation (20 autonomous trials per checkpoint per run). Both individual run outcomes and summary statistics (Mean±Std\text{Mean}\pm\text{Std}) are reported across deployment rounds.

(a) Hierarchical Block Stacking (|𝒟0|=18→|𝒟5|=48|\mathcal{D}_{0}|=18\to|\mathcal{D}_{5}|=48)

Method Run R0 (18) R1 (24) R2 (30) R3 (36) R4 (42) R5 (48)
Human Intervention Run 1 0.0 0.0 5.0 15.0 20.0 50.0
Run 2 0.0 0.0 10.0 35.0 60.0 70.0
Run 3 0.0 0.0 0.0 20.0 45.0 55.0
Mean±\pmStd 0.0±0.00.0\pm 0.0 0.0±0.00.0\pm 0.0 5.0±5.05.0\pm 5.0 23.3±10.423.3\pm 10.4 41.7±20.241.7\pm 20.2 58.3±10.458.3\pm 10.4
Galaxea G0.5 + Diff-DAgger Run 1 0.0 0.0 20.0 60.0 70.0 90.0
Run 2 0.0 0.0 10.0 80.0 70.0 70.0
Run 3 0.0 0.0 5.0 35.0 50.0 80.0
Mean±\pmStd 0.0±0.00.0\pm 0.0 0.0±0.00.0\pm 0.0 11.7±7.611.7\pm 7.6 58.3±22.558.3\pm 22.5 63.3±11.563.3\pm 11.5 80.0±10.080.0\pm 10.0
EqC (ours) Run 1 0.0 0.0 25.0 60.0 50.0 100.0
Run 2 0.0 5.0 30.0 55.0 85.0 95.0
Run 3 0.0 0.0 30.0 70.0 80.0 95.0
Mean±\pmStd 0.0±0.0\mathbf{0.0\pm 0.0} 1.7±2.9\mathbf{1.7\pm 2.9} 28.3±2.9\mathbf{28.3\pm 2.9} 61.7±7.6\mathbf{61.7\pm 7.6} 71.7±18.9\mathbf{71.7\pm 18.9} 96.7±2.9\mathbf{96.7\pm 2.9}

(b) Garment Folding (|𝒟0|=18→|𝒟2|=30|\mathcal{D}_{0}|=18\to|\mathcal{D}_{2}|=30)

Method Run R0 (18) R1 (24) R2 (30)
Human Intervention Run 1 30.0 35.0 40.0
Run 2 30.0 40.0 65.0
Run 3 30.0 35.0 60.0
Mean±\pmStd 30.0±0.030.0\pm 0.0 36.7±2.936.7\pm 2.9 55.0±13.255.0\pm 13.2
Galaxea G0.5 + Diff-DAgger Run 1 25.0 35.0 90.0
Run 2 25.0 50.0 80.0
Run 3 25.0 45.0 75.0
Mean±\pmStd 25.0±0.025.0\pm 0.0 43.3±7.643.3\pm 7.6 81.7±7.681.7\pm 7.6
EqC (ours) Run 1 30.0 45.0 100.0
Run 2 30.0 80.0 100.0
Run 3 30.0 60.0 95.0
Mean±\pmStd 30.0±0.0\mathbf{30.0\pm 0.0} 61.7±17.6\mathbf{61.7\pm 17.6} 98.3±2.9\mathbf{98.3\pm 2.9}

Appendix E Robot Agent as Expert

A separate garment-folding proof of concept replaces the human recovery expert with a prepared GPT-6-Astra robot agent. Automation begins after original human demonstrations and extensive expert preparation; that preparation cost is separate from the six routine recoveries used to update EqC.

Experimental setup.

Use Run 1’s seed-trained garment checkpoint and the same γ=0.2/persistence gate. On an alarm, pause EqC and let the prepared agent adapt a recovery script to the current scene.

Expert agent preparation.

The agent studies all 18 demonstrations, writes control code, repeatedly practices full folding with revision until near-perfect success, then practices takeover from partial task states and consolidates skills. Routine takeover subsequently adapts and executes code without per-low-level-action language calls or post-execution skill updates. The number and cost of preparation attempts are not quantified, so six recoveries is not the total expert-development budget.

Algorithm 2 Expert Agent Preparation and Routine Takeover
Notation. P P : control script; 𝒮 \mathcal{S} : skill library; z z : observed intervention state; τ \tau : execution record, including the observed outcome. 1: Initial demonstrations 𝒟 0 \mathcal{D}_{0} ;
full-task practice rounds R full R_{\mathrm{full}} ;
takeover practice rounds R takeover R_{\mathrm{takeover}} 2: P ← AstraFitScript ​ ( 𝒟 0 ) P\leftarrow\textsc{AstraFitScript}(\mathcal{D}_{0}) 3: 𝒮 ← ∅ \mathcal{S}\leftarrow\varnothing 4: 5: Stage 1: Full-task practice 6: for r = 1 , … , R full r=1,\ldots,R_{\mathrm{full}} do 7: τ ← ExecuteFromTaskStart ​ ( P ) \tau\leftarrow\textsc{ExecuteFromTaskStart}(P) 8: P ← AstraRefineScript ​ ( P , 𝒮 , τ ) P\leftarrow\textsc{AstraRefineScript}(P,\mathcal{S},\tau) 9: 𝒮 ← AstraConsolidateSkills ​ ( 𝒮 , P , τ ) \mathcal{S}\leftarrow\textsc{AstraConsolidateSkills}(\mathcal{S},P,\tau) 10: end for 11: 12: Stage 2: Takeover practice 13: for r = 1 , … , R takeover r=1,\ldots,R_{\mathrm{takeover}} do 14: z ← WaitForEqCAlarm z\leftarrow\textsc{WaitForEqCAlarm} ⊳ \triangleright EqC pauses at the intervention state 15: P ~ ← AstraAdaptScript ​ ( P , 𝒮 , z ) \widetilde{P}\leftarrow\textsc{AstraAdaptScript}(P,\mathcal{S},z) 16: τ ← ExecuteRecovery ​ ( P ~ , z ) \tau\leftarrow\textsc{ExecuteRecovery}(\widetilde{P},z) 17: P ← AstraRefineScript ​ ( P ~ , 𝒮 , τ ) P\leftarrow\textsc{AstraRefineScript}(\widetilde{P},\mathcal{S},\tau) 18: 𝒮 ← AstraConsolidateSkills ​ ( 𝒮 , P ~ , τ ) \mathcal{S}\leftarrow\textsc{AstraConsolidateSkills}(\mathcal{S},\widetilde{P},\tau) 19: end for 20: 21: Stage 3: Routine takeover 22: ( P ⋆ , 𝒮 ⋆ ) ← ( P , 𝒮 ) (P^{\star},\mathcal{S}^{\star})\leftarrow(P,\mathcal{S}) 23: for each subsequent EqC alarm do 24: z ← ObserveInterventionState z\leftarrow\textsc{ObserveInterventionState} 25: P ~ ← AstraAdaptScript ​ ( P ⋆ , 𝒮 ⋆ , z ) \widetilde{P}\leftarrow\textsc{AstraAdaptScript}(P^{\star},\mathcal{S}^{\star},z) 26: τ ← ExecuteRecovery ​ ( P ~ , z ) \tau\leftarrow\textsc{ExecuteRecovery}(\widetilde{P},z) 27: RecordRecoveryDemonstration ( τ \tau ) ⊳ \triangleright No post-execution reflection or skill updates 28: end for

Takeover and policy learning.

Six routine agent recoveries are combined with the original 18 demonstrations. The updated policy completes 20/20 autonomous garment trials without takeover. This is a single-checkpoint, single-task proof of concept, separate from the three-run human-expert comparison.

Equation 74
|𝒟0|=18,|𝒬Astra|=6,𝒟1=𝒟0∪𝒬Astra,|𝒟1|=24.|\mathcal{D}_{0}|=18,\quad|\mathcal{Q}_{\mathrm{Astra}}|=6,\quad\mathcal{D}_{\mathrm{1}}=\mathcal{D}_{0}\cup\mathcal{Q}_{\mathrm{Astra}},\quad|\mathcal{D}_{\mathrm{1}}|=24. (74)

Implications.

The experiment illustrates two stages of transfer: a large model’s reasoning becomes executable recovery skills, then those recoveries supervise a smaller policy. It supports automated routine collection after preparation, without demonstrating an expert-free system from scratch.

Appendix F Cross-Task Continual Learning and Catastrophic Forgetting

The cross-task study tests recovery from interference between block and cup stacking, rather than a general lifelong-learning benchmark or a forgetting-free update rule.

Protocol.

Start from the selected Run-1 stacking checkpoint at 100% block success and 0% cup success. Adding six cup recoveries yields 50% cup but drops blocks to 60%, showing actual forgetting. A further six cup and six block recoveries bring both to 100% in the reported evaluation, with 66 cumulative demonstrations. EqC helps target new and regressed skills; it does not prevent the first regression, and no multi-run cross-task comparison is supplied.

Figure 5: Cross-task adaptation on Hierarchical Cup Stacking. Top (Round 0): Zero-shot deployment causes grasp slippage and drift, promptly caught by a persistent UΔ​EU_{\Delta E} failure alarm. Bottom (Round 2): After two rounds of Energy-Gated DAgger, the policy achieves fully autonomous execution, cleanly assembling the three-tier cup tower.
Figure 5: Cross-task adaptation on Hierarchical Cup Stacking . Top (Round 0): Zero-shot deployment causes grasp slippage and drift, promptly caught by a persistent U Δ ​ E U_{\Delta E} failure alarm. Bottom (Round 2): After two rounds of Energy-Gated DAgger, the policy achieves fully autonomous execution, cleanly assembling the three-tier cup tower.
Table 18: Progressive performance (%) across continual learning rounds under task shift.
Metric / Task Round 0 (Base) Round 1 (+6 Cup) Round 2 (+6 Cup, +6 Block)
Cumulative Demos 48 (Block only) 54 (48 Block, 6 Cup) 66 (54 Block, 12 Cup)
Block Stacking Success 100.0 60.0 100.0
Cup Stacking Success 0.0 50.0 100.0
Dual-Task Average 50.0 55.0 100.0

Appendix G Ablation Study

Ablations examine step-size schedules and gradient-based early stopping. Control success and optimizer-step counts are the measured quantities; detector calibration transfer is not established by these tables.

G.1 Robustness to Optimization Step Schedules

Uniform 15-step and 20-step schedules yield 93.1% and 94.2% LIBERO success, versus 94.3% with cosine decay. This supports control robustness to these schedules. The prose extends the claim to failure detection, but Table 19 reports success rates rather than detection metrics.

Table 19: Success rate (%) of EqC under different optimization step schedules across the LIBERO suites. The highest values in each column are highlighted in bold.
Methods Goal Spatial Object Long Average
EqC (uniform 15 steps) 95.8 95.2 98.4 83.0 93.1
EqC (uniform 20 steps) 95.4 96.2 98.0 87.2 94.2
EqC (Cosine decay) 95.6 97.2 98.6 85.4 94.3

G.2 Adaptive Inference

DiT mean gradient norm falls from 49.3 to 0.3 over 32 steps, while energy saturation reaches 99.22% at step 7 and 99.91% at step 9. Stopping below gradient 1.0 averages 16.8 steps with 93.7% success; threshold 3.0 uses 11.1 steps with 94.2%, versus 32 steps/94.0%. These are about 47.5% and 65.3% fewer refinement steps, not directly measured wall-clock savings or proof that every trajectory has converged.

Table 20: Convergence profile of mean gradient norm ‖∇E‖\|\nabla E\| and normalized energy saturation ratio across optimization steps kk on LIBERO.
Step kk 00 55 66 77 88 99 1414 1919 3232
Mean Gradient Norm ‖∇E‖\|\nabla E\| 49.3 44.4 29.9 12.9 6.0 3.6 1.2 0.7 0.3
EE Saturation Ratio (%) 0.00 82.51 95.18 99.22 99.79 99.91 99.99 – –
Table 21: Performance and inference efficiency under adaptive early stopping across LIBERO task suites. Metrics are reported as Success Rate (%) / Average Optimization Steps per action chunk.
Task Suite Baseline (K=32K=32) gmin=1.0g_{\mathrm{min}}=1.0 gmin=3.0g_{\mathrm{min}}=3.0
libero_goal 95.695.6 / 32.032.0 97.097.0 / 16.916.9 97.097.0 / 11.111.1
libero_spatial 96.496.4 / 32.032.0 95.295.2 / 17.317.3 98.098.0 / 11.311.3
libero_object 98.198.1 / 32.032.0 98.098.0 / 16.216.2 97.697.6 / 10.910.9
libero_long 85.585.5 / 32.032.0 84.684.6 / 16.816.8 84.284.2 / 10.910.9
Average 94.0\mathbf{94.0} / 32.0\mathbf{32.0} 93.7\mathbf{93.7} / 16.8\mathbf{16.8} 94.2\mathbf{94.2} / 11.1\mathbf{11.1}

Appendix H Case Study: Detection Timeliness and Failure Modes

Qualitative examples show when warnings occur relative to visible execution problems. They illustrate mechanisms and failure modes, without supplying population-level rates of irreversible damage or recoverability.

Figure 6: Proactive competence-boundary detection of EqC across rigid and deformable manipulation. Persistent UΔ​EU_{\Delta E} violations trigger timely expert recovery at the earliest onset of execution drift, preserving an ample window for teleoperation before irreversible physical compounding occurs. Top row (Hierarchical Block Stacking): Left: Alarm raised when the block is accidentally pushed away, preventing it from being pushed further; Right: Alarm triggered by angular misalignment. Bottom row (Garment Folding): Left: Alarm triggered when the robot attempts to grasp the right sleeve but fails to secure it; Right: Alarm triggered upon failure to fold the garment to the designated position.
Figure 6: Proactive competence-boundary detection of EqC across rigid and deformable manipulation. Persistent U Δ ​ E U_{\Delta E} violations trigger timely expert recovery at the earliest onset of execution drift, preserving an ample window for teleoperation before irreversible physical compounding occurs. Top row (Hierarchical Block Stacking): Left: Alarm raised when the block is accidentally pushed away, preventing it from being pushed further; Right: Alarm triggered by angular misalignment. Bottom row (Garment Folding): Left: Alarm triggered when the robot attempts to grasp the right sleeve but fails to secure it; Right: Alarm triggered upon failure to fold the garment to the designated position.

H.1 Proactive Detection by EqC at the Competence Boundary

EqC examples alarm after a displaced block, angular stacking misalignment, failed sleeve grasp or missed garment-fold target, while recovery remains possible. The original panels retain the scene and alarm labels; these selected cases complement the quantitative rollout analysis.

Figure 7: Qualitative failure modes of Galaxea G0.5 + Diff-DAgger across rigid and deformable manipulation. Rows 1–2 evaluate Hierarchical Block Stacking under nominal setups (two independent instances per category), while Row 3 evaluates Garment Folding. Left column (Delayed Detection): The detector remains silent throughout compounding drift, alarming only belatedly after the block arrangement is disrupted or a severe angular tilt has already occurred, missing the teleoperation recovery window. Middle column (Spurious Alarm): During nominal execution—including pristine, fully unfolded garment setups (Row 3)—noisy flow-loss expectation triggers false-positive alarms, needlessly aborting valid rollouts. Right column (Irreversible Failure): The detector triggers only after irrecoverable failures have occurred (e.g., mis-sequenced block placement or fabric bunched into an entangled knot), leaving no viable recovery path without a complete manual scene reset.
Figure 7: Qualitative failure modes of Galaxea G0.5 + Diff-DAgger across rigid and deformable manipulation. Rows 1–2 evaluate Hierarchical Block Stacking under nominal setups (two independent instances per category), while Row 3 evaluates Garment Folding . Left column (Delayed Detection): The detector remains silent throughout compounding drift, alarming only belatedly after the block arrangement is disrupted or a severe angular tilt has already occurred, missing the teleoperation recovery window. Middle column (Spurious Alarm): During nominal execution—including pristine, fully unfolded garment setups (Row 3)—noisy flow-loss expectation triggers false-positive alarms, needlessly aborting valid rollouts. Right column (Irreversible Failure): The detector triggers only after irrecoverable failures have occurred (e.g., mis-sequenced block placement or fabric bunched into an entangled knot), leaving no viable recovery path without a complete manual scene reset.

H.2 Pathology Diagnostics of Flow-Loss Detection (Diff-DAgger)

Diff-DAgger examples show delayed alarms during drift, spurious alarms in apparently competent execution, and alarms only after incorrect stacking or tangled fabric. These cases motivate earlier, more stable warnings; they do not imply that every baseline failure follows those patterns or that EqC never exhibits them.

Appendix I Code Availability

The authors link the EqC repository for implementation and evaluation procedures.

Concept demonstration

Open image ↗