[go: up one dir, main page]

AD-WM research project

AD-WMAction-Discriminative World Modelsfor Counterfactual Model Predictive Control

Learning to distinguish what different actions will do.

AD-WM preserves action-dependent changes in latent predictions, helping a world model compare candidate actions and plan toward an image goal.

3.7 → 52.0%

Cube hard-start success

Matched LeWM → AD-WM

42.2 → 71.1%

Franka pick-and-place success

Matched V-JEPA 2-AC → AD-WM

4 / 5

Simulation environments improve

Mean success vs. reproduced LeWM

01 / The problem

Good predictions.
But which action?

A recorded transition tells us what happened after one action. Planning asks a different question: which of several possible actions brings us closer to the goal?

When most visual content stays the same, a world model can achieve low prediction error while missing the small action-dependent changes that matter for control.

World models for planning need to preserve the differences between candidate actions.
A world model may collapse different candidate actions into similar predictions; AD-WM preserves distinctions that guide selection toward the cube-grasping goal.
Same observation. Alternative actions. Different consequences.

02 / The method

Make action information recoverable.

Residual latent prediction and two training objectives shape the transitions used by the planner.

01

Predict the change

The predictor estimates a latent increment and adds it to the current representation.

ẑt+1 = zt + Δẑt
02

Recover the action

Inverse dynamics and normalized action recovery encourage the current and predicted next representations to retain action information.

Predictor-level supervision
03

Plan with the learned model

CEM compares latent rollouts, executes the first action block, and replans. Auxiliary recovery heads are discarded at deployment.

Same MPC procedure
AD-WM training uses residual latent dynamics, inverse dynamics, normalized action recovery, and prediction supervision. At test time, a shared encoder and CEM planner compare counterfactual latent rollouts.
In simulation, the encoder and predictor are trained jointly with SIGReg. Robot post-training uses a frozen V-JEPA 2 encoder and omits SIGReg.

03 / Simulation results

Performance, robustness, and what drives the gains.

Complete main simulation comparisons and controlled ablations from the paper. HS denotes average success across Cube hard-start protocols P00–P04.

Performance across five environments

Performance across five environments, with error bars and baseline comparisons from the paper.
Open full-resolution figure ↗

Higher mean success than reproduced LeWM in four of five environments. PushT decreases from 94% to 92%. Reported literature baselines are shown separately; the improvement claim concerns the matched reproduction.

Where does Scene improve?

Where does Scene improve?, with error bars and baseline comparisons from the paper.
Open full-resolution figure ↗

Drawer: 63.3% → 69.3%; Window: 46.7% → 55.3%, each improving in all three matched seed comparisons. Button is similar and Cube remains difficult. The overall paired seed test is unresolved (p = 0.13).

Cross-environment plots retain the paper’s error bars: source SDs for overall results, population SDs for Scene subtasks. Scene uses 200 balanced hard-start episodes per checkpoint, 50 per subtask; other environments use original protocols.

Cube: complete external-baseline comparison

Cube success (%) on matched starts
MethodInferenceOriginalP00P01P02P03P04
LeWMCEM73.3 ± 2.58.0 ± 2.84.7 ± 0.94.7 ± 1.91.3 ± 1.90.0 ± 0.0
Fast-LeWMCEM80.024.020.010.02.00.0
Sub-JEPACEM78.034.020.010.010.010.0
INTACTPure CEM74.7 ± 0.920.0 ± 3.321.3 ± 9.313.3 ± 2.56.7 ± 1.93.3 ± 2.5
INTACTActor-CEM94.7 ± 2.578.7 ± 3.472.0 ± 5.756.0 ± 4.333.3 ± 12.410.7 ± 2.5
INTACTDirect98.7 ± 1.999.3 ± 0.999.3 ± 0.988.7 ± 1.935.3 ± 3.410.0 ± 0.0
AD-WMCEM90.7 ± 3.474.0 ± 2.868.0 ± 4.356.0 ± 1.636.7 ± 5.225.3 ± 3.4

50 matched episodes per protocol per checkpoint. Mean ± population SD over three checkpoints, except Fast-LeWM and Sub-JEPA (one checkpoint each). External methods retain native training and inference. Bold marks the highest displayed mean.

AD-WM improves over matched LeWM across every protocol. INTACT Direct leads from Original through P02; AD-WM reaches 25.3% on P04, versus 10.0% for Direct and 10.7% for Actor-CEM. P03 means are similar relative to checkpoint variation.

What makes the starts harder?

P00 begins on the tabletop without gripper contact; it already differs from Original despite zero perturbation. P00–P04 add cube xy perturbations of 0–4 cm, with clipping to the workspace.

Hard-start success rises from 3.7 ± 1.4% to 52.0 ± 3.1% for matched LeWM → AD-WM. P00–P01 are near-distribution controls; P02–P04 probe configuration tails within empirical cube xy support.

Quantifying configuration shift

Fraction beyond the training reference 95th percentile (%)
ProtocolJoint coordinatesRelative coordinates
P02 · 2 cm2.052.7
P03 · 3 cm38.780.7
P04 · 4 cm72.095.3

Nearest-neighbor distances to training states from other episodes. Joint coordinates combine cube xy and end-effector xyz; relative coordinates use end-effector-minus-cube xyz. Thresholds use 20,000 tabletop/non-contact reference states per seed.

Controlled ablations

Residual prediction and normalized recovery contribute the largest gains.

Matched images, encoder size, training budget, and MPC settings; three training seeds. Inv = inverse dynamics; MI = normalized action recovery motivated by conditional mutual information.

A. Component contributions

Component ablations · success (%)
VariantOriginal ↑Hard starts ↑
LeWM73.3 ± 2.53.7 ± 1.4
Abs. + Inv + MI83.3 ± 0.914.4 ± 2.9
Res82.7 ± 2.534.7 ± 1.6
Res + Inv83.3 ± 1.937.1 ± 4.7
Res + MI89.3 ± 3.854.7 ± 3.0
AD-WM90.7 ± 3.452.0 ± 3.1

Res denotes residual prediction. Res + MI reaches higher mean HS than the default combination; adding Inv at its default weight does not improve this mean. Means ± population SD.

B. Action recovery across inverse inputs

Inverse-input ablations · hard-start success (%)
Inv inputNo MIMI = 0.01
Predicted endpoints37.1 ± 4.752.0 ± 3.1
Encoded endpoints45.1 ± 4.460.7 ± 0.4
Predicted increment39.9 ± 2.160.3 ± 3.7

Inv weight = 0.1. MI always receives predicted endpoints. Changing Inv inputs tests Inv-input robustness, not MI-input robustness. Means ± population SD.

Post-hoc sensitivity

MI gains persist across the tested weight range.

All tested nonzero MI weights improve HS over no MI. The pre-specified default remains MI = 0.01 and Inv = 0.1; post-hoc peaks do not replace the headline model.

C. Normalized recovery weight

Vary MI weight; Inv weight = 0.1
MI weightOriginal ↑Hard starts ↑
083.337.1
0.00589.350.9
0.01 · default90.752.0
0.01590.760.4
0.0391.365.2
0.0588.061.5

Means over three seeds. Nonzero MI weights yield 50.9–65.2% HS, compared with 37.1% without MI.

D. Inverse-dynamics weight

Vary Inv weight; MI weight = 0.01
Inv weightOriginal ↑Hard starts ↑
089.354.7
0.0590.057.2
0.10 · default90.752.0
0.2092.057.5

Means over three seeds. Inv has a smaller, weight-dependent effect: weights 0.05 and 0.20 exceed the no-Inv mean; default 0.10 does not.

04 / Simulation demos

More tasks, starts, and goal configurations.

24 selected rollouts: Cube across Original and P00–P04, all four Scene subtasks, Reacher, TwoRoom, and PushT.

Paired clips show selected LeWM failures and AD-WM successes from matched starts; solo clips show selected AD-WM successes. These are qualitative examples, not an estimate of success rates. Playback omits planning waits. Scene clips come from supplementary recordings and do not replace the paper’s three-seed aggregate.

05 / Real-robot results & demos

Franka manipulation beyond simulation.

Basic pick-and-place, complex-object manipulation, and image-goal target selection. Explore 41 supplied clips, including four explicitly labeled failure examples.

Real-world transfer

Zero-shot Franka manipulation

A frozen V-JEPA 2 encoder and matched DROID post-training, without laboratory-specific adaptation.

19/45 → 32/45Basic pick-and-place successes

Franka robot setup, three evaluation protocols, and matched examples: AD-WM grasps the cube and moves the specified target while V-JEPA 2-AC misses the grasp or moves the wrong target.
Shared image goals, execution stages, gripper handling, action clipping, and CEM planning.
Successes / trials per model
EvaluationV-JEPA 2-ACAD-WM
Basic pick-and-place19 / 4532 / 45
Complex-object success2 / 105 / 10
Specified target moved14 / 2721 / 27
Specified-target lift-and-place9 / 2717 / 27

Evaluation uses manually supplied grasp, move, and place image goals with a structured execution pipeline. Trials use separate, non-randomized model blocks; smaller protocols have limited precision.

Watch the real-robot demos

Browse yellow cubes, orange cubes, orange cups, Labubu, and target selection across multiple layouts and recordings.

These supplied clips are qualitative examples, not the complete evaluation set or a new success-rate estimate. Source editing and playback timing are preserved; clip duration should not be interpreted as real-time planning latency. The robot uses manually supplied grasp, move, and place image goals. Failure clips are labeled by model and shown individually; they are not presented as synchronized matched trials.

06 / Understanding the planner

Evaluate the actions a planner keeps.

CEM uses a small elite set to guide its search. The quality of these candidates matters for what happens next.

Prediction error and whole-bank ranking do not follow control success

Prediction, selection, and control · mean ± population SD, three seeds
VariantOne-step MSE ↓Local MSE ↓CAD ↑Best-elite regret ↓Elite-mean regret ↓HS (%) ↑
LeWM2.72 ± 0.0610.36 ± 0.480.460 ± 0.0100.074 ± 0.0060.298 ± 0.0103.7 ± 1.4
Res3.61 ± 0.2011.17 ± 0.610.469 ± 0.0050.046 ± 0.0030.250 ± 0.00934.7 ± 1.6
Res + Inv3.43 ± 0.1111.00 ± 0.280.470 ± 0.0050.043 ± 0.0020.245 ± 0.00537.1 ± 4.7
Res + MI4.20 ± 0.0615.17 ± 0.040.454 ± 0.0020.029 ± 0.0020.228 ± 0.00254.7 ± 3.0
AD-WM4.27 ± 0.1015.77 ± 0.200.448 ± 0.0110.029 ± 0.0010.229 ± 0.00552.0 ± 3.1

MSE values are multiplied by 1,000; local MSE averages five rollout steps. CAD is whole-bank Spearman correlation. Both regrets use 30 elites from 300 shared candidates. Representation and scale affect latent MSE; absolute errors are not representation-independent physical metrics.

Across 15 model–seed observations, success correlates with CAD at −0.399, negative best-in-elite regret at 0.863, and negative elite-mean regret at 0.810. These descriptive associations concern fixed candidate banks, not adaptive CEM trajectories.
Additional evidence: paired uncertainty, local dynamics, and search geometry

A paired hierarchical bootstrap over seeds and cases gives best-in-elite regret reductions of 0.028 [0.014, 0.043] for LeWM → Res, 0.002 [−0.003, 0.009] for Res → Res + Inv, and 0.014 [0.009, 0.023] for Res + Inv → AD-WM (95% CIs). The Inv-only increment remains unresolved.

From LeWM to Res, latent-increment MSE falls from 0.0067 to 0.0055, and the fraction of consecutive predicted increments with negative cosine similarity falls from 0.242 to 0.146. From LeWM to AD-WM, CEM center-to-grid-minimum distance falls from 0.827 to 0.130 and mean elite spread from 0.448 to 0.082. These model-specific slices are consistent with more stable updates and concentrated search; they do not establish proximity to a shared physical optimum.

Shared candidate bank

Lower elite regret tracks higher success.

Best-in-elite regret measures how much worse the best realized candidate retained by the model is than the best candidate in the entire bank, normalized by the realized cost range.

Across five variants and three training seeds, lower regret is associated with higher Cube hard-start success: Spearman ρ = −0.863.

300 shared candidates, 30 elites. Realized outcomes are used for diagnostics only. This is a descriptive association on fixed banks; costs use each model’s own encoder.

View the diagnostic PDF ↗
Scatter plot of 15 model-seed observations: lower best-in-elite regret is associated with higher Cube hard-start success, Spearman correlation minus 0.863.
Five default-weight variants × three training seeds.
A shared action slice

Do low predicted costs lead closer to the goal?

One selected qualitative diagnostic compares both models on the same physical action grid, then executes each model’s predicted minimum.

Selected case 48; a 31 × 31 shared grid adds up to ±2 cm of x/y command offset per step to the first five steps of a common reference sequence, with action clipping. Model cost scales are separate; the reported physical error uses the same cube-to-goal distance. This selected example is not a new aggregate success estimate and does not establish a global optimum.

Takeaway

Preserve the differences
that matter for choosing actions.

Action-discriminative training improves the latent dynamics used for counterfactual MPC, with no additional modules at test time.

Read the full paper ↗